Extracting optimal paths from roadmaps for motion planning

We present methods for extracting optimal paths from motion planning roadmaps. Our system enables any combination of optimization criteria, such as collision detection, kinematic/dynamic constraints, or minimum clearance, and relaxed definitions of the goal state, to be used when selecting paths from roadmaps. Our algorithm is an augmented version of Dijkstra's shortest path algorithm which allows edge weights to be defined relative to the current path. We present simulation results maximizing minimum path clearance, minimizing localization effort, and enforcing kinematic/dynamic constraints.

[1]  Donald E. Kirk,et al.  Optimal control theory : an introduction , 1970 .

[2]  Mohamed F. Younis,et al.  A constrained shortest-path energy-aware routing algorithm for wireless sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[3]  Seth Hutchinson,et al.  Coordinating the motions of multiple robots with specified trajectories , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[4]  Lydia Tapia,et al.  C-space Subdivision and Integration in Feature-Sensitive Motion Planning , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[5]  Nancy M. Amato,et al.  Customizing PRM roadmaps at query time , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[6]  Yongji Wang,et al.  Solving a generalized constrained optimization problem with both logic AND and OR relationships by a mathematical transformation and its application to robot motion planning , 2000, IEEE Trans. Syst. Man Cybern. Part C.

[7]  Motoji Yamamoto,et al.  Quasi-time-optimal motion planning of mobile platforms in the presence of obstacles , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[8]  F. Ashcroft,et al.  VIII. References , 1955 .

[9]  Nancy M. Amato,et al.  An integrated mobile robot path (re)planner and localizer for personal robots , 2000, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[10]  Lydia Tapia,et al.  A Machine Learning Approach for Feature-Sensitive Motion Planning , 2004, WAFR.

[11]  Nancy M. Amato,et al.  Robust geometric-based localization in indoor environments using sonar range sensors , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[12]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1998, IEEE Trans. Robotics Autom..

[13]  Zvi Shiller,et al.  Planning motion patterns of human figures using a multi-layered grid and the dynamics filter , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[14]  S. LaValle,et al.  Efficient computation of optimal navigation functions for nonholonomic planning , 1999, Proceedings of the First Workshop on Robot Motion and Control. RoMoCo'99 (Cat. No.99EX353).

[15]  Nancy M. Amato,et al.  Feature-based localization using scannable visibility sectors , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[16]  Arthur C. Sanderson,et al.  Planning multiple paths with evolutionary speciation , 2001, IEEE Trans. Evol. Comput..

[17]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.