Between Dec 19, 2024 and Jan 2, 2025, datasets can be submitted to DRUM but will not be processed until after the break. Staff will not be available to answer email during this period, and will not be able to provide DOIs until after Jan 2. If you are in need of a DOI during this period, consider Dryad or OpenICPSR. Submission responses to the UDC may also be delayed during this time.
 

Turning a Corner with a Dubins Car

Koval, Alan
Isler, Volkan
2018-09-14
Thumbnail Image

View/Download File

18-015_0.pdf (404.68 KB)

Persistent link to this item

https://hdl.handle.net/11299/216031
Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Turning a Corner with a Dubins Car

Authors

Published Date

2018-09-14

Publisher

Type

Report

Abstract

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. An implementation and online demo is provided at: sites.google.com/umn.edu/rsnlabdemos/home/dubins-2018

Keywords

Description

Related to

Replaces

License

Collections

Computer Science & Engineering (CS&E) Technical Reports

Series/Report Number

Technical Report; 18-015

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

Koval, Alan; Isler, Volkan. (2018). Turning a Corner with a Dubins Car. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/216031.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.