When generating 3D maps with unmanned aerial vehicles (UAVs), it is important for the mapping algorithm to have good coverage of the environment. It is also important, especially when planning paths for multiple agents, to have loop closures along each flight path and with other agents. Because multirotor UAVs are limited in flight time, the flight paths must be limited in length. Generating a good flight path to map a new environment can be difficult and tedious because of the free-form nature of a flight path. To solve this problem, we propose using a genetic algorithm designed to maximize total area coverage while minimizing flight time and enforcing sufficient loop closures. The natural ability of genetic algorithms to rapidly explore a design space is advantageous when solving complex free-form problems like path planning.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal Multi-Agent Coverage and Flight Time with Genetic Path Planning




    Publication date :

    2020-09-01


    Size :

    1688985 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Deep Reinforcement Learning for Image-Based Multi-Agent Coverage Path Planning

    Xu, Meng / She, Yechao / Jin, Yang et al. | IEEE | 2023


    Exploration of Multi-Agent Reinforcement Learning for ISR Flight Path Planning

    Xie, Lynphone Mark / Conway, Emily / Cheng, Huaining et al. | IEEE | 2024


    Path Planning for Optimal Coverage of Areas with Nonuniform Importance

    Snyder, Gregory A. / Shriwastav, Sachin / Morrison, Dylan et al. | TIBKAT | 2022


    Path Planning for Optimal Coverage of Areas with Nonuniform Importance

    Snyder, Gregory A. / Shriwastav, Sachin / Morrison, Dylan et al. | AIAA | 2022