CARE: Cooperative Autonomy for Resilience and Efficiency of Robot Teams for Complete Coverage of Unknown Environments under Robot Failures

Abstract

This paper addresses the problem of Multi-robot Coverage Path Planning (MCPP) for unknown environments in the presence of robot failures. Unexpected robot failures can seriously degrade the performance of a robot team and in extreme cases jeopardize the overall operation. Therefore, this paper presents a distributed algorithm, called Cooperative Autonomy for Resilience and Efficiency (CARE), which not only provides resilience to the robot team against failures of individual robots, but also improves the overall efficiency of operation via event-driven replanning. The algorithm uses distributed Discrete Event Supervisors (DESs), which trigger games between a set of feasible players in the event of a robot failure or idling, to make collaborative decisions for task reallocations. The game-theoretic structure is built using Potential Games, where the utility of each player is aligned with a shared objective function for all players. The algorithm has been validated in various complex scenarios on a high-fidelity robotic simulator, and the results demonstrate that the team achieves complete coverage under failures, reduced coverage time, and faster target discovery as compared to three alternative methods.

References in corpus (3)

• Efficient Multi-Robot Coverage of a Known Environment
• Multi-robot Dubins Coverage with Autonomous Surface Vehicles
• Fast Damage Recovery in Robotics with the T-Resilience Algorithm

Cited by in corpus (5)

• Multi-Robot Coordination and Planning in Uncertain and Adversarial Environments
• ${\epsilon }^{\ast }$+: An Online Coverage Path Planning Algorithm for Energy-constrained Autonomous Vehicles
• Complete and Near-Optimal Robotic Crack Coverage and Filling in Civil Infrastructure
• T${}^{\star }$-Lite: A Fast Time-Risk Optimal Motion Planning Algorithm for Multi-Speed Autonomous Vehicles
• Generalized Multi-Speed Dubins Motion Model