Achieving Connectivity through Coalescence in Mobile Robot Networks

Abstract

Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time for a worst-case scenario where the robots do not have any knowledge about the environment or positions of other robots and