Variable sized grid cells for rapid replanning in dynamic environments

This paper presents a method for improving the runtime of an optimal heuristic path planner (A*) so that it can run repeatedly, in real-time, in a dynamic environment. This is necessary for mobile robots navigating in dynamic environments that have moving obstacles with associated costs, such as personal space around people or buffer zones around dangerous vehicles. Our approach is to modify the search space used by the A* algorithm, increasing the size of grid cells further from the robot. This approach relies on the notion that only the area closest to the robot needs to be searched carefully; areas further from the robot can be searched more coarsely. Because the planner is assumed to run repeatedly as the robot moves, the robot will always have a fine-grained path defined for its next action. We have experimentally verified in simulation that this algorithm can be run in real-time and produces paths that are comparable to full-resolution planning.

[1]  David Furcy,et al.  Incremental Heuristic Search in AI , 2004, AI Mag..

[2]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[3]  David Furcy,et al.  Incremental Heuristic Search in Artificial Intelligence , 2004 .

[4]  M. E. Shaw,et al.  Empirical investigations of a reconceptualized personal space , 1980 .

[5]  R. C. Coulter,et al.  Implementation of the Pure Pursuit Path Tracking Algorithm , 1992 .

[6]  Anthony Stentz,et al.  The D* Algorithm for Real-Time Planning of Optimal Traverses , 1994 .

[7]  Sven Koenig,et al.  Generalized Adaptive A* , 2008, AAMAS.

[8]  Hanan Samet,et al.  A hierarchical strategy for path planning among moving obstacles [mobile robot] , 1989, IEEE Trans. Robotics Autom..

[9]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

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

[11]  E. Hall,et al.  The Hidden Dimension , 1970 .

[12]  Reid G. Simmons,et al.  Approaches for heuristically biasing RRT growth , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[13]  Sven Koenig,et al.  Real-time adaptive A* , 2006, AAMAS '06.

[14]  James J. Kuffner,et al.  Multipartite RRTs for Rapid Replanning in Dynamic Environments , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[15]  Barry Brumitt,et al.  Framed-quadtree path planning for mobile robots operating in sparse environments , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[16]  Thierry Fraichard,et al.  Trajectory planning in a dynamic workspace: a 'state-time space' approach , 1998, Adv. Robotics.

[17]  R. Simmons,et al.  COMPANION: A Constraint-Optimizing Method for Person-Acceptable Navigation , 2009, RO-MAN 2009 - The 18th IEEE International Symposium on Robot and Human Interactive Communication.

[18]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

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