Global Adaptive Dynamic Programming for Continuous-Time Nonlinear Systems
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
This paper presents a novel method of global adaptive dynamic programming (ADP) for the adaptive optimal control of nonlinear polynomial systems. The strategy consists of relaxing the problem of solving the Hamilton-Jacobi-Bellman (HJB) equation to an optimization problem, which is solved via a new policy iteration method. The proposed method distinguishes from previously known nonlinear ADP methods in that the neural network approximation is avoided, giving rise to significant computational improvement. Instead of semiglobally or locally stabilizing, the resultant control policy is globally stabilizing for a general class of nonlinear polynomial systems. Furthermore, in the absence of the a priori knowledge of the system dynamics, an online learning method is devised to implement the proposed policy iteration technique by generalizing the current ADP theory. Finally, three numerical examples are provided to validate 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
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728 · cited 1×
“Although n eural networks can be used as universal approximators [18], [34], there are at least two m ajor limitations for ADP-based online implementations.”
BackgroundLewis, F. L., Vrabie, D. L., & Syrmos, V. L. (2012) · doi:10.1002/9781118122631 · Cited by 2,020
Cited by
Adaptive Dynamic Programming for Control: A Survey and Recent Advances
Liu, D., Xue, S., Zhao, B., Luo, B., & Wei, Q. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2020.3042876 · Cited by 708
Tong, S., Sun, K., & Sui, S. (2018) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2017.2686373 · Cited by 551
Adaptive Dynamic Programming and Adaptive Optimal Output Regulation of Linear Systems
Gao, W., & Jiang, Z.-P. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2548662 · Cited by 413
Self-citationAdaptive Critic Nonlinear Robust Control: A Survey
Wang, D., He, H., & Liu, D. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2712188 · Cited by 374
Wei, Q., Song, R., & Yan, P. (2016) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2464080 · Cited by 252
Gao, W., Jiang, Y., Jiang, Z.-P., & Chai, T. (2016) · Automatica · doi:10.1016/j.automatica.2016.05.008 · Cited by 234
“Our future work includes extensions to a broader class of nonlinear systems (Bian, Jiang, & Jiang, 2014; Jiang & Jiang, 2014, 2015) and applications to intelligent transportation systems (Gao, Jiang, & Ozbay, 2015; Liu, Lu, & Jiang, 2016).”
Self-citationPolicy Gradient Adaptive Dynamic Programming for Data-Based Optimal Control
Luo, B., Liu, D., Wu, H.-N., Wang, D., & Lewis, F. L. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2623859 · Cited by 222
Discrete-Time Deterministic $Q$ -Learning: A Novel Convergence Analysis
Wei, Q., Lewis, F. L., Sun, Q., Yan, P., & Song, R. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2542923 · Cited by 200
Learning-Based Adaptive Optimal Tracking Control of Strict-Feedback Nonlinear Systems
Gao, W., & Jiang, Z.-P. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2761718 · Cited by 176
Self-citationDiscrete-Time Local Value Iteration Adaptive Dynamic Programming: Convergence Analysis
Wei, Q., Lewis, F. L., Liu, D., Song, R., & Lin, H. (2018) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2016.2623766 · Cited by 173
“For traditional iterative ADP algorithms [23], [44], [45], [50], [51], to guarantee that the algorithm terminates within finite iterations, the following convergence criterion:”
Metadata
- Authors
- Jiang, Y., & Jiang, Z.-P.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2015-11
- Volume
- 60
- Issue
- 11
- Pages
- 2917-2929
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2073591687
- Cited by
- 241
- References
- 2
- FWCI
- 21.63
- 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.