The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
Abstract
This paper is concerned with the collective behavior of a group of $n>1$ mobile autonomous agents, labelled 1 through n, which can all move in the plane. Each agent is able to continuously track the positions of all other agents currently within its “sensing region,” where by an agent's sensing region we mean a closed disk of positive radius r centered at the agent's current position. The multi-agent rendezvous problem is to devise “local” control strategies, one for each agent, which without any active communication between agents cause all members of the group to eventually rendezvous at a single unspecified location. This paper describes a family of unsynchronized strategies for solving the problem. Correctness is established appealing to the concept of “analytic synchronization.”
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Self-citation
Cited by
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
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
Distributed event-triggered control of multi-agent systems with combinational measurements
Fan, Y., Feng, G., Wang, Y., & Song, C. (2013) · Automatica · doi:10.1016/j.automatica.2012.11.010 · Cited by 799
Distributed algorithms for reaching consensus on general functions
Cortés, J. (2008) · Automatica · doi:10.1016/j.automatica.2007.07.022 · Cited by 469
Cao, M., Morse, A. S., & Anderson, B. D. O. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/060657029 · Cited by 329
Self-citation
Metadata
- Authors
- Lin, J., Morse, A. S., & Anderson, B. D. O.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 2007-01
- Volume
- 46
- Issue
- 6
- Pages
- 2120-2147
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W1994237189
- Cited by
- 215
- References
- 1
- FWCI
- 29.67
- 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: The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case. https://app.cochat.ai/papers/10.1137/040620564
- The paper
- Lin, J., Morse, A. S., & Anderson, B. D. O. (2007). The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case. SIAM Journal on Control and Optimization. https://doi.org/10.1137/040620564
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.