The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions
Open accessAbstract
In this paper, a time-varying distributed convex optimization problem is studied for continuous-time multi-agent systems. The objective is to minimize the sum of local time-varying cost functions, each of which is known to only an individual agent, through local interaction. Here, the optimal point is time varying and creates an optimal trajectory. Control algorithms are designed for the cases of single-integrator and double-integrator dynamics. In both cases, a centralized approach is first introduced to solve the optimization problem. Then, this problem is solved in a distributed manner and a discontinuous algorithm based on the signum function is proposed in each case. In the case of single-integrator (respectively, double-integrator) dynamics, each agent relies only on its own position and the relative positions (respectively, positions and velocities) between itself and its neighbors. A gain adaption scheme is introduced in both algorithms to eliminate certain global information requirement. To relax the restricted assumption imposed on feasible cost functions, an estimator based algorithm using the signum function is proposed, where each agent uses dynamic average tracking as a tool to estimate the centralized control input. As a tradeoff, the estimator-based algorithm necessitates communication between neighbors. Then, in the case of double-integrator dynamics, the proposed algorithms are further extended. Two continuous algorithms based on, respectively, a time-varying and a fixed boundary layer are proposed as continuous approximations of the signum function. To account for interagent collision for physical agents, a distributed convex optimization problem with swarm tracking behavior is introduced for both single-integrator and double-integrator dynamics. It is shown that the center of the agents tracks the optimal trajectory, the connectivity of the agents is maintained, and interagent collision is avoided.
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
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 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×
“Lemma 2.1: [25] The second smallest eigenvalue λ 2 [ L ] of the Laplacian matrix L associated with the undirected connected graph Lemma 2.2: Let f ( x ) : R m → R be a continuously differentiable convex function.”
BackgroundInfluentialFlocking 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
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
Sliding Mode Control: Theory And Applications
Edwards, C., & Spurgeon, S. (1998) · CRC Press eBooks · doi:10.1201/9781498701822 · Cited by 3,019
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
Cucker, F., & Smale, S. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895842 · Cited by 1,810
Finite-Time Consensus Problems for Networks of Dynamic Agents
Wang, L., & Xiao, F. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041610 · Cited by 1,170
Discontinuous dynamical systems
(2008) · IEEE Control Systems · doi:10.1109/mcs.2008.919306 · Cited by 1,068
Flocking of Multi-Agents With a Virtual Leader
Su, H., Wang, X., & Lin, Z. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2010897 · Cited by 933
Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
Gharesifard, B., & Cortes, J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2278132 · Cited by 833
Kia, S. S., Cortés, J., & Martínez, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.001 · Cited by 694
Distributed Coordinated Tracking With Reduced Interaction via a Variable Structure Approach
Cao, Y., & Ren, W. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2146830 · Cited by 568
Self-citationQuantized incremental algorithms for distributed optimization
Rabbat, M. G., & Nowak, R. D. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.843546 · Cited by 408
Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case
Lu, J., & Tang, C. Y. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2184199 · Cited by 403
A control perspective for centralized and distributed convex optimization
Wang, J., & Elia, N. (2011) · IEEE Conference on Decision and Control and European Control Conference · doi:10.1109/cdc.2011.6161503 · Cited by 398
Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded Derivatives
Chen, F., Cao, Y., & Ren, W. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2199176 · Cited by 320
Self-citationSubgradient 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
Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
Shi, G., Johansson, K. H., & Hong, Y. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2215261 · Cited by 288
Distributed Primal–Dual Subgradient Method for Multiagent Optimization via Consensus Algorithms
Yuan, D., Xu, S., & Zhao, H. (2011) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2160394 · Cited by 255
Incremental 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
Tu, S.-Y., & Sayed, A. H. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2125943 · Cited by 182
Decentralized Dynamic Optimization Through the Alternating Direction Method of Multipliers
Ling, Q. H., & Ribeiro, A. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2295055 · Cited by 150
Wang, X., & Hong, Y. (2010) · Journal of Systems Science and Complexity · doi:10.1007/s11424-010-7254-2 · Cited by 83
Continuous-time proportional-integral distributed optimisation for networked systems
Droge, G. N., Kawashima, H., & Egerstedt, M. (2014) · Journal of Control and Decision · doi:10.1080/23307706.2014.926622 · Cited by 72
Distributed average computation for multiple time‐varying signals with output measurements
Zhao, Y., Liu, Y., Duan, Z., et al. (2015) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3486 · Cited by 60
A continuous-time decentralized optimization scheme with positivity constraints
Kvaternik, K., & Pavel, L. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6425817 · Cited by 41
Distributed optimization with the consideration of adaptivity and finite-time convergence
Lin, P., Ren, W., Song, Y., & Farrell, J. A. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6858932 · Cited by 35
Self-citationRahili, S., Ren, W., & Lin, P. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7170713 · Cited by 24
Self-citationRahili, S., Ren, W., & Ghapani, S. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402227 · Cited by 12
Self-citationDistributed coordination for economic dispatch with varying load and generator commitment
Cherukuri, A. K., & Cortés, J. (2014) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2014.7028493 · Cited by 9
Cited by
Distributed Optimization for Multiagent Systems: An Edge-Based Fixed-Time Consensus Approach
Ning, B., Han, Q.-L., & Zuo, Z. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2766762 · Cited by 328
Metadata
- Authors
- Rahili, S., & Ren, W.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2017-04
- Volume
- 62
- Issue
- 4
- Pages
- 1590-1605
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2243302717
- Cited by
- 343
- References
- 32
- FWCI
- 21.48
- 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.