Clustering objects with robots that do not compute
The DOI matches its OpenAlex record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
This paper has presented the simplest solution so far to the problem of clustering objects with a swarm of robots. The robots are memory-less and are unable to perform arithmetic computations. They are only able to detect the presence of an object or another robot in their line of sight. As they do not possess any distance information about a perceived object (nor any force sensors), they are unable to tell whether they are manipulating it. Despite these limitations, we identified a controller that is capable of consistently gathering the objects into a single cluster. Simulation results have shown that the ability of the robots to distinguish between objects and other robots is beneficial; indeed, if the robots can only perceive other robots as objects, the behavior does not scale well with increasing numbers of robots. Simulations have also shown that the controller is fairly robust with respect to sensory noise. The sensor/controller solution was implemented on a physical system of 5 e-puck robots, and favourable results have been obtained in systematic experiments with 20 objects, with 86.5% of the objects being gathered into one cluster after 10 minutes (average across 10 trials). In the future, we intend to implement a solution of the object clustering task with robots at the sub-millimeter scale.
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
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Nanomedicine: current status and future prospects
Moghimi, S. M., Hunter, A. C., & Murray, J. C. (2005) · The FASEB Journal · doi:10.1096/fj.04-2747rev · Cited by 2,029
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
The Ethics of Artificial Intelligence: Principles, Challenges, and Opportunities
Floridi, L. (2023) · doi:10.1093/oso/9780198883098.001.0001 · Cited by 507
A review of swarm robotics tasks
Bayındır, L. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.05.116 · Cited by 445
Implicit 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-citationArtificial Intelligence Crime: An Interdisciplinary Analysis of Foreseeable Threats and Solutions
King, T. C., Aggarwal, N., Taddeo, M., & Floridi, L. (2020) · Science and Engineering Ethics · doi:10.1007/s11948-018-00081-0 · Cited by 271
Automatic 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
Metadata
- Authors
- Gauci, M., Chen, J., Li, W., Dodd, T. J., & Groß, R.
- Venue
- Adaptive Agents and Multi-Agents Systems
- Published
- 2014-05-05
- Pages
- 421-428
- ISSN
- 1548-8403 (ISSN-L)
- DOI
- 10.5555/2615731.2615800
- OpenAlex
- W2182646039
- Cited by
- 68
- References
- 3
- FWCI
- 5.84
- 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
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.