Multi-robot coordination with periodic connectivity

13 years 3 months ago

Download www.ri.cmu.edu

Abstract— We consider the problem of multi-robot coordination subject to constraints on the conﬁguration. Speciﬁcally, we examine the case in which a mobile network of robots must search, survey, or cover an environment while remaining connected. While many algorithms utilize continual connectivity for such tasks, we relax this requirement and introduce the idea of periodic connectivity, where the network must regain connectivity at a ﬁxed interval. We show that, in some cases, this problem reduces to the well-studied NP-hard multi-robot informative path planning (MIPP) problem, and we propose an online algorithm that scales linearly in the number of robots and allows for arbitrary periodic connectivity constraints. We prove theoretical performance guarantees and validate our approach in the coordinated search domain in simulation and in real-world experiments. Our proposed algorithm signiﬁcantly outperforms a gradient method that requires continual connectivity and performs ...

Geoffrey Hollinger, Sanjiv Singh

Real-time Traffic