Easily scalable algorithms for dispersing autonomous robots

This paper describes three new algorithms for dispersing a swarm of bots throughout a search space. We assume that the bots do not have a central coordinating agent and we want to have no (or few) inter-bot communications so that the algorithms can scale to large swarm sizes. We simulated the three...

Full description

Saved in:
Bibliographic Details
Main Authors: Siebold, M., Hereford, J.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Fluid flow
Kinetic theory
Monitoring
Orbital robotics
Physics
Robot kinematics
Surveillance
Testing
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes three new algorithms for dispersing a swarm of bots throughout a search space. We assume that the bots do not have a central coordinating agent and we want to have no (or few) inter-bot communications so that the algorithms can scale to large swarm sizes. We simulated the three new dispersion algorithms plus two other random-walk based dispersion algorithms on five different search spaces. Each of the five algorithms was tested with swarm sizes from three to fifty bots. For swarm sizes larger than ten, we found that the minimize-intensity algorithm, which is based on decaying signal strengths, worked best. For small swarm sizes, the dispersion algorithm based on the dispersion of gas particles performed best.
ISSN:1091-0050
1558-058X
DOI:10.1109/SECON.2008.4494354