A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
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 adoi:10.1109/cdc.2009.5399666 dblp:conf/cdc/RinehartD09 fatcat:qwrrzpjiozgu5bmug5io4aofpy