Resolution complete rapidly-exploring random trees

Trajectory design for high-dimensional systems with nonconvex constraints has considerable success recently; however, the resolution completeness analysis for various methods is insufficient. In this paper, based on Lipschitz condition and the accessibility graph, conditions for resolution completeness are derived. By combining the systematic search with randomized technique, a randomized planner is transformed to be a deterministic resolution complete planner, which shows reliable performance in the simulation.

[1]  Jean-Claude Latombe,et al.  Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[2]  Bruce Randall Donald,et al.  Kinodynamic motion planning , 1993, JACM.

[3]  B. Donald,et al.  Kinodynamic Motion Planning 1 Kinodynamic Motion Planning 5 , 1993 .

[4]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[5]  Steven M. LaValle,et al.  Algorithms for Computing Numerical Optimal Feedback Motion Strategies , 2001, Int. J. Robotics Res..

[6]  Kevin M. Lynch,et al.  Stable Pushing: Mechanics, Controllability, and Planning , 1995, Int. J. Robotics Res..

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

[8]  F. Bullo,et al.  Randomized searches and nonlinear programming in trajectory planning , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[9]  Jean-Claude Latombe,et al.  Kinodynamic motion planning amidst moving obstacles , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[10]  Hongyan Wang,et al.  Non-Uniform Discretization Approximations for Kinodynamic Motion Planning and its Applications , 1996 .

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

[12]  John F. Canny,et al.  Time-optimal trajectories for a robot manipulator: a provably good approximation algorithm , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[13]  D. Bertsekas.  Convergence of discretization procedures in dynamic programming , 1975 .

[14]  Francesco Bullo,et al.  Motion Planning for Nonlinear Underactuated Vehicles using Hm Techniques , 2001 .

[15]  E. Feron,et al.  Robust hybrid control for autonomous vehicle motion planning , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[16]  Steven M. LaValle,et al.  Reducing metric sensitivity in randomized trajectory design , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[17]  D. Delchamps.  Extracting state information form a quantized output record , 1990 .

[18]  Bruce Randall Donald,et al.  Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open chain manipulators , 1990, SCG '90.

[19]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[20]  Chee Yap,et al.  The exact computation paradigm , 1995 .

[21]  D. Delchamps.  Stabilizing a linear system with quantized state feedback , 1990 .

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