The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Distributed memoryless point convergence algorithm for mobile robots with limited visibility
Abstract
We present a distributed algorithm for converging autonomous mobile robots with limited visibility toward a single point. Each robot is an omnidirectional mobile processor that repeatedly: 1) observes the relative positions of those robots that are visible; 2) computes its new position based on the observation using the given algorithm; 3) moves to that position. The robots' visibility is limited so that two robots can see each other if and only if they are within distance V of each other and there are no other robots between them. Our algorithm is memoryless in the sense that the next position of a robot is determined entirely from the positions of the robots that it can see at that moment. The correctness of the algorithm is proved formally under an abstract model of the robot system in which: 1) each robot is represented by a point that does not obstruct the view of other robots; 2) the robots' motion is instantaneous; 3) there are no sensor and control error; 4) the issue of collision is ignored. The results of computer simulation under a more realistic model give convincing indication that the algorithm, if implemented on physical robots, will be robust against sensor and control error.
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
Navigation strategies for multiple autonomous mobile robots moving in formation
Wang, P. K. C. (1991) · Journal of Robotic Systems · doi:10.1002/rob.4620080204 · Cited by 398
Distributed algorithms for formation of geometric patterns with many mobile robots
Sugihara, K., & Suzuki, I. (1996) · Journal of Robotic Systems · doi:10.1002/(sici)1097-4563(199603)13:3<127::aid-rob1>3.0.co;2-u · Cited by 273
Self-citation
Cited by
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Coverage Control for Mobile Sensing Networks
Cortes, J., Martinez, S., Karatas, T., & Bullo, F. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.824698 · Cited by 2,710
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Necessary and sufficient graphical conditions for formation control of unicycles
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841121 · Cited by 1,041
Distributed Coordination Control of Multiagent Systems While Preserving Connectedness
Ji, M., & Egerstedt, M. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.900638 · Cited by 880
Local Control Strategies for Groups of Mobile Autonomous Agents
Lin, Z., Broucke, M., & Francis, B. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.825639 · Cited by 850
Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
Cortes, J., Martinez, S., & Bullo, F. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.878713 · Cited by 695
Motion Coordination with Distributed Information
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.384124 · Cited by 526
State Agreement for Continuous‐Time Coupled Nonlinear Systems
Lin, Z., Francis, B., & Maggiore, M. (2007) · SIAM Journal on Control and Optimization · doi:10.1137/050626405 · Cited by 508
On the Rendezvous Problem for Multiple Nonholonomic Agents
Dimarogonas, D. V., & Kyriakopoulos, K. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895897 · Cited by 491
Consensus in multi-agent systems: a review
Amirkhani, A., & Barshooi, A. H. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10097-x · Cited by 476
Distributed algorithms for reaching consensus on general functions
Cortés, J. (2008) · Automatica · doi:10.1016/j.automatica.2007.07.022 · Cited by 469
Potential-Function Based Control of a Microgrid in Islanded and Grid-Connected Modes
Mehrizi-Sani, A., & Iravani, R. (2010) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2010.2045773 · Cited by 428
The multi-agent rendezvous problem
Lin, J., Morse, A. S., & Anderson, B. D. O. (2004) · 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475) · doi:10.1109/cdc.2003.1272825 · Cited by 408
Graph-theoretic connectivity control of mobile robot networks
Zavlanos, M. M., Egerstedt, M. B., & Pappas, G. J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2157884 · Cited by 405
Gathering of asynchronous robots with limited visibility
Flocchini, P., Prencipe, G., Santoro, N., & Widmayer, P. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.01.001 · Cited by 399
Rendezvous of multiple mobile agents with preserved network connectivity
Su, H., Wang, X., & Chen, G. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.03.006 · Cited by 284
Overview: Collective Control of Multiagent Systems
Knorn, S., Chen, Z., & Middleton, R. H. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2468991 · Cited by 281
Metadata
- Authors
- Ando, H., Oasa, Y., Suzuki, I., & Yamashita, M.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 1999
- Volume
- 15
- Issue
- 5
- Pages
- 818-828
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W2097569568
- Cited by
- 564
- References
- 2
- FWCI
- 3.94
- 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.