The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Distributed Optimal Consensus Control for Nonlinear Multiagent System With Unknown Dynamic
Abstract
This paper focuses on the distributed optimal cooperative control for continuous-time nonlinear multiagent systems (MASs) with completely unknown dynamics via adaptive dynamic programming (ADP) technology. By introducing predesigned extra compensators, the augmented neighborhood error systems are derived, which successfully circumvents the system knowledge requirement for ADP. It is revealed that the optimal consensus protocols actually work as the solutions of the MAS differential game. Policy iteration algorithm is adopted, and it is theoretically proved that the iterative value function sequence strictly converges to the solution of the coupled Hamilton-Jacobi-Bellman equation. Based on this point, a novel online iterative scheme is proposed, which runs based on the data sampled from the augmented system and the gradient of the value function. Neural networks are employed to implement the algorithm and the weights are updated, in the least-square sense, to the ideal value, which yields approximated optimal consensus protocols. Finally, a numerical example is given to illustrate the effectiveness of the proposed scheme.
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
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 · cited 1×
“mmunity, and finds its applications in vehicle formation, flocking, sensor networks, etc. For a comprehensive literature review, readers are referred to some recent survey papers [1]–[4] and monographs [5]–[7], and references therein. In some scenarios, one may not only require consensus of all the agents, but also expe…”
BackgroundMurray, J. J., Cox, C. J., Lendaris, G. G., & Saeks, R. (2002) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2002.801727 · Cited by 677 · cited 2×
“Actually, value function (10) can be written as the discretized form by sampling, such as that in [20], [42], and [43], as follows:”
BackgroundMethodAl-Tamimi, A., Lewis, F. L., & Abu-Khalaf, M. (2007) · Automatica · doi:10.1016/j.automatica.2006.09.019 · Cited by 611
Lewis, F. L., & Vamvoudakis, K. G. (2011) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2010.2043839 · Cited by 544 · cited 1×
“In addition to the above mentioned results, some ADP methods, which do not require a completed dynamic of the systems, have also been developed, such as [20], [33], [34], and [36]–[39].”
ResultVamvoudakis, K. G., & Lewis, F. L. (2011) · Automatica · doi:10.1016/j.automatica.2011.03.005 · Cited by 525 · cited 1×
“The coordination mechanism is very similar to the works [13], [14].”
ResultGao, W., Jiang, Y., Jiang, Z.-P., & Chai, T. (2016) · Automatica · doi:10.1016/j.automatica.2016.05.008 · Cited by 234 · cited 1×
“is generally difficult due to the coupling items. Here, the I/O Q-learning algorithm is used to solve the problem of multi-agent differential games involving a technique known as value iteration (VI) [22]. Value iteration algorithms can be implemented in two steps: value update and policy improvement; and provides an e…”
MethodBai, L., Zhou, Q., Wang, L., Yu, Z., & Li, H. (2017) · International Journal of Adaptive Control and Signal Processing · doi:10.1002/acs.2780 · Cited by 59
Cited by
Nguyen, T. T., Nguyen, N. D., & Nahavandi, S. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2977374 · Cited by 1,306
Distributed Control and Communication Strategies in Networked Microgrids
Zhou, Q., Shahidehpour, M., Paaso, A., Bahramirad, S., Alabdulwahab, A., & Abusorrah, A. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3023963 · Cited by 307
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, J., Zhang, H., & Feng, T.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2018-08
- Volume
- 29
- Issue
- 8
- Pages
- 3339-3348
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2740962288
- Cited by
- 205
- References
- 7
- FWCI
- 15.36
- 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.