Shortest path optimization under limited information
The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite-state systems. While techniques in robust and stochastic programming can be employed to compute, respectively, worst-case and...
Main Authors: | Dahleh, Munther A., Rinehart, Michael David |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2010
|
Online Access: | http://hdl.handle.net/1721.1/60275 https://orcid.org/0000-0002-1470-2148 |
Similar Items
-
The value of information in shortest path optimization/
by: Rinehart, Michael David
Published: (2010) -
Asymptotic optimality of shortest path routing
Published: (2003) -
Optimally Controlling Hybrid Electric Vehicles using Path Forecasting
by: Kolmanovsky, Ilya V., et al.
Published: (2010) -
An auction algorithm for shortest paths
Published: (2003) -
Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
by: Glenn, Andrew M., 1978-
Published: (2014)