1 |
J. Barraquand and J.-C. Latombe. On nonholonomic mobile robots and optimal maneuvering, Revue d'Intelligence Artificielle, 3(2):77-104, 1989
|
2 |
P. Jacobs and J. Canny. Planning smooth paths for mobile robots. In Nonholonomic Motion Planning, Z. Li and J. F. Canny, editors, pages 271-342, Kluwer Academic Publishers, Norwell, MA, 1992
|
3 |
P. Jacobs, J.-P. Laumond and M. Taix. Efficient motion planners for non-holonomic mobile robots. In IEEE/RSJ Int. Workshop on Intelligent Robots and Systems, 1991
DOI
|
4 |
M. Vendittelli and J.-P. Laumond. Obstacle distance for car-like robots. IEEE Trans. Robot. Automat., 15(4):678-691, 1999
DOI
ScienceOn
|
5 |
L. E. Dubins. On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents. American Journal of Mathematics, 79:497-516, 1957
DOI
ScienceOn
|
6 |
H. K. Ahn, O. Cheong, Ji?? Matou?ek and Antoine Vigneron. Reachability by paths of bounded curvature in convex polygons. In Proc. 16th Annu. ACM Symposium on Computational Geometry, pages 251-259, 2000
DOI
|
7 |
J.-D. Boissonnat, A. Cerezo and J. Leblond. Shortest paths of bounded curvature in the plane. Proc. IEEE Int. Conf. on Robotics and Automation, pages 2315-2320, 1992
DOI
|
8 |
J.-D. Boissonnat and S. Lazard. A polynomialtime algorithm for computing a shortest path of bounded curvature amidst moderate obstacles. ACM Symp. on Computational Geometry, pages 242-251, 1996
|
9 |
X.-N. Bui, P. Soueres, J.-D. Boissonnat and J.-P. Laumond. Shortest path synthesis for Dubins non-holonomic robots, Proc. IEEE Int. Conf. on Robotics and Automation, pages 2-7, 1994
DOI
|