The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Data-Driven Optimal Consensus Control for Discrete-Time Multi-Agent Systems With Unknown Dynamics Using Reinforcement Learning Method
Abstract
This paper investigates the optimal consensus control problem for discrete-time multi-agent systems with completely unknown dynamics by utilizing a data-driven reinforcement learning method. It is known that the optimal consensus control for multi-agent systems relies on the solution of the coupled Hamilton-Jacobi-Bellman equation, which is generally impossible to be solved analytically. Even worse, most real-world systems are too complicated to obtain accurate mathematical models. To overcome these deficiencies, a data-based adaptive dynamic programming method is presented using the current and past system data rather than the accurate system models also instead of the traditional identification scheme which would cause the approximation residual errors. First, we establish a discounted performance index and formulate the optimal consensus problem via Bellman optimality principle. Then, we introduce the policy iteration algorithm which motivates this paper. To implement the proposed online action-dependent heuristic dynamic programming method, two neural networks (NNs), 1) critic NN and 2) actor NN, are employed to approximate the iterative performance index functions and control policies, respectively, in real time. Finally, two simulation examples are provided to demonstrate the effectiveness of the proposed method.
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
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×
“R ESEARCH on distributed control for multi-agent systems has attracted increasingly significant attention due to its broad applications among the fields of unmanned air vehicles [1], formation control [2], flocking [3], congestion control in communication networks [4], and distributed sensor networks [5].”
BackgroundInformation 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
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Online actor–critic algorithm to solve the continuous-time infinite horizon optimal control problem
Vamvoudakis, K. G., & Lewis, F. L. (2010) · Automatica · doi:10.1016/j.automatica.2010.02.018 · Cited by 1,703
Reinforcement learning and adaptive dynamic programming for feedback control
Lewis, F. L., & Vrabie, D. (2009) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2009.933854 · Cited by 1,558
Abu-Khalaf, M., & Lewis, F. L. (2005) · Automatica · doi:10.1016/j.automatica.2004.11.034 · Cited by 1,349
A survey of consensus problems in multi-agent coordination
Ren, W., Beard, R. W., & Atkins, E. M. (2005) · Proceedings of the 2005, American Control Conference, 2005. · doi:10.1109/acc.2005.1470239 · Cited by 1,344
Robust Finite-Time Consensus Tracking Algorithm for Multirobot Systems
Khoo, S., Xie, L., & Man, Z. (2009) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2009.2014057 · Cited by 835
Online learning control by association and reinforcement
Si, J., & Wang, Y.-T. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.914523 · Cited by 773
Policy Iteration Adaptive Dynamic Programming Algorithm for Discrete-Time Nonlinear Systems
Liu, D., & Wei, Q. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2281663 · Cited by 753
Modares, H., & Lewis, F. L. (2014) · Automatica · doi:10.1016/j.automatica.2014.05.011 · Cited by 701
Data-Driven Model-Free Adaptive Control for a Class of MIMO Nonlinear Discrete-Time Systems
Hou, Z., & Jin, S. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2176141 · Cited by 685
Zhang, H., Luo, Y., & Liu, D. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2027233 · Cited by 649
Self-citationVamvoudakis, K. G., Lewis, F. L., & Hudas, G. R. (2012) · Automatica · doi:10.1016/j.automatica.2012.05.074 · Cited by 571
Modares, H., Lewis, F. L., & Jiang, Z. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2441749 · Cited by 570
Modares, H., Lewis, F. L., & Naghibi-Sistani, M.-B. (2014) · Automatica · doi:10.1016/j.automatica.2013.09.043 · Cited by 570
Vamvoudakis, K. G., & Lewis, F. L. (2011) · Automatica · doi:10.1016/j.automatica.2011.03.005 · Cited by 525 · cited 2×
“It is known that the optimal consensus control relies on the solution of the coupled Hamilton–Jacobi–Bellman (HJB) equation, which is generally impossible to be solved analytically [8].”
MethodZhang, H., Zhang, J., Yang, G.-H., & Luo, Y. (2015) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2014.2310238 · Cited by 519
Self-citationZhang, H., Wei, Q., & Luo, Y. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.920269 · Cited by 489
Self-citationZhang, H., Cui, L., & Luo, Y. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2203336 · Cited by 464
Self-citationModares, H., Lewis, F. L., & Naghibi-Sistani, M.-B. (2013) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2276571 · Cited by 462
Zhang, H., Feng, T., Yang, G.-H., & Liang, H. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2350511 · Cited by 327
Self-citationActor–Critic-Based Optimal Tracking for Partially Unknown Nonlinear Discrete-Time Systems
Kiumarsi, B., & Lewis, F. L. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2358227 · Cited by 326
Optimal Adaptive Control and Differential Games by Reinforcement Learning Principles
Vrabie, D., Vamvoudakis, K. G., & Lewis, F. L. (2012) · Institution of Engineering and Technology eBooks · doi:10.1049/pbce081e · Cited by 291
Multi-agent discrete-time graphical games and reinforcement learning solutions
Abouheaf, M. I., Lewis, F. L., Vamvoudakis, K. G., Haesaert, S., & Babuska, R. (2014) · Automatica · doi:10.1016/j.automatica.2014.10.047 · Cited by 284
Hou, Z., & Zhu, Y. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2013.2257806 · Cited by 242
Online solution of nonlinear two‐player zero‐sum games using synchronous policy iteration
Vamvoudakis, K. G., & Lewis, F. L. (2011) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1760 · Cited by 238
Zhang, H., Qin, C., & Luo, Y. (2014) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2014.2303139 · Cited by 234
Self-citationTijs, S. (2003) · Texts and Readings in Mathematics · doi:10.1007/978-93-86279-17-0 · Cited by 232
Abu-Khalaf, M., Lewis, F. L., & Huang, J. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.884959 · Cited by 229
Wang, D., Liu, D., & Wei, Q. (2012) · Neurocomputing · doi:10.1016/j.neucom.2011.03.058 · Cited by 224
Qin, J., Yu, C., & Gao, H. (2014) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2013.2273480 · Cited by 192
Liu, D., Li, H., & Wang, D. (2013) · Neurocomputing · doi:10.1016/j.neucom.2012.11.021 · Cited by 188
Dierks, T., Thumati, B. T., & Jagannathan, S. (2009) · Neural Networks · doi:10.1016/j.neunet.2009.06.014 · Cited by 186
Wei, Q., & Liu, D. (2014) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2014.2301770 · Cited by 179
Flocking of Multi-Agent Non-Holonomic Systems With Proximity Graphs
Zhu, J., Lu, J., & Yu, X. (2013) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2012.2215715 · Cited by 160
Zhong, X., He, H., Zhang, H., & Wang, Z. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2305841 · Cited by 153
Self-citationComplete stability analysis of a heuristic approximate dynamic programming control design
Sokolov, Y., Kozma, R., Werbos, L., & Werbos, P. J. (2015) · Automatica · doi:10.1016/j.automatica.2015.06.001 · Cited by 141
A boundedness result for the direct heuristic dynamic programming
Liu, F., Sun, J. Q., Si, J., Guo, W., & Mei, S. (2012) · Neural Networks · doi:10.1016/j.neunet.2012.02.005 · Cited by 134
Wei, Q., Liu, D., Shi, G., & Liu, Y. (2015) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2014.2388198 · Cited by 128
Wei, Q., Liu, D., & Lewis, F. L. (2015) · Information Sciences · doi:10.1016/j.ins.2015.04.044 · Cited by 122
Discrete-time dynamic graphical games: model-free reinforcement learning solution
Abouheaf, M., Lewis, F. L., Mahmoud, M. S., & Mikulski, D. (2015) · Control Theory and Technology · doi:10.1007/s11768-015-3203-x · Cited by 72
Wei, Q., Zhang, H., Liu, D., & Zhao, Y. H. (2010) · Acta Automatica Sinica · doi:10.3724/sp.j.1004.2010.00121 · Cited by 65
Self-citationDual Heuristic dynamic Programming for nonlinear discrete-time uncertain systems with state delay
Wang, B., Zhao, D., Alippi, C., & Liu, D. (2013) · Neurocomputing · doi:10.1016/j.neucom.2013.06.037 · Cited by 42
Multi-agent differential graphical games: Nash online adaptive learning solutions
Abouheaf, M., & Lewis, F. L. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760804 · Cited by 34
Multi-agent discrete-time graphical games: interactive Nash equilibrium and value iteration solution
Abouheaf, M., Lewis, F. L., Haesaert, S., Babuška, R., & Vamvoudakis, K. G. (2013) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2013.6580483 · Cited by 22
Cited by
Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms
Zhang, K., Yang, Z., & Başar, T. (2021) · Studies in Systems, Decision and Control · doi:10.1007/978-3-030-60990-0_12 · Cited by 1,264
A review of cooperative multi-agent deep reinforcement learning
Oroojlooy, A., & Hajinezhad, D. (2023) · Applied Intelligence · doi:10.1007/s10489-022-04105-y · Cited by 482
Reinforcement learning in robotic applications: a comprehensive survey
Singh, B., Kumar, R., & Singh, V. P. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-09997-9 · Cited by 392
Peng, Z., Hu, J., Shi, K., Luo, R., Huang, R., Ghosh, B. K., & Huang, J. (2020) · Applied Mathematics and Computation · doi:10.1016/j.amc.2019.124821 · Cited by 302
Bai, W., Chen, D., Zhao, B., & D'Ariano, A. (2025) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2024.3458894 · Cited by 31
Metadata
- Authors
- Zhang, H., Jiang, H., Luo, Y., & Xiao, G.
- Venue
- IEEE Transactions on Industrial Electronics
- Published
- 2017-05
- Volume
- 64
- Issue
- 5
- Pages
- 4091-4100
- ISSN
- 0278-0046 (ISSN-L)
- 1557-9948
- OpenAlex
- W2320262435
- Cited by
- 424
- References
- 46
- FWCI
- 27.99
- 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
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.