A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles

International Journal of Computational Geometry and Applications

Volumn 13, Issue 3, 2003, Pages 189-229

  Boissonnat, Jean Daniel ^a   Lazard, Sylvain ^b  

^a INRIA   (France)

^b LORIA   (France)

Author keywords

Computational geometry; Curvature constrained shortest paths; Mobile robot; Non holonomic motion planning

Indexed keywords

EID: 0037490973     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195903001128     Document Type: Article

References (23)

1. P. K. Agarwal, P. Raghavan and H. Tamaki, Motion planning for a steering-constrained robot through moderate obstacles, in Proc. 27th Annual ACM Symp. on Theory of Computing, ACM, New York (1995) pp. 343-352.
2. J. Barraquand and J.-C. Latombe, Nonholonomic multi-body mobile robots: Controllability and motion planning in the presence of obstacles, Algorithmica 10 (1993) 121-155.
3. H. Behnke, F. Bachmann, K. Fladt and W. Suss, Fundamentals of mathematics, Geometry, volume 1, MIT Press, 1986.
4. J.-D. Boissonnat and X.-N. Bui, Accessibility Region for a Car that Only Moves Forwards along Optimal Paths, Research Report 2181, INRIA, Le Chesnay Cedex, France, 1994.
5. J.-D. Boissonnat, A. Cérézo and J. Leblond, Shortest paths of bounded curvature in the plane, Internat. J. Intell. Syst. 10 (1994) 1-16.
6. J.-D. Boissonnat and S. Lazard, Convex hulls of bounded curvature, in Proc. 8th Canadian Conference on Computational Geometry, Ottawa (1996) pp. 14-19.
7. J.-D. Boissonnat and S. Lazard. A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles. In Proc. 12th Annu. ACM Symp. on Computational Geometry, Philadelphia, PA (1996) pp. 242-251.
8. X.-N. Bui, P. Souères, J.-D. Boissonnat and J.-P. Laumond, The shortest path synthesis for non-holonomic robots moving forwards, in Proc. IEEE Internat. Conf. on Robotics and Automation, San Diego, CA (1994) pp. 2-7.
9. L. Cesari, Optimization, theory and applications, Springier-Verlag, 1983.
10. K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989) 387-421.
11. D. P. Dobkin and D. L. Souvaine, Computational geometry in a curved world, Algorithmica 5 (1990) 421-457.
12. L. E. Dubins, On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents, Amer. J. Math. 79 (1957) 497-516.
13. S. Fortune and G. Wilfong, Planning constrained motion, Ann. Math. Artificial Intelligence 3 (1991) 21-82.
14. P. Jacobs, Minimal length curvature constrained paths in the presence of obstacles, Research Report 90042, LAAS, 7, av du colonel-Roche 31077 Toulouse Cedex, 1990.
15. P. Jacobs and J. Canny, Planning smooth paths for mobile robots, in Nonholonomic Motion Planning, eds. Z. Li and J. Canny (Kluwer Academic Publishers, Norwell, MA, 1992) 271-342.
16. K. Kedem, R. Livne, J. Pach, and Micha Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete Comput. Geom. 1 (1986) 59-71.
17. J.-C. Latombe, Robot Motion Planning, Kluwer Academic Publishers, Norwell, MA, 1991.
18. S. Lazard, Planification de trajectoires de robots mobiles non-holonomes et de robots à pattes, Thèse de doctorat en sciences, université Paris 6, France (1996).
19. Z. Li and J.F. Canny, Nonholonomic Motion Planning, Kluwer Academic Publishers, 1992.
20. J.-P. Laumond, P. Jacobs, M. Taix and R. Murray, A motion planner for nonholonomic mobile robots, IEEE Trans. Robotics Automation, 10 (1994) 577-593.
21. J. A. Reeds and L. A. Shepp, Optimal paths for a car that goes both forwards and backwards, Pacific J. Math. 145 (1990) 367-393.
22. H. J. Sussmann and G. Tang, Shortest Paths for the Reeds-Shepp Car: A Worked Out Example of the Use of Geometric Techniques in Nonlinear Optimal Control, Report SYCON-91-10, Rutgers University, New Brunswick, NJ, 1991.
23. H. Wang and P. K. Agarwal, Approximation algorithms for curvature-constrained shortest paths, in Proc. 7th ACM-SIAM Symp. on Discrete Algorithms, Atlanta, G A (1996) pp. 409-418.