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.; Notaro, I.; Mattei, M.. - (2018), pp. 708-714. (Intervento presentato al convegno 2018 International Conference on Unmanned Aircraft Systems, ICUAS 2018 tenutosi a Dallas Marriott City Center, 650 N. Pearl Str., usa nel 2018) [10.1109/ICUAS.2018.8453355].
Optimal Flight Paths over Essential Visibility Graphs
Mattei M.
2018
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
