The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Cooperative Optimal Control for Multi-Agent Systems on Directed Graph Topologies
Abstract
This note brings together stability and optimality theory to design distributed cooperative control protocols that guarantee consensus and are globally optimal with respect to a positive semi-definite quadratic performance criterion. A common problem in cooperative optimal control is that global optimization problems generally require global information, which is not available to distributed controllers. Optimal control for multi-agent systems is complicated by the fact that the communication graph topology interplays with the agent system dynamics. In the note we use an inverse optimality approach together with partial stability to consider the cooperative consensus and pinning control. Agents with identical linear time-invariant dynamics are considered. Communication graphs are assumed directed and having fixed topology. Structured quadratic performance indices are derived that capture the topology of the graph, which allows for global optimal control that is implemented using local distributed protocols. A new class of digraphs is defined that admits a distributed solution to the global optimal control problem, namely those with simple graph Laplacian matrices.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 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
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
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint
Li, Z., Duan, Z., Chen, G., & Huang, L. (2010) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2009.2023937 · Cited by 2,400
Lewis, F. L., Vrabie, D. L., & Syrmos, V. L. (2012) · doi:10.1002/9781118122631 · Cited by 2,020
Self-citationMatrix Mathematics: Theory, Facts, and Formulas (Second Edition)
Bernstein, D. S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400833344 · Cited by 1,324
Pinning control of scale-free dynamical networks
Wang, X. F., & Chen, G. (2002) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)00772-0 · Cited by 1,008
Zhang, H., Lewis, F. L., & Das, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2139510 · Cited by 946
Self-citationConsensus protocols for networks of dynamic agents
Saber, R. O., & Murray, R. M. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1239709 · Cited by 901
Li, Z., Ren, W., Liu, X., & Fu, M. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2235715 · Cited by 841
Distributed receding horizon control for multi-vehicle formation stabilization
Dunbar, W. B., & Murray, R. M. (2006) · Automatica · doi:10.1016/j.automatica.2005.12.008 · Cited by 757
Zhang, H., Lewis, F. L., & Qu, Z. (2012) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2011.2160140 · Cited by 700
Self-citationOptimal Linear-Consensus Algorithms: An LQR Perspective
Cao, Y., & Ren, W. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2030495 · Cited by 345
Distributed LQR Design for Identical Dynamically Decoupled Systems
Borrelli, F., & Keviczky, T. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.925826 · Cited by 302
LQR-based coupling gain for synchronization of linear systems
Tuna, S. E. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0801.3390 · Cited by 258
Multi-agent team cooperation: A game theory approach
Semsar-Kazerooni, E., & Khorasani, K. (2009) · Automatica · doi:10.1016/j.automatica.2009.06.006 · Cited by 240
Distributed optimal control of multiple systems
Dong, W. (2010) · International Journal of Control · doi:10.1080/00207179.2010.504786 · Cited by 48
Inverse optimality of cooperative control for networked systems
Qu, Z., & Simaan, M. A. (2009) · doi:10.1109/cdc.2009.5399741 · Cited by 17
Policy iteration algorithm for distributed networks and graphical games
Vamvoudakis, K. G., & Lewis, F. L. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6160491 · Cited by 15
Self-citation
Cited by
Zhang, H., Feng, T., Yang, G.-H., & Liang, H. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2350511 · Cited by 327
Fully Decentralized Multi-Agent Reinforcement Learning with Networked Agents
Zhang, K., Yang, Z., Liu, H., Zhang, T., & Başar, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.08757 · Cited by 293
Metadata
- Authors
- Movric, K. H., & Lewis, F. L.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2014-03
- Volume
- 59
- Issue
- 3
- Pages
- 769-774
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2092215165
- Cited by
- 327
- References
- 19
- FWCI
- 23.79
- 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.