Self-organized aggregation without computation
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
This paper presents a solution to the problem of self-organized aggregation of embodied robots that requires no arithmetic computation. The robots have no memory and are equipped with one binary sensor, which informs them whether or not there is another robot in their line of sight. It is proven that the sensor needs to have a sufficiently long range; otherwise aggregation cannot be guaranteed, irrespective of the controller used. The optimal controller is found by performing a grid search over the space of all possible controllers. With this controller, robots rotate on the spot when they perceive another robot, and move backwards along a circular trajectory otherwise. This controller is proven to always aggregate two simultaneously moving robots in finite time, an upper bound for which is provided. Simulations show that the controller also aggregates at least 1000 robots into a single cluster consistently. Moreover, in 30 experiments with 40 physical e-puck robots, 98.6% of the robots aggregated into one cluster. The results obtained have profound implications for the implementation of multi-robot systems at scales where conventional approaches to sensing and information processing are no longer applicable.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Intelligence without representation
Brooks, R. A. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90053-m · Cited by 4,853
Self-Organization in Biological Systems
Sneyd, J., Theraula, G., Bonabeau, E., Deneubourg, J.-L., & Franks, N. R. (2001) · doi:10.1515/9780691212920 · Cited by 2,949
Cyberbotics Ltd. Webots ™ : Professional Mobile Robot Simulation
Michel, O. (2004) · International Journal of Advanced Robotic Systems · doi:10.5772/5618 · Cited by 1,261
Cited by
A review of swarm robotics tasks
Bayındır, L. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.05.116 · Cited by 445
Swarm Robotics: Past, Present, and Future [Point of View]
Dorigo, M., Theraulaz, G., & Trianni, V. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3072740 · Cited by 431
“Overall, research should focus on control methods that exploit few unreliable sensors, minimal or completely absent computational abilities, and unreliable actions [51], [52].”
BackgroundImplicit coordination for 3D underwater collective behaviors in a fish-inspired robot swarm
Berlinger, F., Gauci, M., & Nagpal, R. (2021) · Science Robotics · doi:10.1126/scirobotics.abd8668 · Cited by 338
Self-citationAutomatic Design of Robot Swarms: Achievements and Challenges
Francesca, G., & Birattari, M. (2016) · Frontiers in Robotics and AI · doi:10.3389/frobt.2016.00029 · Cited by 144
“Gauci et al. (2014a) obtained an object clustering behavior by using evolutionary strategy to optimize a simple control architecture that features six parameters.”
MethodAutoMoDe-Chocolate: automatic design of control software for robot swarms
Francesca, G., Brambilla, M., Brutschy, A., Garattoni, L., Miletitch, R., Podevijn, G., Reina, A., Soleymani, T., Salvaro, M., Pinciroli, C., et al. (2015) · Swarm Intelligence · doi:10.1007/s11721-015-0107-9 · Cited by 99
Metadata
- Authors
- Gauci, M., Chen, J., Li, W., Dodd, T. J., & Groß, R.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2014-04-16
- Volume
- 33
- Issue
- 8
- Pages
- 1145-1161
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2062223562
- Cited by
- 146
- References
- 3
- FWCI
- 12.47
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Self-organized aggregation without computation. https://app.cochat.ai/papers/10.1177/0278364914525244
- The paper
- Gauci, M., Chen, J., Li, W., Dodd, T. J., & Groß, R. (2014). Self-organized aggregation without computation. The International Journal of Robotics Research. https://doi.org/10.1177/0278364914525244
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.