Choosing landmarks for risky planning

This work examines the effect of landmark placement on the efficiency and accuracy of risk-bounded searches over probabilistic costmaps for mobile robot path planning. In previous work, risk-bounded searches were shown to offer in excess of 70% efficiency increases over normal heuristic search methods. The technique relies on precomputing distance estimates to landmarks which are then used to produce probability distributions over exact heuristics for use in heuristic searches such as A* and D*. The location and number of these landmarks therefore influence greatly the efficiency of the search and the quality of the risk bounds. Here four new methods of selecting landmarks for risk based search are evaluated. Results are shown which demonstrate that landmark selection needs to take into account the centrality of the landmark, and that diminishing rewards are obtained from using large numbers of landmarks.

[1]  Andrew V. Goldberg,et al.  Computing Point-to-Point Shortest Paths from External Memory , 2005, ALENEX/ANALCO.

[2]  Judea Pearl,et al.  Studies in Semi-Admissible Heuristics , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[4]  Larry R. Harris.  The Bandwidth Heuristic Search , 1973, IJCAI.

[5]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[6]  Paul Newman,et al.  Risky planning: Path planning over costmaps with a probabilistically bounded speed-accuracy tradeoff , 2011, 2011 IEEE International Conference on Robotics and Automation.

[7]  Sebastian Thrun,et al.  Anytime Dynamic A*: An Anytime, Replanning Algorithm , 2005, ICAPS.

[8]  Maxim Likhachev,et al.  D*lite , 2002, AAAI/IAAI.

[9]  Aristides Gionis,et al.  Fast shortest path distance estimation in large networks , 2009, CIKM.

[10]  David Mould,et al.  An Hierarchical Terrain Representation for Approximately Shortest Paths , 2004, PRICAI.

[11]  Rina Dechter,et al.  Eighteenth national conference on Artificial intelligence , 2002 .

[12]  Haim Kaplan,et al.  Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.

[13]  Donald S. Fussell,et al.  Computer rendering of stochastic models , 1982, Commun. ACM.

[14]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[15]  David Mould,et al.  LPI : Approximating Shortest Paths using Landmarks , 2008 .

[16]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[17]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[18]  A. Stentz,et al.  The Field D * Algorithm for Improved Path Planning and Replanning in Uniform and Non-Uniform Cost Environments , 2005 .