Fault-tolerant control policies for multi-robot systems

multi-robot systems;path-planning;fault-tolerant;swarm robotics;control of multi-robot systems;mobile sensor networks

Park, Hyongju

关键词: multi-robot systems;    path-planning;    fault-tolerant;    swarm robotics;    control of multi-robot systems;    mobile sensor networks;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/92765/PARK-DISSERTATION-2016.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

Throughout the past decade, we have witnessed an active interest in distributed motion coordination algorithms for networked mobile autonomous robots. Often, in multi-robot systems, each robot executing a coordination task is a little cost, a disposable autonomous agent that has ad-hoc sensing or communication capability, and limited mobility. Coordination tasks that a group of multiple mobile robots might perform include formation control, rendezvous, distributed estimation, deployment, flocking, etc. Also, there are challenging tasks that are more suitable for a group of mobile robots than an individual robot, such as surveillance, exploration, or hazardous environmental monitoring. The field has been collectively investigated by many researchers in robotics, control, artificial intelligence, and distributed computing. However, relatively little work has been done on developing algorithms to provide resilience to failures that can occur. The problem is extremely difficult to handle in that any partial failure of a robot is not readily detectable. Some failures in robot resources can have an adverse effect on not only the performance of the robot itself, but also other robots, and the collective task performance as well.This study presents the development of fault-tolerant distributed control policies for multi-robot systems. We consider two problems: rendezvous and coverage. For the former, the goal is to bring all robots to a common location, while for the latter the goal is to deploy robots to achieve optimal coverage of an environment. We consider the case in which each robot is an autonomous decision maker that is anonymous (i.e., robots are indistinguishable to one another), memoryless (i.e., each robot makes decisions based upon only its current information), and dimensionless (i.e., collision checking is not considered). Each robot has a limited sensing range and can directly estimate the state of only those robots within that sensing range, which induces a network topology for the multi-robot system. We assume that it is not possible for the fault-free robots to identify the faulty robots (e.g., due to the anonymous property of the robots). For each problem, we provide an efficient computational framework and analysis of algorithms, all of which converge in the face of faulty robots under a few assumptions on the network topology and sensing abilities. A suite of experiments and simulations confirm our theoretical analysis and demonstrate that our proposed algorithms are useful in fault-prone multi-robot systems.