Expected Shortest Paths for Landmark-Based Robot Navigation  

Oleh:

Briggs, Amy J. ; Detweiler, Carrick ; Scharstein, Daniel ; Vandenberg-Rodes, Alexander

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: The International Journal of Robotics Research vol. 23 no. 7-8 (Jul. 2004), page 717-728.
Topik: mobile robot navigation; visual landmarks; probabilistic graphs; expected shortest paths
Fulltext: 717.pdf (332.01KB)

Isi artikel

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.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali