Creating High-quality Paths for Motion Planning

Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, the path must be of a good quality as well. That is, a path should be short and should keep some amount of minimum clearance to the obstacles. Traveling along such a path reduces the chances of collisions due to the difficulty of measuring and controlling the precise position of the robot. This paper reports a new technique, called Partial shortcut, which decreases the path length. While current methods have difficulties in removing all redundant motions, the technique efficiently removes these motions by interpolating one degree of freedom at a time. Two algorithms are also studied that increase the clearance along paths. The first one is fast but can only deal with rigid, translating bodies. The second algorithm is slower but can handle a broader range of robots, including three-dimensional free-flying and articulated robots, which may reside in arbitrary high-dimensional configuration spaces. A big advantage of these algorithms is that clearance along paths can now be increased efficiently without using complex data structures and algorithms. Finally, we combine the two criteria and show that high-quality paths can be obtained for a broad range of robots.

[1]  Stefan Berchtold,et al.  A scalable optimizer for automatically generated manipulator motions , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[2]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[3]  Boris Baginski Efficient Motion Planning in High Dimensional Spaces: The Parallelized Z^3-Method , 1997 .

[4]  Mark H. Overmars,et al.  Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems , 1998, Int. J. Robotics Res..

[5]  Mark H. Overmars,et al.  Approximating Voronoi Diagrams of Convex Sites in any Dimension , 1998, Int. J. Comput. Geom. Appl..

[6]  Lydia E. Kavraki,et al.  Probabilistic Roadmaps for Robot Path Planning , 1998 .

[7]  Yong K. Hwang,et al.  SANDROS: a dynamic graph search algorithm for motion planning , 1998, IEEE Trans. Robotics Autom..

[8]  David Hsu,et al.  Placing a robot manipulator amid obstacles for optimized execution , 1999, Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470).

[9]  Thierry Siméon,et al.  Mobility analysis for feasibility studies in CAD models of industrial environments , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[10]  Nancy M. Amato,et al.  MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[11]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[12]  Nancy M. Amato,et al.  Choosing good distance metrics and local planners for probabilistic roadmap methods , 2000, IEEE Trans. Robotics Autom..

[13]  Dinesh Manocha,et al.  Interactive motion planning using hardware-accelerated computation of generalized Voronoi diagrams , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[14]  Howie Choset,et al.  Sensor-Based Exploration: The Hierarchical Generalized Voronoi Graph , 2000, Int. J. Robotics Res..

[15]  Pekka Isto,et al.  Constructing probabilistic roadmaps with powerful local planning and path optimization , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  Jean-Claude Latombe,et al.  On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination , 2002, Int. J. Robotics Res..

[17]  Nancy M. Amato,et al.  Extracting optimal paths from roadmaps for motion planning , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[18]  Nancy M. Amato,et al.  A general framework for sampling on the medial axis of the free space , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[19]  Gino van den Bergen,et al.  Collision Detection , 2003, Real-Time Rendering.

[20]  Gino van den Bergen Collision Detection in Interactive 3D Environments , 2003 .

[21]  Ellips Masehian,et al.  Online motion planning using incremental construction of medial axis , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[22]  O. Brock,et al.  Elastic Strips: A Framework for Motion Generation in Human Environments , 2002, Int. J. Robotics Res..

[23]  Jur P. van den Berg,et al.  The visibility--voronoi complex and its applications , 2005, EuroCG.

[24]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[25]  Mark H. Overmars,et al.  Creating High-quality Roadmaps for Motion Planning in Virtual Environments , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.