Home /Research /Resilient Multi-Robot Coverage Path Redistribution Using Boustrophedon Decomposition for Environmental Monitoring
SWARM

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

Jung-Hwan Gong, Seung‐Hwan Lee

Year
2024
Citations
10
Access
Open access

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.

Keywords

RobotWorkloadRobustness (evolution)Computer scienceAdaptabilityMotion planningObstacleReal-time computingObstacle avoidanceTerrain

Related papers

Browse all SWARM papers