Article

Free access

A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract)

Authors:

Jean-Daniel Boissonnat,

Sylvain LazardAuthors Info & Claims

SCG '96: Proceedings of the twelfth annual symposium on Computational geometry

Pages 242 - 251

https://doi.org/10.1145/237218.237393

Published: 01 May 1996 Publication History

PDF eReader

References

[1]

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

[2]

J. Barraquand and J-C. Latombe. Nonholonomic mobile robots and optimal maneuvering. Revue d'Intelligence artifie~eUe, 3:77-103, 1989.

Google Scholar

[3]

J. Barraquand and J-C. Latombe. Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles. Algorithmica, 10:121- 155, 1993.

Digital Library

Google Scholar

[4]

Behnke, Bachmann, and Fladt. Fundamentals of mathematics, Geometry, volume 1. MIT Press, 1986.

Google Scholar

[5]

J-D. Boissonnat and X-N. Bui. Accessibility region for a car that only moves forwards along optimal paths. Research Report 2181, INRIA, BP93, 06902 Sophia- Antipolis, France, 1994.

Google Scholar

[6]

J.-D. Boissonnat, A. C~r6zo, and J. Leblond. Shortest paths of bounded curvature in the plane, internat. J. Intell. Syst., 10:1-16, 1994.

Google Scholar

[7]

X-N. Bui, P. Sou~res, J-D. Boissonnat, and J-P. Laumond. Shortest path synthesis for Dubins nonholonomic robot. In IEEE Int. Conf. on Robotics and Automation, pages 2-7, San Diego, 8-13 Mai 1994.

Google Scholar

[8]

K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, iI. Discrete Comput. Geom., 4:387-421, 1989.

Digital Library

Google Scholar

[9]

D. P. Dobkin and D. L. Souvaine. Computational geometry in a curved world. Algorithmica, 5:421-457, 1990.

Crossref

Google Scholar

[10]

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

[11]

S. Fortune and G. Wilfong. Planning constrained motion. In Proc. 20th Annu. A CM Sympos. Theory Cornput., pages 445-459, 1988.

Digital Library

Google Scholar

[12]

P. Jacobs and J. Canny. Planning smooth paths for mobile robots. In Proc. IEEE Internat.,Conf. Robot. Autom., pages 2-7, 1989.

Crossref

Google Scholar

[13]

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, pages 1229-1235, 1991.

Crossref

Google Scholar

[14]

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.

Digital Library

Google Scholar

[15]

J-C. Latombe. A fast path-planner for a car-like indoor mobile robot. In Proceedings of the 9th National Conference on Artificial Intelligence, pages 659-665, 1991.

Google Scholar

[16]

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

Digital Library

Google Scholar

[17]

J-P. Laumond. Finding collision-free smooth trajectories for a non-holonomic mobile robot, in Proceedings of the International Joint Conference on Artificial intelligence, pages 1120-1123, 1987.

Google Scholar

[18]

J-P. Laumond, M. Taix, P. Jacobs, and R.M. Murray. A motion planner for nonholonomic mobile robots. IEEE Trans. on Robotics and Automation, 1993.

Google Scholar

[19]

Z. Li and J.F. Canny. Nonholonomie Motion Planning. Kluwer Academic Publishers, 1992.

Digital Library

Google Scholar

[20]

Y. Nakamura and R. Mukherjee. Nonholonomic path planning and automation. In Proc. IEEE lht. Conf. on Robotics and Automation, pages 1050-1055, 1989.

Google Scholar

[21]

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

Crossref

Google Scholar

[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. Research Report SYCON-91-10, Rutgers University, New Brunswick, NJ, 1991.

Google Scholar

[23]

H. Wang and P.K. Agarwal. Approximation algorithms for curvature constrained shortest paths. In Proc. 7th A CM-SIAM Sympos. Discrete Algorithms (SODA '96), 1996.

Digital Library

Google Scholar

[24]

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

Crossref

Google Scholar

[25]

G. Wilfong. Shortest paths for autonomous vehicles, in Proceedings of the IEEE International on Robotics and Automation, pages 15-20, 1989.

Crossref

Google Scholar

Cited By

View all

Fekete SKrupke D(2024)What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn CostsTheory of Computing Systems10.1007/s00224-024-10178-868:5(1207-1238)Online publication date: 5-Jun-2024
https://doi.org/10.1007/s00224-024-10178-8
Manyam SCasbeer D(2023)On Shortest Arc-To-Arc Dubins Path2023 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA48891.2023.10161550(10226-10232)Online publication date: 29-May-2023
https://doi.org/10.1109/ICRA48891.2023.10161550
Jha BChen ZShima T(2022)Time-optimal Dubins trajectory for moving obstacle avoidanceAutomatica10.1016/j.automatica.2022.110637146(110637)Online publication date: Dec-2022
https://doi.org/10.1016/j.automatica.2022.110637
Show More Cited By

Index Terms

A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract)
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Paths and connectivity problems
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Computing a Rectilinear Shortest Path amid Splinegons in Plane
Combinatorial Optimization and Applications
Abstract
We reduce the problem of computing a rectilinear shortest path between two given points s and t in the given splinegonal domain to the problem of computing a rectilinear shortest path between two points in the polygonal domain. Our reduction ...
Minimum-link shortest paths for polygons amidst rectilinear obstacles
Abstract
We compute shortest paths connecting two axis-aligned rectilinear simple polygons in the domain consisting of axis-aligned rectilinear obstacles in the plane. The bounding boxes, one defined for each polygon and one defined for each ...
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

We study the problems of processing single-source and two-point shortest path queries among weighted polygonal obstacles in the rectilinear plane. For the single-source case, we construct a data structure in O ( n log ^3/2 n ) time and O ( n log n ) ...

Comments

Information & Contributors

Information

Published In

SCG '96: Proceedings of the twelfth annual symposium on Computational geometry

May 1996

406 pages

ISBN:0897918045

DOI:10.1145/237218

Chairman:
Sue Whitesides
McGill Univ.

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 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SoCG96

Sponsor:

SoCG96: 12th ACM Symposium on Computational Geometry

May 24 - 26, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

SCG '96 Paper Acceptance Rate 48 of 93 submissions, 52%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
778
Total Downloads

Downloads (Last 12 months)42
Downloads (Last 6 weeks)8

Reflects downloads up to 22 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fekete SKrupke D(2024)What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn CostsTheory of Computing Systems10.1007/s00224-024-10178-868:5(1207-1238)Online publication date: 5-Jun-2024
https://doi.org/10.1007/s00224-024-10178-8
Manyam SCasbeer D(2023)On Shortest Arc-To-Arc Dubins Path2023 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA48891.2023.10161550(10226-10232)Online publication date: 29-May-2023
https://doi.org/10.1109/ICRA48891.2023.10161550
Jha BChen ZShima T(2022)Time-optimal Dubins trajectory for moving obstacle avoidanceAutomatica10.1016/j.automatica.2022.110637146(110637)Online publication date: Dec-2022
https://doi.org/10.1016/j.automatica.2022.110637
Manyam SCasbeer D(2020)Intercepting a Target Moving on a Racetrack Path2020 International Conference on Unmanned Aircraft Systems (ICUAS)10.1109/ICUAS48674.2020.9214023(799-806)Online publication date: Sep-2020
https://doi.org/10.1109/ICUAS48674.2020.9214023
Manyam SCasbeer DVon Moll AFuchs Z(2019)Shortest Dubins path to a circleAIAA Scitech 2019 Forum10.2514/6.2019-0919Online publication date: 6-Jan-2019
https://doi.org/10.2514/6.2019-0919
Ardentov AKaravaev YYefremov K(2019)Euler Elasticas for Optimal Control of the Motion of Mobile Wheeled Robots: the Problem of Experimental RealizationRegular and Chaotic Dynamics10.1134/S156035471903005524:3(312-328)Online publication date: 3-Jun-2019
https://doi.org/10.1134/S1560354719030055
Zou RBhattacharya S(2019)On Optimal Pursuit Trajectories for Visibility-Based Target-Tracking GameIEEE Transactions on Robotics10.1109/TRO.2018.288274735:2(449-465)Online publication date: Apr-2019
https://doi.org/10.1109/TRO.2018.2882747
Fekete SKrupke D(2019)Covering Tours and Cycle Covers with Turn Costs: Hardness and ApproximationAlgorithms and Complexity10.1007/978-3-030-17402-6_19(224-236)Online publication date: 6-Apr-2019
https://doi.org/10.1007/978-3-030-17402-6_19
Choudhury SDugar VMaeta SMacAllister BArora SAlthoff DScherer S(2019)High performance and safe flight of full‐scale helicopters from takeoff to landing with an ensemble of plannersJournal of Field Robotics10.1002/rob.2190636:8(1275-1332)Online publication date: 5-Sep-2019
https://doi.org/10.1002/rob.21906
Garone EDeterme JNaldi R(2012)A travelling salesman problem for a class of heterogeneous multi-vehicle systems2012 IEEE 51st IEEE Conference on Decision and Control (CDC)10.1109/CDC.2012.6426488(1166-1171)Online publication date: Dec-2012
https://doi.org/10.1109/CDC.2012.6426488
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

Computing a Rectilinear Shortest Path amid Splinegons in Plane

Minimum-link shortest paths for polygons amidst rectilinear obstacles

Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

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

Computing a Rectilinear Shortest Path amid Splinegons in Plane

Minimum-link shortest paths for polygons amidst rectilinear obstacles

Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

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

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations