In this work, we propose an improved artificially weighted spanning tree coverage (IAWSTC) algorithm for distributed coverage path planning of multiple flying robots. The proposed approach is suitable for environment exploration in cluttered regions, where unexpected obstacles can appear. In addition, we present an online re-planner smoothing algorithm with unexpected detected obstacles. To validate our approach, we performed simulations and real robot experiments. The results showed that our proposed approach produces sub-regions with less redundancy than its previous version.


    Access

    Download


    Export, share and cite



    Title :

    An Improved Spanning Tree-Based Algorithm for Coverage of Large Areas Using Multi-UAV Systems


    Contributors:


    Publication date :

    2022




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Radar Data Tracking Using Minimum Spanning Tree-Based Clustering Algorithm

    Park, C. / Lee, H. / Musaffar, B. et al. | British Library Conference Proceedings | 2011


    Radar Data Tracking Using Minimum Spanning Tree-Based Clustering Algorithm

    Park, Chunki / Lee, Hak-tae / Musaffar, Bassam | AIAA | 2011



    Adjacent intersection road coordinate control method based on minimum spanning tree clustering improved genetic algorithm

    YANG XINWU / WANG QIAOHUI / XUE HUIBIN | European Patent Office | 2015

    Free access

    Widening the dynamic range of pictures using a minimum spanning tree algorithm

    Yadid-Pecht, O. | British Library Online Contents | 2000