Distributed Optimal Coordination for Heterogeneous Linear Multiagent Systems With Event-Triggered Mechanisms
The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
This note considers the distributed optimal coordination (DOC) problem for heterogeneous linear multiagent systems. The local gradients are locally Lipschitz and the local convexity constants are unknown. A control law is proposed to drive the states of all agents to the optimal coordination that minimizes a global objective function. By exploring certain features of the invariant projection of the Laplacian matrix, the global asymptotic convergence is guaranteed utilizing only local interaction. The proposed control law is then extended with event-triggered communication schemes, which removes the requirement for continuous communications. Under the event-triggered control law, it is proved that no Zeno behavior is exhibited and the global asymptotic convergence is preserved. The proposed control laws are fully distributed, in the sense that the control design only uses the information in the connected neighborhood. Furthermore, to achieve the DOC for linear multiagent systems with unmeasurable states, an observer-based event-triggered control law is proposed. A simulation example is given to validate the proposed control laws.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280 · cited 1×
“Lemma 2: [21, Th. 4.1.6] For two symmetric matrices A, B ∈ R n × n , there exists an orthogonal matrix U ∈ R n × n such that U T AU and U T BU are both diagonal iff AB = BA .”
BackgroundInfluentialDistributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719 · cited 3×
“, [1], [14], [15]; the bottom layer is a local regulator.”
BackgroundConstrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086 · cited 1×
“, [1], [14], [15]; the bottom layer is a local regulator.”
BackgroundNonlinear Output Regulation: Theory and Applications
Huang, J. (2004) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718683 · Cited by 1,425 · cited 2×
“These matrix equations can be viewed as an extension of regulator equations in [18].”
BackgroundDistributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187 · cited 1×
“, [1], [14], [15]; the bottom layer is a local regulator.”
BackgroundDistributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
Gharesifard, B., & Cortes, J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2278132 · Cited by 833 · cited 1×
“…zero-gradient-sum algorithms in [2] and [3], which are based on the differentiability of local gradients; the Lagrangian-based (LB) algorithms in [4], [5], and [6], which remove the requirement for differentiable local gradients at the cost of transmitting extra auxiliary states (the…”
BackgroundKia, S. S., Cortés, J., & Martínez, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.001 · Cited by 694 · cited 6×
“The authors in [7] and [11] exclude the Zeno behavior by setting an upper bound on the communication frequency.”
BackgroundMethodResultInfluentialDecentralized event-triggered consensus for linear multi-agent systems under general directed graphs
Yang, D., Ren, W., Liu, X., & Chen, W. (2016) · Automatica · doi:10.1016/j.automatica.2016.03.003 · Cited by 470 · cited 2×
“…than directly extending the existing ETMLB algorithms that are designed for DOPs, partly inspired by the event-triggered consensus control law in [19], we introduce two exponential functions to the triggering function, and exclude the Zeno behavior without setting an upper bound on the…”
BackgroundZero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case
Lu, J., & Tang, C. Y. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2184199 · Cited by 403 · cited 1×
“The examples include, the zero-gradient-sum algorithms in [2] and [3], which are based on the differentiability of local gradients; the Lagrangian-based (LB) algorithms in [4], [5], and [6], which remove the requirement for differentiable local gradients at the cost of transmitting extra auxiliary states (the communic…”
A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
Yang, S., Liu, Q., & Wang, J. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2610945 · Cited by 314 · cited 1×
“Since MLB algorithms have low communication costs and mild assumptions, it has been widely used for solving both constrained and unconstrained DOPs (see [8]–[10]).”
Distributed Optimization Based on a Multiagent System in the Presence of Communication Delays
Yang, S., Liu, Q., & Wang, J. (2017) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2016.2531649 · Cited by 289 · cited 2×
“Since MLB algorithms have low communication costs and mild assumptions, it has been widely used for solving both constrained and unconstrained DOPs (see [8]–[10]).”
ResultDistributed optimal coordination for multiple heterogeneous Euler–Lagrangian systems
Zhang, Y., Deng, Z., & Hong, Y. (2017) · Automatica · doi:10.1016/j.automatica.2017.01.004 · Cited by 272 · cited 1×
“Recently, in [12] and [13], by combining the concepts of computation/communication (cyber) and the dynamics/control (physical), the conventional DOP is extended to the distributed optimal coordination (DOC) problem, which requires that a group of continuous-time physical systems cooperatively…”
BackgroundDistributed Optimization for Linear Multiagent Systems: Edge- and Node-Based Adaptive Designs
Zhao, Y., Liu, Y., Wen, G., & Chen, G. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2669321 · Cited by 270 · cited 4×
“The DOC problem of homogeneous linear multiagent systems is first investigated in [17], and the proposed control law requires the local gradients to satisfy a special structure [17, eq.”
BackgroundMethodInfluentialDistributed Optimization for a Class of Nonlinear Multiagent Systems With Disturbance Rejection
Wang, X., Hong, Y., & Ji, H. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2453167 · Cited by 238 · cited 2×
“Different from the first method, the integrated control law is based on the system’s current states or outputs and does not require the optimal solution as a reference (see [16] and [17]).”
BackgroundMethodEvent-triggered zero-gradient-sum distributed consensus optimization over directed networks
Chen, W., & Ren, W. (2016) · Automatica · doi:10.1016/j.automatica.2015.11.015 · Cited by 234 · cited 1×
“The examples include, the zero-gradient-sum algorithms in [2] and [3], which are based on the differentiability of local gradients; the Lagrangian-based (LB) algorithms in [4], [5], and [6], which remove the requirement for differentiable local gradients at the cost of transmitting extra auxiliary…”
BackgroundDistributed Adaptive Convex Optimization on Directed Graphs via Continuous-Time Algorithms
Li, Z., Ding, Z., Sun, J., & Li, Z. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2750103 · Cited by 211 · cited 1×
“The examples include, the zero-gradient-sum algorithms in [2] and [3], which are based on the differentiability of local gradients; the Lagrangian-based (LB) algorithms in [4], [5], and [6], which remove the requirement for differentiable local gradients at the cost of transmitting extra auxiliary states (the communic…”
Self-citationPassivity-Based Distributed Optimization With Communication Delays Using PI Consensus Algorithm
Hatanaka, T., Chopra, N., Ishizaki, T., & Li, N. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2823264 · Cited by 130
Distributed optimisation design with triggers for disturbed continuous‐time multi‐agent systems
Deng, Z., Wang, X., & Hong, Y. (2016) · IET Control Theory and Applications · doi:10.1049/iet-cta.2016.0795 · Cited by 66 · cited 4×
“Remark 7: Some pioneering works have been done for the event-triggered distributed optimization with single integrator dynamics and undirected networks (e.g., [7] and [11]).”
BackgroundMethodInfluentialConsensus Control of a Class of Uncertain Nonlinear Multiagent Systems via Gradient-Based Algorithms
Li, R., & Yang, G. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2819361 · Cited by 50 · cited 1×
“Recently, in [12] and [13], by combining the concepts of computation/communication (cyber) and the dynamics/control (physical), the conventional DOP is extended to the distributed optimal coordination (DOC) problem, which requires that a group of continuous-time physical systems cooperatively…”
BackgroundDistributed Continuous-Time Optimization With Scalable Adaptive Event-Based Mechanisms
Wu, Z., Li, Z., Ding, Z., & Li, Z. (2018) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2018.2867175 · Cited by 44
Self-citationCao, Y., Ren, W., Chen, F., et al. (2011) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2011.5991019 · Cited by 31 · cited 1×
“Lemma 4: [22] Consider two differentiable functions F : R → R and z : R≥0 → J ⊆ R satisfying that”
Background
Metadata
- Authors
- Li, Z., Wu, Z., Li, Z., & Ding, Z.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2020-04
- Volume
- 65
- Issue
- 4
- Pages
- 1763-1770
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2970372812
- Cited by
- 183
- References
- 23
- FWCI
- 8.54
- 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.