Article

Free access

Reachability by paths of bounded curvature in convex polygons

Authors:

Hee-Kap Ahn,

Otfried Cheong,

Jiří Matoušek, and

Antoine VigneronAuthors Info & Claims

SCG '00: Proceedings of the sixteenth annual symposium on Computational geometry

May 2000

Pages 251 - 259

https://doi.org/10.1145/336154.336211

Published: 01 May 2000 Publication History

PDF eReader

References

[1]

P. K. Agarwal, T. Biedl, S. Lazard, S. e Robbins, S. Suri, and S. Whitesides. Curvature-constrained shortest paths in a convex polygon. In Proc. 14th Annu. A CM Sympos. Comput. Geom., pages 392-401, 1998.

Digital Library

Google Scholar

[2]

P. K. Agarwal, P. Raghavan, and H. Tamaki. Motion planning for a steering-constrained robot through moderate obstacles. In Proc. 27th Annu. A CM Sympos. Theory Comput., pages 343-352, 1995.

Digital Library

Google Scholar

[3]

J.-D. Boissonnat, A. C6r6zo, and J. Leblond. Shortest paths of bounded curvature in the plane. Internat. J. intell. Syst., 10:1-16, 1994.

Google Scholar

[4]

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. A CM Sympos. Comput. Geom., pages 242-251, 1996.

Digital Library

Google Scholar

[5]

J. Canny, B. R. Donald, J. Reif, and P. Xavier. On the complexity of kinodynamic planning. In Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci., pages 306-316, 1988.

Digital Library

Google Scholar

[6]

J. Canny, A. Rege, and J. Reif. An exact algorithm for kinodynamic planning in the plane. Discrete Comput. Geom., 6:461-484, 1991.

Digital Library

Google Scholar

[7]

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.

Crossref

Google Scholar

[8]

S. Fortune and G. Wilfong. Planning constrained motion. Annals of Math. and AI, 3:21-82, 1991.

Crossref

Google Scholar

[9]

P. Jacobs and J. Canny. Planning smooth paths for mobile robots. In Z. Li and J. F. Canny, editors, Nonholonomic Motion Planning, pages 271-342. Kluwer Academic Pubishers, Norwell, MA, 1992.

Google Scholar

[10]

J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991.

Digital Library

Google Scholar

[11]

G. Pestov and V. Ionin. On the largest possible circle imbedded in a given closed curve. Dok. Akad. Nauk SSSR, 127:1170-1172, 1959. (In Russian).

Google Scholar

[12]

J. A. Reeds and L. A. Shepp. Optimal paths for a car that goes both forwards and backwards. Pacific Journal of Mathematics, 145, 1990.

Google Scholar

[13]

J. Reif and M. Sharir. Motion planning in the presence of moving obstacles. J. A CM, 41:764-790, July 1994.

Digital Library

Google Scholar

[14]

J. Reif and H. Wang. The complexity of the two dimensional curvature-constrained shortest-path problem. In Proc. 3rd Workshop Algorithmic Found. Robot., page to appear, 1998.

Digital Library

Google Scholar

[15]

J. T. Schwartz and M. Sharir. Algorithmic motion planning in robotics. In J. van Leeuwen, editor, Algorithms and Complexity. Handbook of Theoretical Computer Science, vol. A, pages 391-430. Elsevier, Amsterdam, 1990.

Digital Library

Google Scholar

[16]

H. J. Sussmann. Shortest 3-dimensional paths with a prescribed curvature bound. In Proc. Conf. on Decision and control, pages 3306-3311, 1995.

Crossref

Google Scholar

[17]

P. Svestka and M. H. Overmars. Motion planning for car-like robots using a probabilistic learning approach. Internat. J. Robot. Res., 16:119-143, April 1997.

Digital Library

Google Scholar

[18]

H. Wang and P. K. Agarwal. Approximation algorithms for curvature constrained shortest paths. In Proc. 7th A CM-SIAM Sympos. Discrete Algorithms, pages 409-418, 1996.

Digital Library

Google Scholar

[19]

G. Wilfong. Motion planning for an autonomous vehicle. In Proc. IEEE Internat. Conf. Robot. Autom., pages 529-533, 1988.

Crossref

Google Scholar

Cited By

View all

Aamand AAbrahamsen MThorup M(2020)Disks in Curves of Bounded Convex CurvatureThe American Mathematical Monthly10.1080/00029890.2020.1752602127:7(579-593)Online publication date: 28-Jul-2020
https://doi.org/10.1080/00029890.2020.1752602
Cowlagi RTsiotras P(2014)Curvature-Bounded Traversability Analysis in Motion Planning for Mobile RobotsIEEE Transactions on Robotics10.1109/TRO.2014.231571130:4(1011-1019)Online publication date: Aug-2014
https://doi.org/10.1109/TRO.2014.2315711
Chitsaz HLaValle S(2007)Time-optimal paths for a Dubins airplane2007 46th IEEE Conference on Decision and Control10.1109/CDC.2007.4434966(2379-2384)Online publication date: Dec-2007
https://doi.org/10.1109/CDC.2007.4434966
Show More Cited By

Recommendations

Reachability by paths of bounded curvature in a convex polygon

Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P, we ...
Read More
A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
ISAAC '08: Proceedings of the 19th International Symposium on Algorithms and Computation

We address the problem of finding a polynomial-time approximation scheme for shortest bounded-curvature paths in the presence of obstacles. Given an arbitrary environment $\mathcal{E}$ consisting of polygonal obstacles, two feasible configurations, a length ...
Read More
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon

Abstract. In this paper we study the collision-free path planning problem for a point robot, whose path is of bounded curvature(i.e., constrained to have curvature at most 1), moving in the plane inside an n -sided simple polygon P . Given two points ...
Read More

Comments

Information & Contributors

Information

Published In

SCG '00: Proceedings of the sixteenth annual symposium on Computational geometry

May 2000

379 pages

ISBN:1581132247

DOI:10.1145/336154

Chairmen:
Siu-Wing Cheng
HKUST, Hong Kong
,
Otfried Cheong
HKUST, Hong Kong
,
Pankaj Agarwal
Duke Univ., Durham, N.C
,
Steven Fortune
Bell Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SoCG00

Sponsor:

SoCG00: The 16th Annual ACM Symposium on Computational Geometry

June 12 - 14, 2000

Kowloon, Clear Water Bay, Hong Kong

Acceptance Rates

SCG '00 Paper Acceptance Rate 41 of 123 submissions, 33%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
621
Total Downloads

Downloads (Last 12 months)49
Downloads (Last 6 weeks)2

Other Metrics

View Author Metrics

Citations

Cited By

View all

Aamand AAbrahamsen MThorup M(2020)Disks in Curves of Bounded Convex CurvatureThe American Mathematical Monthly10.1080/00029890.2020.1752602127:7(579-593)Online publication date: 28-Jul-2020
https://doi.org/10.1080/00029890.2020.1752602
Cowlagi RTsiotras P(2014)Curvature-Bounded Traversability Analysis in Motion Planning for Mobile RobotsIEEE Transactions on Robotics10.1109/TRO.2014.231571130:4(1011-1019)Online publication date: Aug-2014
https://doi.org/10.1109/TRO.2014.2315711
Chitsaz HLaValle S(2007)Time-optimal paths for a Dubins airplane2007 46th IEEE Conference on Decision and Control10.1109/CDC.2007.4434966(2379-2384)Online publication date: Dec-2007
https://doi.org/10.1109/CDC.2007.4434966
Lee JCheong OKwon WShin SChwa K(2003)Approximation of Curvature-Constrained Shortest Paths through a Sequence of PointsAlgorithms - ESA 200010.1007/3-540-45253-2_29(314-325)Online publication date: 11-Feb-2003
https://doi.org/10.1007/3-540-45253-2_29
Guha SJosiah PMittal ATran S(2002)Non-Delaunay-Based Curve ReconstructionAlgorithms and Computation10.1007/3-540-36136-7_8(79-90)Online publication date: 8-Nov-2002
https://doi.org/10.1007/3-540-36136-7_8

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Reachability by paths of bounded curvature in a convex polygon

A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Reachability by paths of bounded curvature in a convex polygon

A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations