Optimal Trajectory-Planning of UAVs via B-Splines and Disjunctive Programming
Not on the map. Why?
Abstract (arXiv)
This paper investigates an efficient algorithm for trajectory planning problem of autonomous unmanned aerial vehicles which fly over three-dimensional terrains. The proposed algorithm combines convex optimization with disjunctive programming and receding horizon concept, which has many advantages, such as a high computational speed. Disjunctive programming is applied in order to relax the non-convex constraints of the problem. Moreover, the B-spline curves are employed to represent the trajectories which should be generated in the optimization process.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 9 Jul 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.