En-Route Optimal Flight Planning Constrained to Pass Through Waypoints using MINLP

Soler, Manuel; Olivares, Alberto; Bonami, Pierre; Staffetti, Ernesto

Publication:
En-Route Optimal Flight Planning Constrained to Pass Through Waypoints using MINLP

dc.affiliation.dpto	UC3M. Departamento de Ingeniería Aeroespacial	es
dc.affiliation.grupoinv	UC3M. Grupo de Investigación: Ingeniería Aeroespacial	es
dc.contributor.author	Soler, Manuel
dc.contributor.author	Olivares, Alberto
dc.contributor.author	Bonami, Pierre
dc.contributor.author	Staffetti, Ernesto
dc.date.accessioned	2015-09-18T12:49:51Z
dc.date.available	2015-09-18T12:49:51Z
dc.date.issued	2011-06-14	es
dc.description.abstract	Abstract: In this paper we study the en-route strategic flight planning of a commercial aircraft constrained to pass through a set of waypoints whose sequence is not predefined. This problem has been solved as an hybrid optimal control problem in which, given the dynamic model of the aircraft, the initial and final states, the path constraints constituting the envelope of flight, and a set of waypoints in the European air space, one has to find the control inputs, the switching times, the optimal sequence of waypoints and the corresponding trajectory of the aircraft that minimize the direct operating cost during the flight. The complete layout of waypoints in the European airspace is reduced and waypoints are gathered into a small number of clusters. The aircraft is constrained to pass through one waypoint inside every cluster of waypoints. The presence of multi point constraints makes the optimal control problem particularly difficult to solve. The hybrid optimal control problem is converted into a mixed integer non linear programming problem first making the unknown switching times part of the state, then introducing binary variable to enforce the constraint of passing through one waypoint inside every cluster, and finally applying a direct collocation method. The resulting mixed integer non linear programming problem has been solved using a branch and bound algorithm. The cases studied and the numerical results show the effectiveness, efficiency and applicability of this method for enroute strategic flight plans definition.	es
dc.format.mimetype	application/pdf
dc.identifier.bibliographicCitation	Soler Arnedo, Manuel Fernando; Olivares, Alberto; Bonami, Pierre; Staffetti, Ernesto (2011). En-Route Optimal Flight Planning Constrained to Pass Through Waypoints using MINLP. 9th USA/Europe Air Traffic Management Research and Development Seminar (ATM2011). 14th - 17th June, Berlín (Germany).	es
dc.identifier.uri	https://hdl.handle.net/10016/21594
dc.identifier.uxxi	CC/0000020600
dc.language.iso	eng	es
dc.relation.eventdate	2011-06-14	es
dc.relation.eventplace	Berlin (Germany)	es
dc.relation.eventtitle	9th USA/Europe Air Traffic Management Research and Development Seminar	es
dc.rights	© The authors	es
dc.rights	Atribución-NoComercial-SinDerivadas 3.0 España	*
dc.rights.accessRights	open access	es
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/es/	*
dc.subject.eciencia	Aeronáutica	es
dc.subject.other	Air Traffic Management	es
dc.subject.other	4D Trajectory Planning	es
dc.subject.other	Hybrid Optimal Control	es
dc.subject.other	MINLP	es
dc.title	En-Route Optimal Flight Planning Constrained to Pass Through Waypoints using MINLP	es
dc.type	conference proceedings	*
dc.type.hasVersion	AM	*
dspace.entity.type	Publication