We present an approach for protected contingency online planning in high-risk environments with strict regulatory boundary conditions. For this purpose, we integrate a deterministic online planning method into a UAM path planning framework, which operates within precomputed convex regions of obstacle-free space. As part of an offline planning phase, a database of trajectories and convex, obstacle-free regions along these trajectories are computed. During the online phase, transitions between any two preplanned trajectories inside the same region can be computed using a planning method with performance-guaranteed maneuvres. Within a given envelope of environmental disturbances, our method guarantees to contain the flight path inside its convex region, while ensuring deterministic attributes. We demonstrate the method in a scenario representing the intended application and give estimations for offline computation time on desktop-grade hardware.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Protected Online Path Planning for UAVs over Congested Areas Within Convex Regions of Obstacle-Free Space


    Contributors:


    Publication date :

    2021-10-03


    Size :

    3129409 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Practical Obstacle Avoidance Path Planning for Agriculture UAVs

    Wang, Kaipeng / Meng, Zhijun / Wang, Lifeng et al. | British Library Conference Proceedings | 2019



    Coverage Path Planning for UAVs: An Energy-Efficient Method in Convex and Non-Convex Mixed Regions

    Li Wang / Xiaodong Zhuang / Wentao Zhang et al. | DOAJ | 2024

    Free access

    Path-planning and obstacle avoidance algorithms for UAVs: a systematic literature review

    Almazrouei, Khawla Saif / Bou Nassif, Ali / AlShabi, Mohammad | SPIE | 2023