Anytime Dynamic A*: An Anytime, Replanning Algorithm

We present a graph-based planning and replanning algorithm able to produce bounded suboptimal solutions in an anytime fashion. Our algorithm tunes the quality of its solution based on available search time, at every step reusing previous search efforts. When updated information regarding the underlying graph is received, the algorithm incrementally repairs its previous solution. The result is an approach that combines the benefits of anytime and incremental planners to provide efficient solutions to complex, dynamic search problems. We present theoretical analysis of the algorithm, experimental results on a simulated robot kinematic arm, and two current applications in dynamic path planning for outdoor mobile robots.

[1]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[2]  Mark S. Boddy,et al.  An Analysis of Time-Dependent Planning , 1988, AAAI.

[3]  Richard E. Korf,et al.  Linear-Space Best-First Search , 1993, Artif. Intell..

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

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

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

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

[8]  Shlomo Zilberstein,et al.  Approximate Reasoning Using Anytime Algorithms , 1995 .

[9]  Andrew G. Barto,et al.  Learning to Act Using Real-Time Dynamic Programming , 1995, Artif. Intell..

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

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

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

[13]  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).

[14]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[15]  Qiang Bi,et al.  Hybrid evolutionary motion planning using follow boundary repair for mobile robots , 2001, J. Syst. Archit..

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

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

[18]  Anthony Stentz,et al.  Multi-robot exploration controlled by a market economy , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[19]  Julie D Thompson,et al.  Multiple Sequence Alignment Using ClustalW and ClustalX , 2003, Current protocols in bioinformatics.

[20]  Eric A. Hansen,et al.  Multiple sequence alignment using anytime A* , 2002, AAAI/IAAI.

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

[22]  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).

[23]  David Furcy,et al.  Heuristic Search-Based Replanning , 2002, AIPS.

[24]  Sebastian Thrun,et al.  ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.

[25]  Anthony Stentz,et al.  The Delayed D* Algorithm for Efficient Path Replanning , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[26]  S. Thrun,et al.  Anytime Dynamic A * : The Proofs , 2005 .