Fundamental concepts of qualitative probabilistic networks
Artificial Intelligence
ARC reduction and path preference in stochastic acyclic networks
Management Science
High level path planning with uncertainty
Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
Journal of the ACM (JACM)
Stochastic and dynamic shortest distance problems
Stochastic and dynamic shortest distance problems
Optimal paths in graphs with stochastic or multidimensional weights
Communications of the ACM
Simulation-based planning for multi-agent environments
Proceedings of the 29th conference on Winter simulation
Improved results for route planning in stochastic transportation
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Decision-Theoretic Control of Planetary Rovers
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Planning-Task Transformations for Soft Deadlines
ATAL '00 Proceedings of the 7th International Workshop on Intelligent Agents VII. Agent Theories Architectures and Languages
Cost Effective Mobile Agent Planning for Distributed Information Retrieval
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Methods for path and service planning under route constraints
International Journal of Computer Applications in Technology
Methods for path and service planning under route constraints
International Journal of Computer Applications in Technology
State space search for risk-averse agents
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Reliability theory model and expected life shortest path in stochastic and time-dependent networks
ICCS'03 Proceedings of the 2003 international conference on Computational science
Optimal factory scheduling using stochastic dominance A*
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Intelligent command control for VLSI CAD systems
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Stochastic motion planning and applications to traffic
International Journal of Robotics Research
Using qualitative relationships for bounding probability distributions
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Optimal factory scheduling using stochastic dominance A
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
An axiomatic approach to robustness in search problems with multiple scenarios
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Hi-index | 0.00 |
Standard algorithms for finding the shortest path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are deterministic. We consider the problem of uncertain edge costs, with potential probabilistic dependencies among the costs. Although these dependencies violate the standard dynamic-programming decomposition, we identify a weaker stochastic consistency condition that justifies a generalized dynamic-programming approach based on stochastic dominance. We present a revised path-planning algorithm and prove that it produces optimal paths under time-dependent uncertain costs. We test the algorithm by applying it to a model of stochastic bus networks, and present empirical performance results comparing it to some alternatives. Finally, we consider extensions of these concepts to a more general class of problems of heuristic search under uncertainty.