Optimal Synthesis in the Reeds and Shepp Problem with Onesided Variation of Velocity
暂无分享,去创建一个
[1] L. Dubins. On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .
[2] M. Hestenes. Calculus of variations and optimal control theory , 1966 .
[3] L. Shepp,et al. OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .
[4] J. Sussmann,et al. SHORTEST PATHS FOR THE REEDS-SHEPP CAR: A WORKED OUT EXAMPLE OF THE USE OF GEOMETRIC TECHNIQUES IN NONLINEAR OPTIMAL CONTROL. 1 , 1991 .
[5] Jean-Daniel Boissonnat,et al. Shortest paths of bounded curvature in the plane , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[6] Jean-Daniel Boissonnat,et al. Shortest paths of bounded curvature in the plane , 1994, J. Intell. Robotic Syst..
[7] P. Souéres,et al. Shortest paths synthesis for a car-like robot , 1996, IEEE Trans. Autom. Control..
[8] H. Sussmann,et al. The Markov-Dubins problem with angular acceleration control , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.
[9] Jean-Paul Laumond,et al. Robot Motion Planning and Control , 1998 .
[10] F. Monroy-Pérez,et al. Non-Euclidean Dubins' Problem , 1998 .
[11] Jean-Paul Laumond,et al. Guidelines in nonholonomic motion planning for mobile robots , 1998 .
[12] A. A. Mili︠u︡tin,et al. Calculus of variations and optimal control , 1998 .
[13] David A. Anisi,et al. Nearly time-optimal paths for a ground vehicle , 2003 .
[14] Devin J. Balkcom,et al. Generalizing the dubins and reeds-shepp cars: Fastest paths for bounded-velocity mobile robots , 2008, 2008 IEEE International Conference on Robotics and Automation.
[15] Valerii Patsko,et al. From Dubins’ car to Reeds and Shepp’s mobile robot , 2009 .
[16] Shahram Payandeh,et al. Optimal-control approach to trajectory planning for a class of mobile robotic manipulations , 2010 .
[17] Ivan Samylovskiy,et al. Optimal synthesis in the Reeds and Shepp problem with a free final direction , 2013 .