We present a decentralized algorithm to achieve segregation into an arbitrary number of groups with swarms of autonomous robots. The distinguishing feature of our approach is in the minimalistic assumptions on which it is based. Specifically, we assume that (i) Each robot is equipped with a ternary sensor capable of detecting the presence of a single nearby robot, and, if that robot is present, whether or not it belongs to the same group as the sensing robot; (ii) The robots move according to a differential drive model; and (iii) The structure of the control system is purely reactive, and it maps directly the sensor readings to the wheel speeds with a simple ‘if’ statement. We present a thorough analysis of the parameter space that enables this behavior to emerge, along with an analysis that explains the emergent behavior. Finally, we study the effect on segregation performance of some nonideal aspects in the robot morphology.
A Minimalistic Approach to Segregation in Robot Swarms
P. Mitrano,Jordan Burklund,M. Giancola,Carlo Pinciroli
Published 2019 in International Symposium on Multi-Robot and Multi-Agent Systems
ABSTRACT
PUBLICATION RECORD
- Publication year
2019
- Venue
International Symposium on Multi-Robot and Multi-Agent Systems
- Publication date
2019-01-29
- Fields of study
Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-24 of 24 references · Page 1 of 1
CITED BY
Showing 1-12 of 12 citing papers · Page 1 of 1