Event-Based $H_{\infty}$ Consensus Control of Multi-Agent Systems With Relative Output Feedback: The Finite-Horizon Case
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
In this technical note, the H∞consensus control problem is investigated over a finite horizon for general discrete time-varying multi-agent systems subject to energy-bounded external disturbances. A decentralized estimation-based output feedback control protocol is put forward via the relative output measurements. A novel event-based mechanism is proposed for each intelligent agent to utilize the available information in order to decide when to broadcast messages and update control input. The aim of the problem addressed is to co-design the time-varying controller and estimator parameters such that the controlled multi-agent systems achieve consensus with a disturbance attenuation level γ over a finite horizon [0, T]. A constrained recursive Riccati difference equation approach is developed to derive the sufficient conditions under which the H∞consensus performance is guaranteed in the framework of event-based scheme. Furthermore, the desired controller and estimator parameters can be iteratively computed by resorting to the Moore-Penrose pseudo inverse. Finally, the effectiveness of the developed event-based H∞ consensus control strategy is demonstrated in the numerical simulation.
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
Distributed event-triggered control for multi-agent systems
Dimarogonas, D. V., Frazzoli, E., & Johansson, K. H. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2174666 · Cited by 2,556 · cited 2×
“Specifically, in [5], both centralized and decentralized eventbased control strategies have been proposed for a group of singleintegrator multi-agents in order to reach an agreement according to a fixed undirected network topology.”
Background
Cited by
A survey of deep neural network architectures and their applications
Liu, W., Wang, Z., Liu, X., Zeng, N., Liu, Y., & Alsaadi, F. E. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.12.038 · Cited by 3,239
“It should be pointed out that, so far, there have been a multitude of resea ch results on the stability analysis, stabilization and synchronization problems for various types of systems a nd networks in the literature, see [64], [67], [68], [102], [143], [163], [168], [174] for some recent publicati ons.”
BackgroundSelf-citationRecent Advances in Consensus of Multi-Agent Systems: A Brief Survey
Qin, J., Ma, Q., Shi, Y., & Wang, L. (2017) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2016.2636810 · Cited by 863
Distributed networked control systems: A brief overview
Ge, X., Yang, F., & Han, Q.-L. (2017) · Information Sciences · doi:10.1016/j.ins.2015.07.047 · Cited by 679
Event-triggered communication and control of networked systems for multi-agent consensus
Nowzari, C., Garcia, E., & Cortés, J. (2019) · Automatica · doi:10.1016/j.automatica.2019.03.009 · Cited by 655
Nair, R. R., Behera, L., & Kumar, S. (2019) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2017.2757448 · Cited by 274
Event/Self-Triggered Control for Leader-Following Consensus Over Unreliable Network With DoS Attacks
Xu, W., Ho, D. W. C., Zhong, J., & Chen, B. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2890119 · Cited by 255
A survey of swarm and evolutionary computing approaches for deep learning
Darwish, A., Hassanien, A. E., & Das, S. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09719-2 · Cited by 200
“(3) The cost of implementing the architecture: Features extraction can be done before-hand and then the appropriate algorithm can be implemented as in Galloway et al. (2016), Liu et al. (2015b), Junbo et al. (2015).”
Background
Metadata
- Authors
- Liu, Q., Wang, Z., He, X., & Zhou, D. H.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2015-09
- Volume
- 60
- Issue
- 9
- Pages
- 2553-2558
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W1967557378
- Cited by
- 124
- References
- 1
- FWCI
- 20.72
- Type
- journal article
- Language
- en
- Open access
- green
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.