Shortest path optimization under limited information
Name
Rinehart-2009-Shortest path optimization under limited information.pdf
Size
406.36 KB
Format
Adobe PDF
Checksum (MD5)
3d869445826052a50df8575e80988fb6
Author(s)
Dahleh, Munther A.
Rinehart, Michael David
Date Issued
January 2010
Journal
Proceedings of the 48th IEEE Conference on Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Rinehart, M., and M.A. Dahleh. “Shortest path optimization under limited information.” Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on. 2009. 2064-2069. ©2010 IEEE.
Version
Final published version
Abstract
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 average-optimal solutions to the shortest-path problem, we consider an alternative problem where the agent that traverses the graph can request limited information about the graph before choosing a path to traverse. In this paper, we define and quantify a notion of information that is compatible to this performance-based framework, bound the performance of the agent subject to a bound on the capacity of the information it can request, and present algorithms for optimizing information.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/CDC.2009.5399666
