The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Agreement with non-uniform information delays
Abstract
We propose a novel agreement framework for multiple (possibly heterogeneous) agents evolving on a directed information graph with non-uniform delays. Our proposed framework can ensure agreement of a certain scalar quantity among the agents, as long as 1) for each agent, we can design a local control s.t. its closed-loop transfer function has unit gain at dc and gain strictly less than unity elsewhere; 2) the information graph has a globally reachable node (i.e. there exists a path from it to every other nodes); and 3) the information delays are finite constants. Rendezvous simulation is performed to verify the theory.
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
Cited by
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
Finite-Time Consensus Problems for Networks of Dynamic Agents
Wang, L., & Xiao, F. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041610 · Cited by 1,170
Xiao, F., & Wang, L. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.929381 · Cited by 734
Distributed coordination architecture for multi-robot formation control
Ren, W., & Sorensen, N. (2008) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2007.08.005 · Cited by 617
Average consensus problems in networks of agents with delayed communications
Bliman, P.-A., & Ferrari-Trecate, G. (2008) · Automatica · doi:10.1016/j.automatica.2007.12.010 · Cited by 429
Metadata
- Authors
- Lee, D., & Spong, M. W.
- Venue
- 2006 American Control Conference
- Publisher
- IEEE
- Published
- 2006
- Pages
- 6 pp.
- ISSN
- 0743-1619 (ISSN-L)
- OpenAlex
- W2137841457
- Cited by
- 160
- References
- 2
- FWCI
- 10.72
- Type
- conference paper
- 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.