Approximation algorithms for curvature-constrained shortest paths

SIAM Journal on Computing

Volumn 30, Issue 6, 2000, Pages 1739-1772

  Agarwal, Pankaj K ^a   Wanq, Hongyan ^a  

^a Duke University   (United States)

Author keywords

Approximation algorithms; Configuration space; Motion planning; Robotics

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; MATHEMATICAL MODELS; MOTION PLANNING; PARAMETER ESTIMATION; PERTURBATION TECHNIQUES; ROBOTICS; ROBUSTNESS (CONTROL SYSTEMS); THEOREM PROVING;

APPROXIMATION ALGORITHMS; CONFIGURATION SPACE; CURVATURE CONSTRAINED SHORTEST PATHS; POLYGONAL OBSTACLES;

APPROXIMATION THEORY;

EID: 0035705865     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539796307790     Document Type: Article

References (52)

1. P. K. AGARWAL AND J. MATOUSEK, On range searching with semialgebraic sets, Discrete Cornput. Geom., 11 (1994), pp. 393-418.
2. P. K. AGARWAL, P. RAGHAVAN, AND H. TAMAKI, Motion planning for a steering-constrained robot through moderate obstacles, in Proceedings of the 27th ACM Symposium on Theory of Computing, Las Vegas, NV, 1995, pp. 343-352.
3. J. BARRAQUAND AND J. C. LATOMBE, Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles, Algorithmica, 10 (1993), pp. 121-155.
4. J. BENTLEY AND T. OTTMANN, Algorithms for reporting and counting intersections, IEEE Trans. Comput., 28 (1979), pp. 643-647
5. M. DE BERG, M. VAN KREVELD, M. OVERMARS, AND O. SCHWARZKOPF, Computational Geometry: Algorithms and Applications, Springer-Verlag, Berlin, 1998.
6. J. D. BOISSOXNAT AND X. N. Bui, Accessibility Region for a Car that Only Moves Forwards Along Optimal Paths, Tech. report 2181, INRIA, Sophia Antipolis, France, 1994.
7. J. D. BOISSONNAT, A. CEREZO, AND J. LEBLOND, Shortest paths of bounded curvature in the plane, in Proceedings of the IEEE International Conference on Robotics and Automation, IEEE Computer Society, Los Alamitos,' CA, 1992, pp. 2315-2320.
8. 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. report 2160, INRIA, Sophia Antipolis, France, 1994.
9. J. D. BOISSONNAT AND S. LAZARD, A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles, in Proceedings of the 12th ACM Symposium on Computational Geometry, Philadelphia, PA, 1996, pp. 242-251.
10. X. N. Bui, J. D. BOISSONNAT, P. SOUERES, AND J. P. LAUMOND, Shortest path synthesis for Dubins non-holonomic robot, in Proceedings of the IEEE International Conference on Robotics and Automation, IEEE Computer Society, Los Alamitos, CA, 1994, pp. 2-7.
11. J. CANNY, Some algebraic and geometric configurations in PSPACE, in Proceedings of the 20th ACM Symposium on Theory of Computing, Chicago, IL, 1988, pp. 460-467.
12. J. CANNY, private communication.
13. J. CANNY, B. DONALD, J. REIF, AND P. XAVIER, On the complexity of kinodynamic planning, in Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1988, pp. 306-316.
14. J. CANNY, A. REGE, AND J. REIF, An exact algorithm for kinodynamic planning in the plane, Discrete Comput. Geom., 6 (1991), pp. 461-484.
15. J. CANNY AND J. REIF, New lower bound techniques for robot motion planning, in Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1987, pp. 49-60.
16. K. L. CLARKSON, Approximation algorithms for shortest path motion planning, in Proceedings of the 19th ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 56-65.
17. E. J. COCKAYNE AND G. \V. C. HALL, Plane motion of a particle subject to curvature constraints, SIAM J. Control, 43 (1975), pp. 197-220.
18. R. COLE AND M. SHARIR, Visibility problems for polyhedral terrains, J. Symbolic Comput., 7 (1989), pp. 11-30.
19. T. H. COR.MEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1991.
20. B. DONALD AND P. XAVIER, Near-optimal kinodynamic planning for robots with coupled dynamics bounds, in Proceedings of the IEEE International Symposium on Intelligent Controls, IEEE Computer Society, Los Alamitos, CA, 1989, pp. 354-359.
21. 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), pp. 497-516.
22. S. FORTUNE AND G. WILFONG, Planning constrained motion, Ann. Math. Artificial Intelligence, 3 (1991), pp. 21-82.
23. T. FRAICHARD, Smooth trajectory planning for a car in a structured world, in Proceedings of the IEEE International Conference on Robotics and Automation, IEEE Computer Society, Los Alamitos, CA, 1991, pp. 2-7.
24. L. GUIBAS, M. OVERMARS, AND M. SHARIR, Ray Shooting, Implicit Point Location, and Related Queries in Arrangements of Segments, Tech. report 433, Department of Computer Science, New York University, New York, 1989.
25. D. HALPERIN, L. E. KAVRAKI, AND J.-C. LATOMBE, Robotics, in Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, eds., CRC Press, Boca Raton, FL, 1997, pp. 755-778.
26. J. IIOPCROFT, J. SCHWARTZ, AND M. SHARIR, EDS., Planning, Geometry, and Complexity of Robot Motion, Ablex Publishing, Norwood, NJ, 1984.
27. P. JACOBS AND J. CANNY, Planning smooth paths for mobile robots, in Nonholonomic Motion Planning, Z. Li and J.F. Canny, eds., Kluwer Academic, Nonvell, MA, 1992, pp. 271-342.
28. P. JACOBS, J. P. LAUMOND, AND M. TAIX, Efficient motion planners for nonholonomic mobile robots, in Proceedings of the IEEE/RSJ International Workshop on Intelligent Robots and Systems, IEEE Computer Society, Los Alamitos, CA, 1991, pp. 1229-1235.
29. K. KEDEM, R. LIVNE, J. PACH, AND M. SHARIR, On the union of Jordan regions and collisionfree translational motion amidst polygonal obstacles, Discrete Comput. Geom., 1 (1986), pp. 59-71.
30. V. P. ROSTOV AND E. V. DEGTIARIOVA-KOSTOVA, Suboptimal Paths in the Problem of a Planar Motion with Bounded Derivative of the Curvature, Tech. report, INRIA, Cedex, France, 1993.
31. V. P. KOSTOV AND E. V. DEGTIARIOVA-KOSTOVA, The Planar Motion with Bounded Derivative of the Curvature and its Suboptimal Paths, Tech. Report, INRIA, Cedex, France, 1994.
32. J. C. LATOMBE, Robot Motion Planning, Kluwer Academic Publishers, Nonvell, MA, 1991.
33. J. C. LATOMBE, A fast path-planner for a car-like indoor mobile robot, in Proceedings of the 9th National Conference on Artificial Intelligence, 1991, pp. 659-665.
34. J. P. LAUMOND, Finding collision free smooth trajectories for a nonholonomic mobile robot, in Proceedings of the 10th International Joint Conference on Artificial Intelligence, 1987, pp. 1120-1123.
35. J. P. LAUMOND, P. E. JACOBS, M. TAIX, AND R. M. MURRAY, A motion planner for nonholonomic mobile robots, IEEE Trans. Robotics and Automation, 10 (1994), pp. 577-593.
36. J. P. LAUMOND AND T. SIMEON, Motion Planning for a Two Degrees of Freedom Mobile Robot with Towing, Tech. report, LAAS/CNRS, LAAS, Toulouse, France, 1989.
37. J. P. LAUMOND, M. TAIX, AND P. JACOBS, A motion planner for car-like robots based on a global/local approach, in Proceedings of the IEEE/RSJ International Workshop on Intelligent Robots and Systems, IEEE Computer Society, Los Alamitos, CA, 1990, pp. 765-773.
38. Z. Li AND J. F. CANNY, EDS., Nonholonomic Motion Planning, Kluwer Academic Publishers, Nonvell, MA, 1992.
39. B. MIRTICH AND J. CANNY, Using skeletons for nonholonomic path planning among obstacles, in Proceedings of the IEEE International Conference on Robotics and Automation, IEEE Computer Society, Los Alamitos, CA, 1992, pp. 2533-2540.
40. Y. NAKAMURA AND R. MUKHERJEE, Nonholonomic path planning and automation, in Proceedings of the IEEE International Conference on Robotics and Automation, IEEE Computer Society, Los Alamitos, CA, 1989, pp. 1050-1055.
41. C. Ö'DÜNLAING, Motion planning with inertial constraints, Algorithmica, 2 (1987), pp. 431475.
42. F. PREPARATA, A note on locating a set of points in a planar subdivision, SIAM J. Comput., 8 (1979), pp. 542-545.
43. J. A. REEDS AND L. A. SIIEPP, Optimal paths for a car that goes both forwards and backwards, Pacific J. Math., 145 (1990), pp. 367-393.
44. J. H. REIF, Complexity of the generalized movers problem, in Planning, Geometry, and Complexity of Robot Motion, J. Hopcroft, J. Schwartz, and M. Sharir, eds., Ablex Publishing, Norwood, NJ, 1987, pp. 267-281.
45. J. H. REIF AND M. SHARIR, Motion planning in the presence of moving obstacles, in Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1985, pp. 144-154.
46. J. H. REIF AND S. R. TäTE, Approximate kinodynomic planning using L-norm dynamic bounds, Comput. Math. Appl., 27 (1994), pp. 29-44.
47. J. T. SCHWARTZ AND M. SHARIR, Motion planning and related geometric algorithms in robotics, in Proceedings of the International Congress of Mathematicians, 198G, pp. 1594-1611.
48. J. T. SCHWARTZ AND M. SHARIR, Algorithmic motion planning in robotics, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., Eisevier, Amsterdam, 1990, pp. 391-430.
49. II. J. SUSSMANN, Shortest -dimensional paths with a prescribed curvature bound, in Proceedings of the 34th Conference on Decision and Control, 1995, pp. 3306-3312.
50. H. J. SUSSMANN AND G. TANG, Shortest paths for the Reads-Shepp car; a worked out example of the use of geometric techniques in nonlinear optimal control, SIAM J. Control Optim., to appear.
51. G. WILFONG, Motion planning for an autonomous vehicle, in Proceedings of the IEEE International Conference on Robotics and Automation, IEEE Computer Society, Los Alamitos, CA, 1988, pp. 529-533.
52. G. WILFONG, Shortest paths for autonomous vehicles, in Proceedings of the IEEE International Conference on Robotics and Automation, IEEE Computer Society, Los Alamitos, CA, 1989, pp. 15-20.