Volume 23 Issue 7/8- Publication Date: 1 July-August 2004
Expected Shortest Paths for Landmark-Based Robot Navigation
A.J. Briggs, C. Detweiler, D. Scharstein, Middlebury College, Middlebury, VT 05753, USA and A. Vandenberg-Rodes Princeton University, Princeton, NJ 08544, USA

In this paper we address the problem of planning reliable landmarkbased robot navigation strategies in the presence of significant sensor uncertainty. The navigation environments are modeled with directed weighted graphs in which edges can be traversed with given probabilities. To construct robust and efficient navigation plans, we compute "expected shortest paths" in such graphs. We formulate the expected shortest paths problem as a Markov decision process and provide two algorithms for its solution. We demonstrate the practicality of our approach using an extensive experimental analysis using graphs with varying sizes and parameters.

Return to Contents