Fault-Tolerant Rendezvous of Multirobot Systems
Authors:
- 1 March 2017
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 33 (3) , 565-582
Abstract
In this paper, we propose a distributed control policy to achieve rendezvous by a set of robots even when some robots in the system do not follow the prescribed policy. These nonconforming robots correspond to faults in the multirobot system, and our control policy is thus a fault-tolerant policy. Each robot has a limited sensing range and is able to directly estimate the state of only those robots within that sensing range, which induces a network topology for the multirobot system. We assume that it is not possible for the fault-free robots to identify the faulty robots, and thus our approach is robust even to undetected faults in the system. The main contribution of this paper is a fault-tolerant distributed control algorithm that is guaranteed to converge to consensus under certain reasonable connectivity conditions. We first present a general algorithm that exploits the notion of a Tverberg partition of a point set in R d , and give a proof of convergence. We then provide three instantiations of this algorithm, based on three different sensing models. For each case, we analyze performance via extensive simulations. The effectiveness and performance of our algorithms on real platforms are demonstrated through experiments on a multirobot testbed.Keywords
This publication has 57 references indexed in Scilit:
- A control-theoretic approach to disseminating values and overcoming malicious links in wireless networksAutomatica, 2012
- Gathering few fat mobile robots in the planeTheoretical Computer Science, 2009
- Distributed memoryless point convergence algorithm for mobile robots with limited visibilityIEEE Transactions on Robotics and Automation, 1999
- Reaching approximate agreement in the presence of faultsJournal of the ACM, 1986
- Coefficients of ergodicity: structure and applicationsAdvances in Applied Probability, 1979
- A Generalization of Radon's TheoremJournal of the London Mathematical Society, 1966
- Products of Indecomposable, Aperiodic, Stochastic MatricesProceedings of the American Mathematical Society, 1963
- On 3N points in a planeMathematical Proceedings of the Cambridge Philosophical Society, 1959
- Weak ergodicity in non-homogeneous Markov chainsMathematical Proceedings of the Cambridge Philosophical Society, 1958
- The ergodic properties of non-homogeneous finite Markov chainsMathematical Proceedings of the Cambridge Philosophical Society, 1956