This paper deals with the problem of generating optimal 2D flight paths compliant with mission constraints resulting from no-fly zones and/or obstacles, and from flight mechanics limitations as minimum coordinate turn radius and maximum climb and descent angles. The optimization problem is converted into a minimum cost path search within a so called Essential Visibility Graph whose arcs and corresponding weights are obtained via an efficient branching algorithm in view of possible real-time implementations. A possible extension to 3D paths is also presented. Finally, numerical examples are reported with a discussion on the computational aspects.

Optimal Flight Paths over Essential Visibility Graphs

D'Amato E.
;
2018-01-01

Abstract

This paper deals with the problem of generating optimal 2D flight paths compliant with mission constraints resulting from no-fly zones and/or obstacles, and from flight mechanics limitations as minimum coordinate turn radius and maximum climb and descent angles. The optimization problem is converted into a minimum cost path search within a so called Essential Visibility Graph whose arcs and corresponding weights are obtained via an efficient branching algorithm in view of possible real-time implementations. A possible extension to 3D paths is also presented. Finally, numerical examples are reported with a discussion on the computational aspects.
2018
978-1-5386-1354-2
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11367/79020
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 5
social impact