pith. sign in

arxiv: 1807.02931 · v1 · pith:PB6UMIBTnew · submitted 2018-07-09 · 🧮 math.OC

Optimal Trajectory-Planning of UAVs via B-Splines and Disjunctive Programming

classification 🧮 math.OC
keywords disjunctiveprogrammingalgorithmoptimizationproblemadvantagesaerialapplied
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.