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

The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.

Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions

Cortes, J., Martinez, S., Bullo, F.·2006·IEEE Transactions on Automatic Control

Abstract

This paper presents coordination algorithms for networks of mobile autonomous agents. The objective of the proposed algorithms is to achieve rendezvous, that is, agreement over the location of the agents in the network. We provide analysis and design results for multiagent networks in arbitrary dimensions under weak requirements on the switching and failing communication topology. The novel correctness proof relies on proximity graphs and their properties and on a general LaSalle invariance principle for nondeterministic discrete-time dynamical systems

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.1109/tac.2006.878713

Cites

22 of 22 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

Research works printed but not linked: 7

  1. 10.1109/TAC.2003.821416 · doi:10.1109/tac.2003.821416
  2. 10.1002/wcm.107 · doi:10.1002/wcm.107
  3. lynch, 1997, Distributed Algorithms
  4. lin, 2004, The multi-agent rendezvous problem: an extended summary, Proc 2003 Block Island Workshop on Cooperative Control, 309, 257
  5. 10.1137/S009753979628292X · doi:10.1137/s009753979628292x
  6. fagnani, 2004, On multi-vehicle rendezvous under quantized communication, Proc Mathematical Theory of Networks and Systems
  7. 10.1007/3-540-36224-X_10 · doi:10.1007/3-540-36224-x_10

Cited by

See all 695

Metadata

Authors
Cortes, J., Martinez, S., & Bullo, F.
Venue
IEEE Transactions on Automatic Control
Published
2006-08
Volume
51
Issue
8
Pages
1289-1298
ISSN
0018-9286 (ISSN-L)
OpenAlex
W2137642864
Cited by
695
References
22
FWCI
89.73
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.