Framed-quadtree path planning for mobile robots operating in sparse environments

Mobile robots operating in vast outdoor unstructured environments often only have incomplete maps and must deal with new objects found during traversal. Path planning in such sparsely occupied regions must be incremental to accommodate new information, and, must use efficient representations. In previous work we have developed an optimal method D* to plan paths when the environment is not known ahead of time, but, rather is discovered as the robot moves around. To date, D* has been applied to a uniform grid representation for obstacles and free space. In this paper we propose the use of D* with framed quadtrees to improve the efficiency of planning paths in sparse environments. The new system has been tested in simulation as well on an autonomous jeep, equipped with local obstacle avoidance capabilities. We show how the use of framed quadtrees improves performance in terms of path length, computation speed, and memory requirements.

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

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

[3]  Roderic A. Grupen,et al.  The applications of harmonic functions to robotics , 1993, J. Field Robotics.

[4]  Hanan Samet,et al.  An Overview of Quadtrees, Octrees, and Related Hierarchical Data Structures , 1988 .

[5]  Daniel E. Koditschek,et al.  Automatic assembly planning and control via potential functions , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[6]  I. Jntroductjon Neighbor Finding Techniques for Images Represented by Quadtrees * , 1980 .

[7]  Anthony Stentz Optimal and efficient path planning for partially-known environments , 1994 .

[8]  Martial Hebert,et al.  Intelligent Unmanned Ground Vehicles , 1997 .

[9]  Alonzo Kelly,et al.  An intelligent, predictive control approach to the high-speed cross-country autonomous navigation problem , 1996 .

[10]  Martial Hebert SMARTY: Point-Based Range Processing for Autonomous Driving , 1997 .

[11]  Barry Brumitt,et al.  Dynamic mission planning for multiple mobile robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[12]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[13]  Danny Ziyi Chen,et al.  Planning conditional shortest paths through an unknown environment: a framed-quadtree approach , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.

[14]  Bruce Randall Donald,et al.  Real-time robot motion planning using rasterizing computer graphics hardware , 1990, SIGGRAPH.

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

[16]  Anthony Stentz Best Information Planning for Unknown, Uncertain, and Changing Domains , 1997 .