Lossless convexification of nonconvex MINLP on the UAV path‐planning problem

Summary Most unmanned aerial vehicle path‐planning problems have been modeled as linear optimal control problems, ie, as mixed‐integer linear programming problems. However, most constraints cannot be described accurately in linear form in practical engineering applications. In this paper, the tradit...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimal control applications & methods Jg. 39; H. 2; S. 845 - 859
Hauptverfasser:	Zhang, Zhe, Wang, Jun, Li, Jianxun
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Glasgow Wiley Subscription Services, Inc 01.03.2018
Schlagworte:	Algorithms Benders decomposition Computer simulation GBD Integer programming Linear programming lossless convexification MINLP nonconvex programming Nonlinear programming Optimal control UAV path planning Unmanned aerial vehicles
ISSN:	0143-2087, 1099-1514
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!