Approximation algorithms for curvature-constrained shortest paths

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 409-418

  Wang, Hongyan ^a   Agarwal, Pankaj K ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MOTION PLANNING;

BEST-KNOWN ALGORITHMS; COLLISION-FREE; CURVATURE CONSTRAINED; EDGE LENGTH; OPTIMAL PATH PLANNING; RUNNING TIME; SHORTEST PATH; TIME ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 79960129979     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. P.K. Agarwal, P. Raghavan, and H. Tamaki. Motion planning for a steering-constrained robot through moderate obstacles. In Proc. 27th ACM Symp. Theory of Computing, pages 343-352, 1995.
2. J. Barraquand and J.C. Latombe. Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles. Algorithmica, 10:121-155, 1993.
3. J.D. Boissonnat and X.N. Bui. Accessibility region for a car that only moves forwards along optimal paths. Tech. Rept. 2181, INRIA, Sophia Antipolis, France, 1994.
4. J.D. Boissonnat, A. Cerezo, and J. Leblond. Shortest paths of bounded curvature in the plane. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 2315-2320, 1992.
5. J.D. Boissonnat, A. Cerezo, and J. Leblond. A note on shortest paths in the plane subject to a constraint on the derivative of the curvature. Tech. Rept. 2160, INRIA, Sophia Antipolis, France, 1994.
6. X.N. Bui, J.D. Boissonnat, P. Soueres, and J.P. Laumond. Shortest path synthesis for Dubins nonholonomic robot. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 2-7, 1994.
7. J. Canny. Some algebraic and geometric configurations in PSPACE. In Proc. 20th ACM Symp. Theory of Computing., pages 460-467, 1988.
8. J. Canny. Private communication.
9. J. Canny, B. Donald, J. Reif, and P. Xavier. On the complexity of kinodynamic planning. In Proc. 29th Symp. Foundations of Computer Science, pages 306-316, 1988.
10. J. Canny, A. Rege, and J. Reif. An exact algorithm for kinodynamic planning in the plane. Discrete Comput. Geom., 6:461-484, 1991.
11. J. Canny and J. Reif. New lower bound techniques for robot motion planning. In Proc. 28th Symp. Foundations of Computer Science, pages 49-60, 1987.
12. K.L. Clarkson. Approximation algorithms for shortest path motion planning. In Proc. 9th Symp. Theory of Computing, pages 56-65, 1987.
13. E. Cockayne and G. Hall. Plane motion of a particle subject to curvature constraints. SIAM J. Control, 43.197-220, 1975.
14. R. Cole and M. Sharir. Visibility problems for polyhedral terrains. J. Symbolic Comput., 7:11-30, 1989.
15. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. The MIT Press, MA, 1991.
16. B. Donald and P. Xavier. Near-optimal kinodynamic planning for robots with coupled dynamics bounds. In IEEE Int. Symp. Intelligent Controls, pages 354-359, 1989.
17. 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:497-516, 1957.
18. S. Fortune and G. Wilfong. Planning constrained motion. Annals of Mathematics and Artificial Intelligence, 3:21-82, 1991.
19. T. Fraichard. Smooth trajectory planning for a car in a structured world. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 2-7, 1991.
20. L. Guibas, M. Overmars, and M. Sharir. Ray shooting, implicit point location, and related queries in arrangements of segments. Tech. Rept. 433, Dept. Computer Science, New York University, New York, 1989.
21. J. Hopcroft, J. Schwartz, and M. Sharir, editors. Planning, Geometry, and Complexity of Robot Motion. Ablex Publishing Corp., Norwood, NJ, 1984.
22. P. Jacobs and J. Canny. Planning smooth paths for mobile robots. In Nonholonomic Motion Planning (Z. Li and J. Canny, editors), Kluwer Academic, Norwell, MA, pages 271-342, 1992.
23. P. Jacobs, J.P. Laumond, and M. Taix. Efficient motion planners for nonholonomic mobile robots. In Proc. IEEE/RSJ Int. Workshop on Intelligent Robots and Systems, pages 1229-1235, 1991.
24. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom. 1:59-71, 1986.
25. V.P. Kostov and E.V. Degtiariova-Kostova. Suboptimal paths in the problem of a planar motion with bounded derivative of the curvature. Tech. Rept., INRIA, Cedex, France, 1993.
26. V.P. Kostov and E.V. Degtiariova-Kostova. The planar motion with bounded derivative of the curvature and its suboptimal paths. Tech. Rept., INRIA, Cedex, France, 1994.
27. J.C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Norwell, MA, 1991.
28. J.C. Latombe. A fast path-planner for a car-like indoor mobile robot. In Proc. 9th National Conf. on Artificial Intelligence, pages 659-665, 1991.
29. J.P. Laumond. Finding collision free smooth trajectories for a nonholonomic mobile robot. In Proc. 10th Int. Joint Conf. on Artificial Intelligence, pages 1120-1123, 1987.
30. J.P. Laumond, P.E. Jacobs, M. Taix, and R.M. Murray. A motion planner for nonholonomic mobile robots. IEEE Trans, on Robotics and Automation, 10:577-593, 1994.
31. J.P. Laumond and T. Simeon. Motion planning for a two degrees of freedom mobile robot with towing. Tech. Rept., LAAS/CNRS, LAAS, Toulouse France, 1989.
32. J.P. Laumond, M. Taix, and P. Jacobs. A motion planner for car-like robots based on a global/local approach. In Proc. IEEE/RSJ Int. Workshop on Intelligent Robots and Systems, pages 765-773, 1990.
33. Z. Li and J.F. Canny, editors. Nonholonomic Motion Planning. Kluwer Academic Publishers, Norwell, MA, 1992.
34. B. Mirtich and J. Canny. Using skeletons for nonholonomic path planning among obstacles. In Proc. IEEE Int. Conf. on Robotics and Autonomation, pages 2533-2540, 1992.
35. Y. Nakamura and R. Mukherjee. Nonholonomic path planning and automation. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 1050-1055, 1989.
36. C. O'Dunlaing. Motion planning with inertial constraints. Algorithmica, 2:431-475, 1987.
37. J.A. Reeds and L.A. Shepp. Optimal paths for a car that goes both forwards and backwards. Pacific J. of Mathematics, 145:367-393, 1990.
38. J. H. Reif. Complexity of the generalized movers problem. In Planning, Geometry and Complexity of Robot Motion (J. Hopcroft, and J. Schwartz, and M. Sharir, editors), Ablex Publishing Corp., Norwood, NJ, pages 267-281, 1987.
39. J. H. Reif and M. Sharir. Motion planning in the presence of moving obstacles. In Proc. 26th IEEE Symp. Foundations of Computer Science, pages 144-154, 1985.
40. J.H. Reif and S.R. Tate. Approximate kinodynomic planning using L2-norm dynamic bounds. Computers Math. Applic, 27:29-44, 1994.
41. J.T. Schwartz and M. Sharir. Motion planning and related geometric algorithms in robotics. In Proc. Int. Congress of Mathematicians, pages 1594-1611, 1986.
42. J.T. Schwartz and M. Sharir. Algorithmic motion planning in robotics. In Handbook of Theoretical Computer Science, Vol. A (J. van Leeuwen, editor), Elsevier, Amsterdam, pages 391-430, 1990.
43. G. Wilfong. Motion planning for an autonomous vehicle. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 529-533, 1988.
44. G. Wilfong. Shortest paths for autonomous vehicles. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 15-20, 1989.