Curvature-bounded traversals of narrow corridors

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 278-287

  Bereg, Sergey ^a   Kirkpatrick, David ^b  

^a The University of Texas at Dallas   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Computational geometry; Curvarure bounded traversals; Motion planning

Indexed keywords

BOUNDARY CONDITIONS; MATHEMATICAL MODELS; MOTION PLANNING;

CURVARURE-BOUNDED TRAVERSALS; CURVATURE-BOUNDED PATHS; POLYGONAL DOMAINS;

COMPUTATIONAL GEOMETRY;

EID: 33244467899     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064135     Document Type: Conference Paper

References (26)

1. P. Agarwal, T. Biedl, S. Lazard, S. Robbins, S. Suri, and S. Whitesides. Curvature-constrained shortest paths in a convex polygon. SIAM Journal on Computing, 31(6):1814-1851, 2002.
2. P. K. Agarwal, P. Raghavan, and H. Tamaki. Motion planning for a steering-constrained robot through moderate obstacles. In Proc. 27th Annu. ACM Sympos. Theory Comput., pages 343-352, 1995.
3. P. K. Agarwal and H. Wang. Approximation algorithms for curvature constrained shortest paths. SIAM Journal on Computing, 30(6): 1739-1772, 2002
4. J. Barraquand and J.-C. Latombe. Nonholonomic multi-body mobile robots: controllability and motion planning in the presence of obstacles. Algorithmica, 10:121-155, 1993.
5. T. Berglund, U. Erikson, H. Jonsson, K. Mrozek, , and I. Söderkvist. Automatic generation of smooth paths bounded by polygonal chains. In International Conference on Computational Intelligence for Modelling Control and Automation (CIMCA '2001), 2001.
6. J.-D. Boissonnat, S. Ghosh, T. Kavitha, and S. Lazard. An algorithm for computing a convex and simple path of bounded curvature in a simple polygon. Algorithmica, 34(2): 109-156, 2002.
7. J.-D. Boissonnat and S. Lazard. A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles. Int. J. Comput. Geometry Appl., 13(3): 189-229, 2003.
8. X.-N. Bui, P. Souères, J.-D. Boissonnat, and J.-P. Laumond. Shortest path synthesis for Dubins nonholonomic robot. In Proc. IEEE Internat. Conf. Robot. Autom., pages 2-7, 1994.
9. J. Canny and B. R. Donald. Simplified Voronoi diagrams. Discrete Comput. Geom., 3:219-236, 1988.
10. J. Canny and J. H. Reif. New lower bound techniques for robot motion planning problems. In Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci., pages 49-60, 1987.
11. L. E. Dubins. On curves of minimal length with a constant on average curvature and with prescribed initial and terminal positions and tangents. American Journal of Mathematics, 79:497-516, 1957.
12. S. Fortune and G. T. Wilfong. Planning constrained motion. Annals of Mathematics and Artificial Intelligence, 3(1):21-82, 1991.
13. L. J. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci., 39(2):126-152, 1989.
14. J. Hershberger, A new data structure for shortest path queries in a simple polygon. Inform. Process. Lett., 38:231-235, 1991.
15. J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl., 4:63-98, 1994.
16. J. Hershberger and S. Suri. An optimal algorithm for euclidean shortest paths in the plane. SIAM Journal on Computing, 28(6):2215-2256, 1999.
17. P. Jacobs and J. Canny. Planning smooth paths for mobile robots. In Proc. IEEE Internat. Conf. Robot. Autom., pages 2-7, 1989.
18. J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991.
19. J.-P. Laumond, P. Jacobs, M. Taix, and R. M. Murray. A motion planner for nonholonomic mobile robots. IEEE Trans. Robot. Autom., 10(5):577-593, 1994.
20. J.-P. Laumond(ed.). Robot motion planning and control. Springer-Verlag, New York, NY, 1998.
21. D. Lutterkort and J. Peters. Smooth paths in a polygonal channel. In Proc. 15th Annual ACM Sympos. on Comput. Geometry, pages 316-321, 1999.
22. C. Ó'Dúnlaing and C. K. Yap. A "retraction" method for planning the motion of a disk. J. Algorithms, 6:104-111, 1985.
23. J. Reif and H. Wang. The complexity of the two dimensional curvature-constrained shortest-path problem. In Proc. 3rd Workshop on the Algorithmic Foundations of Robotics, 1998.
24. J. H. Reif. Complexity of the generalized movers problem. In J. Hopcroft, J. Schwartz, and M. Sharir, editors, Planning, Geometry and Complexity of Robot Motion, pages 267-281. Ablex Publishing, Norwood, NJ, 1987.
25. J. T. Schwartz and M. Sharir. Algorithmic motion planning in robotics. In J. van Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, pages 391-430. Elsevier, Amsterdam, 1990.
26. J. Sellen. Approximation and decision algorithms for curvature- constrained path planning: A state-space approach. In Proc. 3rd Workshop on the Algorithmic Foundations of Robotics, 1998.