2017
DOI: 10.2514/1.g002400
|View full text |Cite
|
Sign up to set email alerts
|

Smooth Path Planning for Unmanned Aerial Vehicles with Airspace Restrictions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(12 citation statements)
references
References 23 publications
0
9
0
Order By: Relevance
“…Obstacle avoidance in an open territory is an even harder task. In [ 41 ], convex polygon flight paths, which should be used to avoid ground obstacles of various shapes, are generated. Alternatively, as in [ 42 ], a certain safety buffer zone around the ground obstacles is applied and Dubins paths are used to look for an optimal flight path.…”
Section: Dubins Paths Methodologymentioning
confidence: 99%
“…Obstacle avoidance in an open territory is an even harder task. In [ 41 ], convex polygon flight paths, which should be used to avoid ground obstacles of various shapes, are generated. Alternatively, as in [ 42 ], a certain safety buffer zone around the ground obstacles is applied and Dubins paths are used to look for an optimal flight path.…”
Section: Dubins Paths Methodologymentioning
confidence: 99%
“…where ( ) = ( ), ( ) . Differentiating (22) with respect to time and using the definition of given in (14), determines the following equation:…”
Section: A Collision Avoidance Controller For a Single Obstaclementioning
confidence: 99%
“…By differentiating (15) with respect to time and using the definition of provided in (14), the following equation is obtained:…”
Section: A Collision Avoidance Controller For a Single Obstaclementioning
confidence: 99%
See 1 more Smart Citation
“…Whether it is a graph-based search method or a local navigation algorithm, they mostly aim at a flat environment. For path planning in a space environment, popular approaches are mainly to integrate obstacles, speeds, and path lengths into constraints and generate trajectories by curve parameterization [25,26]. Most of the numerical methods use path point parameterization to define splines, polynomials, and so on.…”
Section: Introductionmentioning
confidence: 99%