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

The DOI matches its Crossref record; 2 of the 2 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
DOI 10.1109/tac.2006.878713
Open this paper in CoChat — free account

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

2 of 2 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 2 references

Research works printed but not linked: 21

  1. 10.1109/TAC.2003.821416 · doi:10.1109/tac.2003.821416
  2. 10.1109/TAC.2004.832203 · DOI · Paper page
  3. 10.1109/TRA.2004.824698 · DOI · Paper page
  4. 10.1051/cocv:2005024 · DOI · Paper page
  5. 10.1109/TAC.2004.841888 · DOI · Paper page
  6. 10.1109/CDC.2003.1273092 · DOI
  7. 10.1109/5.163414 · DOI · Paper page
  8. 10.1002/wcm.107 · doi:10.1002/wcm.107
  9. lynch, 1997, Distributed Algorithms
  10. 10.1109/TAC.2004.825639 · DOI · Paper page
  11. lin, 2004, The multi-agent rendezvous problem: an extended summary, Proc 2003 Block Island Workshop on Cooperative Control, 309, 257
  12. 10.1137/S009753979628292X · doi:10.1137/s009753979628292x
  13. fagnani, 2004, On multi-vehicle rendezvous under quantized communication, Proc Mathematical Theory of Networks and Systems
  14. 10.1016/j.sysconle.2003.10.004 · DOI · Paper page
  15. 10.1109/CDC.2003.1272825 · DOI · Paper page
  16. 10.1109/70.795787 · DOI · Paper page
  17. 10.1007/3-540-36224-X_10 · doi:10.1007/3-540-36224-x_10
  18. de berg, 2000, Computational Geometry Algorithms and Applications, 10.1007/978-3-662-04245-8 · DOI · Paper page
  19. luenberger, 1984, Linear and Nonlinear Programming
  20. diestel, 2000, Graph Theory, 173
  21. filippov, 1988, Differential Equations with Discontinuous Righthand Sides, 18, 10.1007/978-94-015-7793-9 · DOI · Paper page

Cited by

See all 695

Metadata

Authors
Cortes, J., Martinez, S., & Bullo, F.
Venue
IEEE Transactions on Automatic Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published
2006-08
Volume
51
Issue
8
Pages
1289-1298
ISSN
0018-9286 (ISSN-L)
DOI
10.1109/tac.2006.878713
OpenAlex
W2137642864
Cited by
695
References
2
FWCI
89.73
Type
journal article
Language
en
Open access
closed
Licence
ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html (vor)

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: Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions. https://app.cochat.ai/papers/10.1109/tac.2006.878713
The paper
Cortes, J., Martinez, S., & Bullo, F. (2006). Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2006.878713

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.