The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Consensus Computation in Unreliable Networks: A System Theoretic Approach
Open accessAbstract
This paper addresses the problem of ensuring trustworthy computation in a linear consensus network. A solution to this problem is relevant for several tasks in multi-agent systems including motion coordination, clock synchronization, and cooperative estimation. In a linear consensus network, we allow for the presence of misbehaving agents, whose behavior deviate from the nominal consensus evolution. We model misbehaviors as unknown and unmeasurable inputs affecting the network, and we cast the misbehavior detection and identification problem into an unknown-input system theoretic framework. We consider two extreme cases of misbehaving agents, namely faulty (non-colluding) and malicious (Byzantine) agents. First, we characterize the set of inputs that allow misbehaving agents to affect the consensus network while remaining undetected and/or unidentified from certain observing agents. Second, we provide worst-case bounds for the number of concurrent faulty or malicious agents that can be detected and identified. Precisely, the consensus network needs to be 2k+1 (resp.k+1) connected forkmalicious (resp. faulty) agents to be generically detectable and identifiable by every well behaving agent. Third, we quantify the effect of undetectable inputs on the final consensus value. Fourth, we design three algorithms to detect and identify misbehaving agents. The first and the second algorithm apply fault detection techniques, and affords complete detection and identification if global knowledge of the network is available to each agent, at a high computational cost. The third algorithm is designed to exploit the presence in the network of weakly interconnected subparts, and provides local detection and identification of misbehaving agents whose behavior deviates more than a threshold, which is quantified in terms of the interconnection structure.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
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 · cited 1×
“In this work, we consider linear consensus iterations, where, at each time instant, each node updates its state as a weighted combination of its own value and those received from its neighbors [5], [6].”
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 1×
“A detailed treatment of the applications, and the convergence aspects of the consensus algorithm is in [1], [2], [3], and in the references therein.”
BackgroundCoordination 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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Matrix analysis and applied linear algebra
(2001) · Choice Reviews Online · doi:10.5860/choice.38-5065 · Cited by 3,300
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
Linear Multivariable Control: a Geometric Approach
Wonham, W. M. (1979) · Springer eBooks · doi:10.1007/978-1-4684-0068-7 · Cited by 3,136
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61769-8 · Cited by 1,865
Core: A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks
Michiardi, P., & Molva, R. (2002) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-35612-9_9 · Cited by 1,625
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Self-citationOlmsted, J. M. H., Kolmogorov, A. N., Fomin, S. V., & Silverman, R. A. (1971) · The American Mathematical Monthly · doi:10.2307/2316932 · Cited by 1,397
Fault diagnosis in dynamic systems : theory and applications
Patton, R. J., Frank, P. M., & Clarke, R. N. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,066
Controlled and conditioned invariants in linear system theory
Basile, G., & Marro, G. (1992) · Prentice Hall eBooks · Cited by 816
Wonham, W. M. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1082-5 · Cited by 809
Control Theory for Linear Systems
Trentelman, H. L., Stoorvogel, A. A., & Hautus, M. (2001) · Communications and Control Engineering · doi:10.1007/978-1-4471-0339-4 · Cited by 675
Distributed Control of Robotic Networks
Bullo, F. (2009) · Cited by 588
Self-citationFailure detection and identification
Massoumnia, M.-A., Verghese, G. C., & Willsky, A. S. (1989) · IEEE Transactions on Automatic Control · doi:10.1109/9.16422 · Cited by 588
The Byzantine generals strike again
Dolev, D. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90004-9 · Cited by 575
Generic properties and control of linear structured systems: a survey
Dion, J.-M., Commault, C., & van der Woude, J. (2003) · Automatica · doi:10.1016/s0005-1098(03)00104-3 · Cited by 522
Multivariable Control A Graph-Theoretic Approach
(1988) · Lecture Notes in Control and Information Sciences · doi:10.1007/bfb0051585 · Cited by 308
A singular perturbation approach to modeling and control of Markov chains
Phillips, R. G., & Kokotović, P. V. (1981) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1981.1102780 · Cited by 198
Distributed intrusion detection for secure consensus computations
Pasqualetti, F., Bicchi, A., & Bullo, F. (2007) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2007.4434297 · Cited by 95
Self-citationArea aggregation and time-scale modeling for sparse nonlinear networks
Bıyık, E., & Arcak, M. (2007) · Systems & Control Letters · doi:10.1016/j.sysconle.2007.08.003 · Cited by 77
Sundaram, S., & Hadjicostis, C. N. (2008) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2008.4586680 · Cited by 54
Sundaram, S., & Hadjicostis, C. N. (2008) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2008.4586681 · Cited by 44
Cited by
Attack Detection and Identification in Cyber-Physical Systems
Pasqualetti, F., Dorfler, F., & Bullo, F. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2266831 · Cited by 2,109
Self-citationA survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Recent 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
Resilient Asymptotic Consensus in Robust Networks
LeBlanc, H. J., Zhang, H., Koutsoukos, X., & Sundaram, S. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130413 · Cited by 730
Secure State Estimation and Control of Cyber-Physical Systems: A Survey
Ding, D., Han, Q.-L., Ge, X., & Wang, J. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2020.3041121 · Cited by 591
Metadata
- Authors
- Pasqualetti, F., Bicchi, A., & Bullo, F.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2012-01
- Volume
- 57
- Issue
- 1
- Pages
- 90-104
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2112668583
- Cited by
- 541
- References
- 29
- FWCI
- 43.45
- 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.