49th IEEE Conference on Decision and Control (CDC) 2010
DOI: 10.1109/cdc.2010.5717246
|View full text |Cite
|
Sign up to set email alerts
|

Optimal path planning for an aerial vehicle in 3D space

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
35
0
1

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 42 publications
(36 citation statements)
references
References 18 publications
0
35
0
1
Order By: Relevance
“…Moreover, look-up tables are usually required, increasing the operational complexity. The second category can provide closed-form solutions, using, for example, B-splines, Bezier curves or spatial Pythagorean hodographs [23,24,25,27,28,29,30]. These curves are used for trajectory generation for both UAVs [23,24] and autonomous robots [25,28].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, look-up tables are usually required, increasing the operational complexity. The second category can provide closed-form solutions, using, for example, B-splines, Bezier curves or spatial Pythagorean hodographs [23,24,25,27,28,29,30]. These curves are used for trajectory generation for both UAVs [23,24] and autonomous robots [25,28].…”
Section: Introductionmentioning
confidence: 99%
“…Generated paths have continuous curvature when using Bezier curves [31] or B-splines [32], but little attention has been given to the maximum curvature constraint. Although it has been demonstrated that curvature extrema can be obtained numerically for any planar cubic curve, this might be a challenge for parametric polynomial curves [29,33], since it is difficult to solve the formulated curvature extremum model. An objective function has been designed to search for proper Bezier curve parameters that satisfy the maximum curvature constraint, but the optimization problem remains unsolved [34].…”
Section: Introductionmentioning
confidence: 99%
“…Sussman [8] discussed Dubins problem in 3D space to find that every minimizer is either a concatenation of three pieces, each of which is a straight line or circle, or a helicoidal arc. Based on Sussmann's result, optimal paths for 3D waypoint following problem are generated in [9], [10] and [11] considering the kinematic model of a MAV. Bottasso et al [12] considered a 3D sequence of waypoints connected by straight flight trim conditions as input, and smoothened it optimally to make it compatible with vehicle dynamics.…”
Section: Introductionmentioning
confidence: 99%
“…This algorithm has been implemented on the UAV, and is only applicable when the distance between the initial and final positions onto the x-y plane is large. Hota and Ghose [26] employed a numerical method to obtain an optimal path meeting geometric constraints. However, this method could not be applied in dynamic trajectory smoothing because of time-consuming computation.…”
Section: Introductionmentioning
confidence: 99%