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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal Flight Paths over Essential Visibility Graphs


    Contributors:


    Publication date :

    2018-06-01


    Size :

    1795411 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Time-optimal flight paths

    Berry, R.L. | Engineering Index Backfile | 1968



    Optimal Flight Paths for Soaring Flight

    Darryl E. Metzger / J. Karl Hedrick | AIAA | 1975


    Gradient theory of optimal flight paths

    Kelley, H.J. | Engineering Index Backfile | 1960


    Optimal flight paths through microburst wind profiles

    STENGEL, R. F. / PSIAKI, M. L. | AIAA | 1986