Resilient Multi-Robot Coverage Path Redistribution Using Boustrophedon Decomposition for Environmental Monitoring

This study introduces a resilient and adaptive multi-robot coverage path planning approach based on the Boustrophedon Cell Decomposition algorithm, designed to dynamically redistribute coverage tasks in the event of robot failures. The proposed method ensures minimal disruption and maintains a balanced workload across operational robots through a propagation-based redistribution strategy. By iteratively reallocating the failed robot's coverage path to neighboring robots, the method prevents any single robot from becoming overburdened, ensuring efficient task distribution and continuous environmental monitoring. Simulations conducted in five distinct environments, ranging from simple open areas to complex, obstacle-rich terrains, demonstrate the method's robustness and adaptability. A key strength of the proposed approach is its fast and efficient task reallocation process, achieved with minimal propagation cycles, making it suitable for real-time applications even in complex scenarios. The approach reduces task variance and maintains balanced coverage throughout the mission.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2024-11-23
DOI
https://doi.org/10.3390/s24237482
Citations
9
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
2.24
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Resilient Multi-Robot Coverage Path Redistribution Using Boustrophedon Decomposition for Environmental Monitoring

Jung-Hwan Gong, Seung‐Hwan Lee, H.W. Kim
9 citations
Sensors
Robotic Path Planning Algorithms
2.24
article

Resilient Multi-Robot Coverage Path Redistribution Using Boustrophedon Decomposition for Environmental Monitoring

Jung-Hwan Gong, Seung‐Hwan Lee, H.W. Kim
article en
9 citations

Abstract

This study introduces a resilient and adaptive multi-robot coverage path planning approach based on the Boustrophedon Cell Decomposition algorithm, designed to dynamically redistribute coverage tasks in the event of robot failures. The proposed method ensures minimal disruption and maintains a balanced workload across operational robots through a propagation-based redistribution strategy. By iteratively reallocating the failed robot's coverage path to neighboring robots, the method prevents any single robot from becoming overburdened, ensuring efficient task distribution and continuous environmental monitoring. Simulations conducted in five distinct environments, ranging from simple open areas to complex, obstacle-rich terrains, demonstrate the method's robustness and adaptability. A key strength of the proposed approach is its fast and efficient task reallocation process, achieved with minimal propagation cycles, making it suitable for real-time applications even in complex scenarios. The approach reduces task variance and maintains balanced coverage throughout the mission.

SensorsVol. 24(23)
Kumoh National Institute of Technology (KR)
Openalex Percentile: Top 10%
Robotic Path Planning Algorithms
2.24
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.