On addressing the run-cost variance in randomized motion planners

The decades of research in motion planning have resulted in numerous algorithms. Many of the most successful algorithms are randomized and can have widely differing run-times for the same problem instance from run to run. While this property is known to be undesirable from user's point of view, it has been largely ignored in past research. This paper introduces the large run-cost variance of randomized motion planners as a distinct issue to be addressed in future research. Run-cost variance is an important performance characteristic of an algorithm that should be studied together with the mean run-cost. As a positive example of possibilities for reducing the run-cost variance of a randomized motion planner, simple heuristic techniques are introduced and investigated empirically.

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

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

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

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

[5]  K. Gabriel,et al.  A Study of the Powers of Several Methods of Multiple Comparisons , 1975 .

[6]  Bernhard Glavina,et al.  Solving findpath by combination of goal-directed and randomized search , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[7]  Stefano Caselli,et al.  Parallel path planning with multiple evasion strategies , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[8]  Bruce Randall Donald,et al.  A Search Algorithm for Motion Planning with Six Degrees of Freedom , 1987, Artif. Intell..

[9]  Martti Mäntylä,et al.  Adaptive Strategies for Probabilistic Roadmap Construction , 2003 .

[10]  Lydia E. Kavraki,et al.  A framework for using the workspace medial axis in PRM planners , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

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

[12]  Daniel Vallejo,et al.  OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .

[13]  Lydia E. Kavraki,et al.  Planning Paths for Elastic Objects under Manipulation Constraints , 2001, Int. J. Robotics Res..

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

[15]  S.J.J. Smith,et al.  Empirical Methods for Artificial Intelligence , 1995 .

[16]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Daniel E. Koditschek,et al.  Exact robot navigation by means of potential functions: Some topological considerations , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[18]  Steven M. LaValle,et al.  On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[19]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[20]  Pierre Bessière,et al.  The Ariadne's Clew Algorithm , 1993, J. Artif. Intell. Res..

[21]  Steven M. LaValle,et al.  Quasi-randomized path planning , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[22]  Angel P. del Pobil,et al.  Practical Motion Planning in Robotics: Current Approaches and Future Directions , 1998 .

[23]  J. Latombe,et al.  Randomized Query Processing in Robot Motion Planning , 1998 .

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

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

[26]  B. Glavina.  A fast motion planner for 6-DOF manipulators in 3-D environments , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

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

[28]  Pekka Isto,et al.  A two-level search algorithm for motion planning , 1997, Proceedings of International Conference on Robotics and Automation.

[29]  Henning Tolle,et al.  Motion planning with many degrees of freedom-random reflections at C-space obstacles , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[30]  Koichi Kondo,et al.  Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration , 1991, IEEE Trans. Robotics Autom..

[31]  Lydia E. Kavraki,et al.  Randomized query processing in robot path planning , 1995, STOC '95.