Fast replanning for navigation in unknown terrain

Mobile robots often operate in domains that are only incompletely known, for example, when they have to move from given start coordinates to given goal coordinates in unknown terrain. In this case, they need to be able to replan quickly as their knowledge of the terrain changes. Stentz' Focussed Dynamic A/sup */ (D/sup */) is a heuristic search method that repeatedly determines a shortest path from the current robot coordinates to the goal coordinates while the robot moves along the path. It is able to replan faster than planning from scratch since it modifies its previous search results locally. Consequently, it has been extensively used in mobile robotics. In this article, we introduce an alternative to D/sup */ that determines the same paths and thus moves the robot in the same way but is algorithmically different. D/sup */ Lite is simple, can be rigorously analyzed, extendible in multiple ways, and is at least as efficient as D/sup */. We believe that our results will make D/sup */-like replanning methods even more popular and enable robotics researchers to adapt them to additional applications.

[1]  Alberto Marchetti-Spaccamela,et al.  Dynamic algorithms for shortest paths in planar graphs , 1993, Theor. Comput. Sci..

[2]  Giuseppe F. Italiano,et al.  Fully dynamic all pairs shortest paths with real edge weights , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[3]  Seth Hutchinson,et al.  Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees , 1995, IEEE Trans. Robotics Autom..

[4]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[5]  Xiaoming Hu,et al.  Path planning and navigation of mobile robots in unknown environments , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[6]  Shimon Even,et al.  An On-Line Edge-Deletion Problem , 1981, JACM.

[7]  Hans Rohnert,et al.  A Dynamization of the All Pairs Least Cost Path Problem , 1985, STACS.

[8]  Philip N. Klein,et al.  Fully dynamic approximation schemes for shortest path problems in planar graphs , 1993 .

[9]  Vladimir J. Lumelsky,et al.  Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape , 1987, Algorithmica.

[10]  Andrew W. Moore,et al.  The parti-game algorithm for variable resolution reinforcement learning in multidimensional state-spaces , 2004, Machine Learning.

[11]  Karen Trovato.  Differential A*: an adaptive search method illustrated with robot path planning for moving obstacles and goals, and an uncertain environment , 1989, [Proceedings 1989] IEEE International Workshop on Tools for Artificial Intelligence.

[12]  John W. L. Ogilvie,et al.  Heuristics: Intelligent Search Strategies for Com- Puter Problem , 2001 .

[13]  Sven Koenig,et al.  Speeding up the Parti-Game Algorithm , 2002, NIPS.

[14]  Valerie King,et al.  Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[15]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.

[16]  Karen Trovato.  Differential a*: an Adaptive Search Method Illustrated with Robot Path Planning for Moving Obstacles and Goals, and an uncertain Environment , 1990, Int. J. Pattern Recognit. Artif. Intell..

[17]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..

[18]  Giuseppe F. Italiano,et al.  Finding Paths and Deleting Edges in Directed Acyclic Graphs , 1988, Inf. Process. Lett..

[19]  Sven Koenig,et al.  Incremental A* , 2001, NIPS.

[20]  Michael I. Jordan,et al.  Advances in Neural Information Processing Systems 30 , 1995 .

[21]  Philip N. Klein,et al.  A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs , 1993, WADS.

[22]  Sven Koenig,et al.  Incremental replanning for mapping , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[23]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[24]  David Furcy,et al.  Lifelong Planning A , 2004, Artif. Intell..

[25]  Chih-Chung Lin,et al.  On the dynamic shortest path problem , 1991 .

[26]  G. Swaminathan.  Robot Motion Planning , 2006 .

[27]  Martial Hebert,et al.  A complete navigation system for goal acquisition in unknown environments , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.

[28]  Daniele Frigioni,et al.  Semi-dynamic breadth-first search in digraphs , 2001, Theor. Comput. Sci..

[29]  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.

[30]  Gaurav S. Sukhatme,et al.  A portable, autonomous, urban reconnaissance robot , 2000, Robotics Auton. Syst..

[31]  Howie Choset,et al.  Sensor based planning. II. Incremental construction of the generalized Voronoi graph , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[32]  Shimon Even,et al.  How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions , 1990, Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'.

[33]  Daniele Frigioni,et al.  Fully dynamic output bounded single source shortest path problem , 1996, SODA '96.

[34]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[35]  Howie Choset,et al.  Sensor based planning and nonsmooth analysis , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[36]  Sven Koenig,et al.  Greedy mapping of terrain , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[37]  Anthony Stentz.  Map-Based Strategies for Robot Navigation in Unknown Environments , 1998 .

[38]  Daniele Frigioni,et al.  Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees , 1998, Algorithmica.

[39]  Leszek Podsedkowski,et al.  A new solution for path planning in partially known or unknown environment for nonholonomic mobile robots , 2001, Robotics Auton. Syst..

[40]  Koby Crammer,et al.  Advances in Neural Information Processing Systems 14 , 2002 .

[41]  Martial Hebert,et al.  Distributed robotic mapping of extreme environments , 2001, SPIE Optics East.

[42]  Alberto L. Sangiovanni-Vincentelli,et al.  A new shortest path updating algorithm , 1978, Networks.

[43]  Howie Choset,et al.  Sensor Based Planing, Part II: Incremental COnstruction of the Generalized Voronoi Graph , 1995, ICRA.

[44]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[45]  Giuseppe F. Italiano,et al.  Incremental algorithms for minimal length paths , 1991, SODA '90.

[46]  Sven Koenig,et al.  Improved fast replanning for robot navigation in unknown terrain , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[47]  Barry Brumitt,et al.  GRAMMPS: a generalized mission planner for multiple mobile robots in unstructured environments , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[48]  Shimon Even,et al.  Updating distances in dynamic graphs , 1985 .

[49]  FrigioniDaniele,et al.  Experimental analysis of dynamic algorithms for the single source shortest paths problem , 1998 .

[50]  Anthony Stentz,et al.  The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.

[51]  Martial Hebert,et al.  Experiments with driving modes for urban robots , 1999, Optics East.

[52]  Giuseppe F. Italiano,et al.  Fully dynamic all pairs shortest paths with real edge weights , 2006, J. Comput. Syst. Sci..

[53]  Nicholas S. Flann,et al.  Optimal route re-planning for mobile robots: a massively parallel incremental A* algorithm , 1997, Proceedings of International Conference on Robotics and Automation.