The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
Open accessAbstract
In this paper, multi-agent systems minimizing a sum of objective functions, where each component is only known to a particular node, is considered for continuous-time dynamics with time-varying interconnection topologies. Assuming that each node can observe a convex solution set of its optimization component, and the intersection of all such sets is nonempty, the considered optimization problem is converted to an intersection computation problem. By a simple distributed control rule, the considered multi-agent system with continuous-time dynamics achieves not only a consensus, but also an optimal agreement within the optimal solution set of the overall optimization objective. Directed and bidirectional communications are studied, respectively, and connectivity conditions are given to ensure a global optimal consensus. In this way, the corresponding intersection computation problem is solved by the proposed decentralized continuous-time algorithm. We establish several important properties of the distance functions with respect to the global optimal solution set and a class of invariant sets with the help of convex and non-smooth analysis.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
Olfati-Saber, R. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.864190 · Cited by 5,037
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Distributed 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
Differential Inclusions: Set-Valued Maps and Viability Theory
Aubin, J.-P., & Cellina, A. (1984) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-69512-4 · Cited by 3,393
Distributed Consensus in Multi-vehicle Cooperative Control
Ren, W., & Beard, R. W. (2008) · Communications and Control Engineering · doi:10.1007/978-1-84800-015-5 · Cited by 2,826
Stability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
Constrained 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
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
Nonsmooth Analysis and Control Theory
(1998) · Graduate Texts in Mathematics · doi:10.1007/b97650 · Cited by 1,962
Analysis of recursive stochastic algorithms
Ljung, L. (1977) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1977.1101561 · Cited by 1,467
Flocking in Fixed and Switching Networks
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895948 · Cited by 1,431
Discontinuous dynamical systems
(2008) · IEEE Control Systems · doi:10.1109/mcs.2008.919306 · Cited by 1,068
Algorithms for Reporting and Counting Geometric Intersections
Bentley, & Ottmann (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675432 · Cited by 996
Distributed optimization in sensor networks
Rabbat, M., & Nowak, R. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984626 · Cited by 901
Xiao, F., & Wang, L. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.929381 · Cited by 734
The method of projections for finding the common point of convex sets
Gubin, L. G., Polyak, B. T., & Raik, E. V. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90113-9 · Cited by 729
Motion Coordination with Distributed Information
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.384124 · Cited by 526
Studies in Linear and Non-Linear Programming.
Suzuki, G., Arrow, K. J., Hurwicz, L., & Uzawa, H. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002823 · Cited by 520
State Agreement for Continuous‐Time Coupled Nonlinear Systems
Lin, Z., Francis, B., & Maggiore, M. (2007) · SIAM Journal on Control and Optimization · doi:10.1137/050626405 · Cited by 508
Geometric intersection problems
Shamos, M. I., & Hoey, D. (1976) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1976.16 · Cited by 469
Lyapunov-Based Approach to Multiagent Systems With Switching Jointly Connected Interconnection
Hong, Y., Gao, L., Cheng, D., & Hu, J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895860 · Cited by 463
Self-citationDiscontinuous Dynamical Systems: A tutorial on solutions, nonsmooth analysis, and stability
Cortés, J. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0901.3583 · Cited by 397
State consensus for multi-agent systems with switching topologies and time-varying delays
Xiao, F., & Wang, L. (2006) · International Journal of Control · doi:10.1080/00207170600825097 · Cited by 384
A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
Johansson, B., Rabi, M., & Johansson, M. (2010) · SIAM Journal on Optimization · doi:10.1137/08073038x · Cited by 336
Subgradient methods and consensus algorithms for solving convex optimization problems
Johansson, B., Keviczky, T., Johansson, M., & Johansson, K. H. (2008) · 2008 47th IEEE Conference on Decision and Control · doi:10.1109/cdc.2008.4739339 · Cited by 316
Self-citationIncremental Stochastic Subgradient Algorithms for Convex Optimization
Ram, S. S., Nedić, A., & Veeravalli, V. V. (2009) · SIAM Journal on Optimization · doi:10.1137/080726380 · Cited by 239
Shi, G., & Hong, Y. (2009) · Automatica · doi:10.1016/j.automatica.2008.12.015 · Cited by 223
Self-citationDistributed subgradient methods and quantization effects
Nedic, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2008) · 2008 47th IEEE Conference on Decision and Control · doi:10.1109/cdc.2008.4738860 · Cited by 185
An Extension of LaSalle's Invariance Principle and Its Application to Multi-Agent Consensus
Cheng, D., Wang, J., & Xiaoming Hu, A. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.928332 · Cited by 144
Jakovetić, D., Xavier, J., & Moura, J. M. F. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2146776 · Cited by 131
Connectivity and Set Tracking of Multi-Agent Systems Guided by Multiple Moving Leaders
Shi, G., Hong, Y., & Johansson, K. H. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2164733 · Cited by 120
Self-citationA Lower Bound on Convergence of a Distributed Network Consensus Algorithm
Cao, M., Spielman, D. A., & Morse, A. S. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2005.1582514 · Cited by 118
On decentralized negotiation of optimal consensus
Johansson, B. J. E., Speranzon, A., Johansson, M., et al. (2007) · Automatica · doi:10.1016/j.automatica.2007.09.003 · Cited by 113
Gossip Algorithms for Convex Consensus Optimization Over Networks
Lu, J., Tang, C. Y., Regier, P. R., & Bow, T. D. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2160020 · Cited by 107
A simple peer-to-peer algorithm for distributed optimization in sensor networks
Johansson, B., Rabi, M., & Johansson, M. (2007) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2007.4434888 · Cited by 97
Stochastic Incremental Gradient Descent for Estimation in Sensor Networks
Ram, S. S., Nedić, A., & Veeravalli, V. V. (2007) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2007.4487280 · Cited by 66
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
Self-citationA tutorial on modeling and analysis of dynamic social networks. Part I
Proskurnikov, A. V., & Tempo, R. (2017) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2017.03.002 · Cited by 553
Yi, P., Hong, Y., & Liu, F. (2016) · Automatica · doi:10.1016/j.automatica.2016.08.007 · Cited by 478
Self-citationLin, P., Ren, W., & Farrell, J. A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2604324 · Cited by 403
Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions
Rahili, S., & Ren, W. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2593899 · Cited by 343
Metadata
- Authors
- Shi, G., Johansson, K. H., & Hong, Y.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2013-03
- Volume
- 58
- Issue
- 3
- Pages
- 610-622
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W1982993533
- Cited by
- 288
- References
- 42
- FWCI
- 19.84
- 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.