Turning a corner with a dubins car

Alan Koval, Volkan Isler

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We study the problem of computing shortest collision-free Dubins paths when turning a corner. We present a sufficient condition for a closed-form solution. Specifically, consider S as the set consisting of paths of the form RSRSR, RSRSL, LSRSR and LSRSL that pass through the interior corner, where sub-paths RSR, RSL, and LSR are elementary Dubins paths composed of segments which are either straight (S) or turning left (L) or right (R). We find the closed-form optimal path around a corner when S is nonempty. Our solution can be used in an efficient path planner, for example, when navigating corridors. It can also be used as a subroutine for planners such as RRTs.

Original languageEnglish (US)
Title of host publication2019 International Conference on Robotics and Automation, ICRA 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages7
ISBN (Electronic)9781538660263
StatePublished - May 2019
Event2019 International Conference on Robotics and Automation, ICRA 2019 - Montreal, Canada
Duration: May 20 2019May 24 2019

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
ISSN (Print)1050-4729


Conference2019 International Conference on Robotics and Automation, ICRA 2019

Bibliographical note

Funding Information:
VIII. ACKNOWLEDGEMENTS This paper was the result of a National Science Foundation Research Experience for Undergraduates (REU) fellowship during the summer of 2018 for the awards #1525045 and #1617718.

Publisher Copyright:
© 2019 IEEE.

Copyright 2019 Elsevier B.V., All rights reserved.

Fingerprint Dive into the research topics of 'Turning a corner with a dubins car'. Together they form a unique fingerprint.

Cite this