The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Consensus + innovations distributed inference over networks: cooperation and sensing in networked systems
Abstract
This article presents consensus + innovations inference algorithms that intertwine consensus (local averaging among agents) and innovations (sensing and assimilation of new observations). These algorithms are of importance in many scenarios that involve cooperation and interaction among a large number of agents with no centralized coordination. The agents only communicate locally over sparse topologies and sense new observations at the same rate as they communicate. This stands in sharp contrast with other distributed inference approaches, in which interagent communications are assumed to occur at a much faster rate than agents can sense (sample) the environment so that, in between measurements, agents may iterate enough times to reach a decision-consensus before a new measurement is made and assimilated. While optimal design of distributed inference algorithms in stochastic time-varying scenarios is a hard (often intractable) problem, this article emphasizes the design of asymptotically (in time) optimal distributed inference approaches, i.e., distributed algorithms that achieve the asymptotic performance of the corresponding optimal centralized inference approach (with instantaneous access to the entire network sensed information at all times). Consensus + innovations algorithms extend consensus in nontrivial ways to mixed-scale stochastic approximation algorithms, in which the time scales (or weighting) of the consensus potential (the potential for distributed agent collaboration) and of the innovation potential (the potential for local innovations) are suitably traded for optimal performance. This article shows why this is needed and what the implications are, giving the reader pointers to new methodologies that are useful in their own right and in many other contexts.
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
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
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
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Cited by
A 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
A Review on Distribution System State Estimation
Primadianto, A., & Lu, C.-N. (2017) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2016.2632156 · Cited by 652
Metadata
- Authors
- Kar, S., & Moura, J. M. F.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2013-05
- Volume
- 30
- Issue
- 3
- Pages
- 99-109
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2068254488
- Cited by
- 195
- References
- 4
- FWCI
- 21.59
- 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: Consensus + innovations distributed inference over networks: cooperation and sensing in networked systems. https://app.cochat.ai/papers/10.1109/msp.2012.2235193
- The paper
- Kar, S., & Moura, J. M. F. (2013). Consensus + innovations distributed inference over networks: cooperation and sensing in networked systems. IEEE Signal Processing Magazine. https://doi.org/10.1109/msp.2012.2235193
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.