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
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.
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
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788
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
Diestel, R. (1997) · Cited by 5,082
Differential equations with discontinuous right hand sides
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90171-7 · Cited by 4,893
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
Computational Geometry: Algorithms and Applications
de Berg, M., Cheong, O., van Kreveld, M. J., & Overmars, M. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,450
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
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
Self-citationStability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61769-8 · Cited by 1,865
Mathematics and its applications
Yau, S. T. (2005) · The 2002 International Conference on Control and Automation, 2002. ICCA. Final Program and Book of Abstracts. · doi:10.1109/icca.2002.1229256 · Cited by 1,488
Computational Geometry: Algorithms and Applications
de Berg, M., van Kreveld, M., Overmars, M., & Schwarzkopf, O. C. (2000) · Springer eBooks · doi:10.1007/978-3-662-04245-8 · Cited by 1,473
Ogren, P., Fiorelli, E., & Leonard, N. E. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.832203 · Cited by 1,234
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
Relative neighborhood graphs and their relatives
Jaromczyk, J. W., & Toussaint, G. T. (1992) · Proceedings of the IEEE · doi:10.1109/5.163414 · Cited by 664
Distributed memoryless point convergence algorithm for mobile robots with limited visibility
Ando, H., Oasa, Y., Suzuki, I., & Yamashita, M. (1999) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.795787 · Cited by 564
Spatially-distributed coverage optimization and control with limited-range interactions
Cortés, J., Martínez, S., & Bullo, F. (2005) · ESAIM: Control, Optimisation and Calculus of Variations · doi:10.1051/cocv:2005024 · Cited by 461
Self-citationThe 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
Equilibria and steering laws for planar formations
Justh, E. W., & Krishnaprasad, P. S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2003.10.004 · Cited by 378
Linear and nonlinear programming
Berck, P., & Sydsæter, K. (1991) · Springer eBooks · doi:10.1007/978-3-662-02678-6_14 · Cited by 155
Mesbahi, M. (2004) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2003.1273092 · Cited by 52
Research works printed but not linked: 7
- 10.1109/TAC.2003.821416 · doi:10.1109/tac.2003.821416
- 10.1002/wcm.107 · doi:10.1002/wcm.107
- lynch, 1997, Distributed Algorithms
- lin, 2004, The multi-agent rendezvous problem: an extended summary, Proc 2003 Block Island Workshop on Cooperative Control, 309, 257
- 10.1137/S009753979628292X · doi:10.1137/s009753979628292x
- fagnani, 2004, On multi-vehicle rendezvous under quantized communication, Proc Mathematical Theory of Networks and Systems
- 10.1007/3-540-36224-X_10 · doi:10.1007/3-540-36224-x_10
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
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
Self-citationCooperative Control of Dynamical Systems
(2009) · Journal of International Crisis and Risk Communication Research · doi:10.1007/978-1-84882-325-9 · Cited by 985
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
Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
Rahmani, A., Ji, M., Mesbahi, M., & Egerstedt, M. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/060674909 · Cited by 767
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.