Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
