Home /Research /Provably Safe Multi-Robot Coordination With Unreliable Communication
SWARM

Provably Safe Multi-Robot Coordination With Unreliable Communication

Anna Mannucci, Lucia Pallottino, Federico Pecora

Year
2019
Citations
23

Abstract

Coordination is a core problem in multi-robot systems, since it is a key to ensure safety and efficiency. Both centralized and decentralized solutions have been proposed, however, most assume perfect communication. This letter proposes a centralized method that removes this assumption, and is suitable for fleets of robots driven by generic second-order dynamics. We formally prove that: first, safety is guaranteed if communication errors are limited to delays; and second, the probability of unsafety is bounded by a function of the channel model in networks with packet loss. The approach exploits knowledge of the network's non-idealities to ensure the best possible performance of the fleet. The method is validated via several experiments with simulated robots.

Keywords

Computer scienceRobotBounded functionKey (lock)Network packetDistributed computingExploitCore (optical fiber)Function (biology)Telecommunications network

Related papers

Browse all SWARM papers