Latency Analysis of Coalescence for Robot Groups
Lists
Only you see this
Abstract
Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communication is a necessary requirement for several collaborative robot tasks. In this paper, we consider a scenario where the robots do not have any information about the environment or positions of other robots and perform a random walk search. We show through probabilistic analysis that as the number of isolated robots N increases, the expected coalescence time decreases as 1/radicN. Simulations results are presented to validate this analysis.
BibTeX
@inproceedings{poduri2007latency,
author = {Sameera Poduri and Gaurav S. Sukhatme},
title = {{Latency Analysis of Coalescence for Robot Groups}},
booktitle = {IEEE International Conference on Robotics and Automation},
year = {2007},
doi = {10.1109/robot.2007.363981},
}Loading related content...