We provide a theoretical framework for controlling graph connectivity in mobile robot
networks. We discuss proximity-based communication models composed of disk-based or …

We consider a system composed of autonomous mobile robots that communicate by
exchanging messages in a wireless ad-hoc network. In this setting, the failure of a single …

Designing robust algorithms for mobile agents with reliable communication is difficult due to
the distributed nature of computation, in mobile ad hoc networks (MANETs) the matter is …

This paper studies connectivity maintenance in robotic networks. We propose a distributed
coordination algorithm that can be combined with the individual motion control strategies of …

We consider the connectivity of autonomous mobile robots. The robots navigate using
simple local steering rules without requiring explicit communication among themselves. We …

We study maintenance of network connectivity in robotic swarms with discrete-time
communications and continuous-time motion capabilities. Assuming a network topology …

Dynamic networks have recently emerged as an efficient way to model various forms of
interaction within teams of mobile agents, such as sensing and communication. This article …

Local distributed algorithms can only gather sufficient information to identify local graph
traits, that is, properties that hold within the local neighborhood of each node. However, it is …

The field of swarm robotics focuses on controlling large populations of simple robots to
accomplish tasks more effectively than what is possible using a single robot. This thesis …

This article discusses the connectivity of autonomous mobile robots that do not have
communication capabilities. We show that if the group members follow the proposed Local …