The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
Abstract
In this work, we consider the controlled agreement problem for multi-agent networks, where a collection of agents take on leader roles while the remaining agents execute local, consensus-like protocols. Our aim is to identify reflections of graph-theoretic notions on system-theoretic properties of such systems. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the controllability of the corresponding multi-agent system. Moreover, we introduce network equitable partitions as a means by which such controllability characterizations can be extended to the multileader setting.
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
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
Cited by
Closed-Loop Turbulence Control: Progress and Challenges
Brunton, S. L., & Noack, B. R. (2015) · Applied Mechanics Reviews · doi:10.1115/1.4031175 · Cited by 623
Controllability Metrics, Limitations and Algorithms for Complex Networks
Pasqualetti, F., Zampieri, S., & Bullo, F. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2310254 · Cited by 594
(2018) · IEEE Control Systems · doi:10.1109/mcs.2018.2810460 · Cited by 518
Control Profiles of Complex Networks
Ruths, J., & Ruths, D. (2014) · Science · doi:10.1126/science.1242063 · Cited by 391
Control Centrality and Hierarchical Structure in Complex Networks
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2012) · PLoS ONE · doi:10.1371/journal.pone.0044459 · Cited by 320
Metadata
- Authors
- Rahmani, A., Ji, M., Mesbahi, M., & Egerstedt, M.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 2009-01
- Volume
- 48
- Issue
- 1
- Pages
- 162-186
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W1963649370
- Cited by
- 767
- References
- 3
- FWCI
- 50.09
- 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: Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective. https://app.cochat.ai/papers/10.1137/060674909
- The paper
- Rahmani, A., Ji, M., Mesbahi, M., & Egerstedt, M. (2009). Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective. SIAM Journal on Control and Optimization. https://doi.org/10.1137/060674909
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.
