The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Sampled-Data Consensus of Linear Multi-agent Systems With Packet Losses
Abstract
In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.
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
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
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 · cited 2×
“2598243 sensor networks, attitude of spacecraft alignment, and so on [1]–[3].”
BackgroundHorn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
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
Robust sampled-data stabilization of linear systems: an input delay approach
Fridman, E., Seuret, A., & Richard, J.-P. (2004) · Automatica · doi:10.1016/j.automatica.2004.03.003 · Cited by 1,230
Multi-vehicle consensus with a time-varying reference state
Ren, W. (2007) · Systems & Control Letters · doi:10.1016/j.sysconle.2007.01.002 · Cited by 780
Exponential stability of impulsive systems with application to uncertain sampled-data systems
Naghshtabrizi, P., Hespanha, J. P., & Teel, A. R. (2008) · Systems & Control Letters · doi:10.1016/j.sysconle.2007.10.009 · Cited by 717
A novel stability analysis of linear systems under asynchronous samplings
Seuret, A. (2012) · Automatica · doi:10.1016/j.automatica.2011.09.033 · Cited by 610
Optimal recursive estimation with uncertain observation
Nahi, N. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054329 · Cited by 599
Cited by
A survey on recent advances in distributed sampled-data cooperative control of multi-agent systems
Ge, X., Han, Q.-L., Ding, D., Zhang, X.-M., & Ning, B. (2018) · Neurocomputing · doi:10.1016/j.neucom.2017.10.008 · Cited by 389
Data-Driven Multiagent Systems Consensus Tracking Using Model Free Adaptive Control
Bu, X., Hou, Z., & Zhang, H. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2673020 · Cited by 329
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
Metadata
- Authors
- Zhang, W., Tang, Y., Huang, T., & Kurths, J.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2017-11
- Volume
- 28
- Issue
- 11
- Pages
- 2516-2527
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2509548973
- Cited by
- 278
- References
- 26
- FWCI
- 31.27
- 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: Sampled-Data Consensus of Linear Multi-agent Systems With Packet Losses. https://app.cochat.ai/papers/10.1109/tnnls.2016.2598243
- The paper
- Zhang, W., Tang, Y., Huang, T., & Kurths, J. (2017). Sampled-Data Consensus of Linear Multi-agent Systems With Packet Losses. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2016.2598243
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.