The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Distributed covering by ant-robots using evaporating traces
Abstract
We investigate the ability of a group of robots, that communicate by leaving traces, to perform the task of cleaning the floor of an un-mapped building, or any task that requires the traversal of an unknown region. More specifically, we consider robots which leave chemical odour traces that evaporate with time, and are able to evaluate the strength of smell at every point they reach, with some measurement error. Our abstract model is a decentralized multi-agent adaptive system with a shared memory, moving on a graph whose vertices are the floor-tiles. We describe three methods of covering a graph in a distributed fashion, using smell traces that gradually vanish with time, and show that they all result in eventual task completion, two of them in a time polynomial in the number of tiles. Our algorithms can complete the traversal of the graph even if some of the agents die or the graph changes during the execution, as long as the graph stays connected. Another advantage of our agent interaction processes is the ability of agents to use noisy information at the cost of longer cover time.
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
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Advanced Mathematical Methods for Scientists and Engineers I
Bender, C. M., & Orszag, S. A. (1999) · doi:10.1007/978-1-4757-3069-2 · Cited by 4,906
Self-stabilizing systems in spite of distributed control
Dijkstra, E. W. (1974) · Communications of the ACM · doi:10.1145/361179.361202 · Cited by 2,097
Even, S. (1979) · Cited by 1,280
Algorithm 447: efficient algorithms for graph manipulation
Hopcroft, J., & Tarjan, R. (1973) · Communications of the ACM · doi:10.1145/362248.362272 · Cited by 985
Differential Equations--Geometric Theory
Pollard, H., & Lefschetz, S. (1964) · Mathematics of Computation · doi:10.2307/2003326 · Cited by 746
A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations
Kuipers, B., & Byun, Y.-T. (1991) · Robotics and Autonomous Systems · doi:10.1016/0921-8890(91)90014-c · Cited by 707
Random walks, universal traversal sequences, and the complexity of maze problems
Aleliunas, R., Karp, R. M., Lipton, R. J., Lovasz, L., & Rackoff, C. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.34 · Cited by 692
Bollobás, B. (1979) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-9967-7 · Cited by 610
Navigating Mobile Robots: Systems and Techniques
Borenstein, J., Everett, H. R., & Feng, L. (1996) · Medical Entomology and Zoology · Cited by 588
Itai, A., Papadimitriou, C. H., & Szwarcfiter, J. L. (1982) · SIAM Journal on Computing · doi:10.1137/0211056 · Cited by 515
Communication in reactive multiagent robotic systems
Balch, T., & Arkin, R. C. (1994) · Autonomous Robots · doi:10.1007/bf00735341 · Cited by 512
Biased random walk models for chemotaxis and related diffusion approximations
Alt, W. (1980) · Journal of Mathematical Biology · doi:10.1007/bf00275919 · Cited by 471
On social laws for artificial agent societies: off-line design
Shoham, Y., & Tennenholtz, M. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00007-n · Cited by 463
A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations
Kuipers, B. J., & Byun, Y.-T. (1993) · Cited by 327
Learning to coordinate without sharing information
Sen, S., Sekaran, M., & Hale, J. C. (1994) · Cited by 314
Robotic exploration as graph construction
Dudek, G., Jenkin, M., Milios, E., & Wilkes, D. (1991) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.105395 · Cited by 281
Artificial Life and Real Robots
Brooks, R. A. (1992) · Cited by 269
Efficient algorithms for graph manipulation
Hopcroft, J. E., & Tarjan, R. E. (1971) · Cited by 231
On the power of the compass (or, why mazes are easier to search than graphs)
Blum, M., & Kozen, D. C. (1978) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1978.30 · Cited by 213
Territorial multi-robot task division
Schneider-Fontan, M., & Mataric, M. J. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.720357 · Cited by 203
Cooperative Solution of Constraint Satisfaction Problems
Clearwater, S. H., Huberman, B. A., & Hogg, T. (1991) · Science · doi:10.1126/science.254.5035.1181 · Cited by 154
Theoretical problems for the realization of distributed robotic systems
Beni, G., & Wang, J. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1991.131906 · Cited by 132
Cooperative Cleaners: A Study in Ant Robotics
Wagner, I. A., Altshuler, Y., Yanovsky, V. M., & Bruckstein, A. M. (2007) · The International Journal of Robotics Research · doi:10.1177/0278364907085789 · Cited by 131
Self-citationDeneubourg, J., Aron, S., Goss, S., Pasteéls, J. M., & Duerinck, G. (1986) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(86)90239-3 · Cited by 125
On the design of behavior-based multi-robot teams
Parker, L. E. (1995) · Advanced Robotics · doi:10.1163/156855396x00228 · Cited by 123
Pattern formation and functionality in swarm models
Rauch, E., Millonas, M. M., & Chialvo, D. R. (1995) · Physics Letters A · doi:10.1016/0375-9601(95)00624-c · Cited by 120
Clearwater, S. H., Hogg, T., & Huberman, B. A. (1992) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812812438_0003 · Cited by 110
Laying and sensing odor markings as a strategy for assisting mobile robot navigation tasks
Russell, R. A. (1995) · IEEE Robotics & Automation Magazine · doi:10.1109/100.414920 · Cited by 68
Heat trails as short-lived navigational markers for mobile robots
Russell, R. A. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1997.606882 · Cited by 63
Competitive robot mapping with homogeneous markers
Deng, X., & Mirzaian, A. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508436 · Cited by 55
Trading Space for Time in Undirected s - t Connectivity
Broder, A., Karlin, A. R., Raghavan, P., & Upfal, E. (1994) · SIAM Journal on Computing · doi:10.1137/s0097539790190144 · Cited by 35
Cited by
A survey on coverage path planning for robotics
Galceran, E., & Carreras, M. (2013) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2013.09.004 · Cited by 1,575
Coverage for robotics – A survey of recent results
Choset, H. (2001) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1016639210559 · Cited by 1,209
A review of swarm robotics tasks
Bayındır, L. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.05.116 · Cited by 445
Evolution of Collective Behaviors for a Real Swarm of Aquatic Surface Robots
Duarte, M., Costa, V., Gomes, J., Rodrigues, T., Silva, F., Oliveira, S. M., & Christensen, A. L. (2016) · PLOS ONE · doi:10.1371/journal.pone.0151834 · Cited by 134
Metadata
- Authors
- Wagner, I. A., Lindenbaum, M., & Bruckstein, A. M.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 1999
- Volume
- 15
- Issue
- 5
- Pages
- 918-933
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W2142473881
- Cited by
- 275
- References
- 32
- FWCI
- 18.89
- 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.