2013
DOI: 10.1155/2013/291372
|View full text |Cite
|
Sign up to set email alerts
|

2D Dubins Path in Environments with Obstacle

Abstract: We recapitulate the achievement about the Dubins path as well as some precise proofs which are important but omitted by Dubins. Then we prove that the shortest path (R*-geodesic) in environments with an obstacle consists of no more than five segments, each of which is either an arc or a straight line. To obtain suchR*-geodesic, an effective algorithm is presented followed by a numerical simulation as verification.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 19 publications
(7 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…Since then, a number of modifications and improvements have been proposed. In [ 84 ], authors have considered using Dubin’s curve with obstacle avoidance. Unmanned Aerial Vehicle (UAVs) navigation using predictive vector field control is proposed in [ 85 ] which uses Dubin curves.…”
Section: Path Smoothing Using Special Curvesmentioning
confidence: 99%
“…Since then, a number of modifications and improvements have been proposed. In [ 84 ], authors have considered using Dubin’s curve with obstacle avoidance. Unmanned Aerial Vehicle (UAVs) navigation using predictive vector field control is proposed in [ 85 ] which uses Dubin curves.…”
Section: Path Smoothing Using Special Curvesmentioning
confidence: 99%
“…Segmental paths include the linear path, circular path, segmental function path, etc. Continuous paths includes the B-spline curve, spline function, polynomial function, Dubins curve [12], clothoid curve [13], etc. The above methods have the characteristics of optimizing velocity and acceleration curves, but the planned trajectory cannot change with dynamic obstacles.…”
Section: Introductionmentioning
confidence: 99%
“…There mainly four types of the geometry-based approach, i.e. the Dubin curve [21], Bezier curve [22,23], spline [24] and polynomial curves [25]. Besides, the numerical optimization-based methods find feasible trajectories based on the differential cost function and constraints [26].…”
Section: Introductionmentioning
confidence: 99%