AIAA Scitech 2019 Forum 2019
DOI: 10.2514/6.2019-0919
|View full text |Cite
|
Sign up to set email alerts
|

Shortest Dubins path to a circle

Abstract: The Dubins path problem had enormous applications in path planning for autonomous vehicles. In this paper, we consider a generalization of the Dubins path planning problem, which is to find a shortest Dubins path that starts from a given initial position and heading, and ends on a given target circle with the heading in the tangential direction. This problem has direct applications in Dubins neighborhood traveling salesman problem, obstacle avoidance Dubins path planning problem etc. We characterize the length… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 21 publications
(10 citation statements)
references
References 14 publications
0
10
0
Order By: Relevance
“…Given the initial point P s and final point P f , the shortest path includes a combination of three path segments: a straight line segment (S) and an arc segment with a minimum radius (R or L). The four cases, LSL, LSR, RSR, and RSL, of the Dubins path are composed of two curved segments and a straight segment [20]. The shortest path is selected by comparing the four generated paths.…”
Section: Dubins Path Generationmentioning
confidence: 99%
“…Given the initial point P s and final point P f , the shortest path includes a combination of three path segments: a straight line segment (S) and an arc segment with a minimum radius (R or L). The four cases, LSL, LSR, RSR, and RSL, of the Dubins path are composed of two curved segments and a straight segment [20]. The shortest path is selected by comparing the four generated paths.…”
Section: Dubins Path Generationmentioning
confidence: 99%
“…Here, as before, the symbol 'L' corresponds to a left-arc turn and the symbol 'R' to a right-arc turn. Note that there are algorithms that build a Dubins path to a circle [40,41], but they cannot be directly adapted for our purposes.…”
Section: Path-planning Algorithm For Detouring Obstaclesmentioning
confidence: 99%
“…The Dubins path [ 25 , 26 , 27 ] is the shortest path between any two configurations, and can be more precisely characterized as: , and , where L denotes “turn left”, R denotes “turn right”, and S denotes “go straight”. The six classes of Dubins path mentioned can be divided into and curves, which are shown in Figure 1 .…”
Section: Introductionmentioning
confidence: 99%