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.
An Improved Spanning Tree-Based Algorithm for Coverage of Large Areas Using Multi-UAV Systems
2022
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
Radar Data Tracking Using Minimum Spanning Tree-Based Clustering Algorithm
British Library Conference Proceedings | 2011
|Spanning tree-based genetic algorithm for bicriteria transportation problem
Tema Archiv | 1998
|Europäisches Patentamt | 2015
|Widening the dynamic range of pictures using a minimum spanning tree algorithm
British Library Online Contents | 2000
|