Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 158

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 1: The Synchronous Case

Lin, J., Morse, A. S., Anderson, B. D. O.·2007·SIAM Journal on Control and Optimization

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 solution to this problem consisting of individual agent strategies which are mutually synchronized in the sense that all depend on a common clock.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/040620552

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

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
2096-2119
ISSN
  • 0363-0129 (ISSN-L)
  • 1095-7138
OpenAlex
W4241000863
Cited by
158
References
1
FWCI
17.23
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 1: The Synchronous Case. https://app.cochat.ai/papers/10.1137/040620552
The paper
Lin, J., Morse, A. S., & Anderson, B. D. O. (2007). The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case. SIAM Journal on Control and Optimization. https://doi.org/10.1137/040620552

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.