Parallel path planning with multiple evasion strategies

Probabilistic path planning driven by a potential field is a well established technique and has been successfully exploited to solve complex problems arising in a variety of domains. However, planners implementing this approach are rather inefficient in dealing with certain types of local minima occurring in the potential field, especially those characterized by deep or large attraction basins. In this paper, we present a potential field planner combining "smart" escape motions from local minima with parallel computation to improve overall performance. The results obtained show significant improvement in planning time, along with remarkable reduction in standard deviation. A performance comparison on a benchmark problem of the potential field planner and an existing, state-of-the-art planner is also included. Our investigation confirms the effectiveness of potential field as heuristic to solve difficult path planning problems.

[1]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

[2]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[3]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[4]  Stefano Caselli,et al.  ERPP: An experience-based randomized path planner , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[5]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[6]  David Hsu,et al.  Randomized single-query motion planning in expansive spaces , 2000 .

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

[8]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[9]  Tsai-Yen Li,et al.  Assembly maintainability study with motion planning , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[10]  L. Graux,et al.  Integration of a Path Generation Algorithm into Off-line Programming of AIRBUS Panels , 1992 .

[11]  Vipin Kumar,et al.  Parallel search algorithms for robot motion planning , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[12]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[13]  Nancy M. Amato,et al.  Probabilistic roadmap methods are embarrassingly parallel , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[14]  Stefano Caselli,et al.  An experimental evaluation of collision detection packages for robot motion planning , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[15]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[16]  Nancy M. Amato,et al.  An adaptive framework for 'single shot' motion planning: a self-tuning system for rigid and articulated robots , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[17]  Stefano Caselli,et al.  Randomized motion planning on parallel and distributed architectures , 1999, Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99.

[18]  Jean-Claude Latombe,et al.  Planning motions with intentions , 1994, SIGGRAPH.

[19]  Jean-Claude Latombe,et al.  Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts , 1999, Int. J. Robotics Res..

[20]  Stefano Caselli,et al.  Heuristic methods for randomized path planning in potential fields , 2001, Proceedings 2001 IEEE International Symposium on Computational Intelligence in Robotics and Automation (Cat. No.01EX515).

[21]  Wolfgang Ertel,et al.  Random competition: a simple, but efficient method for parallelizing inference systems , 1990, Forschungsberichte, TU Munich.

[22]  Dominik Henrich,et al.  Fast Motion Planning by Parallel Processing – a Review , 1997, J. Intell. Robotic Syst..

[23]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[24]  Dominik Henrich,et al.  Randomized Parallel Motion Planning for Robot Manipulators , 1996 .

[25]  Jean-Claude Latombe,et al.  On multi-arm manipulation planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[26]  Rajeev Motwani,et al.  Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..

[27]  Lydia E. Kavraki,et al.  On finding narrow passages with probabilistic roadmap planners , 1998 .

[28]  Vipin Kumar,et al.  A parallel formulation of informed randomized search for robot motion planning problems , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.