Online policy iteration based algorithms to solve the continuous-time infinite horizon optimal control problem
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
In this paper we discuss two online algorithms based on policy iterations for learning the continuous-time (CT) optimal control solution when nonlinear systems with infinite horizon quadratic cost are considered. For the first time we present an online adaptive algorithm implemented on an actor/critic structure which involves synchronous continuous-time adaptation of both actor and critic neural networks. This is a version of generalized policy iteration for CT systems. The convergence to the optimal controller based on the novel algorithm is proven while stability of the system is guaranteed. The characteristics and requirements of the new online learning algorithm are discussed in relation with the regular online policy iteration algorithm for CT systems which we have previously developed. The latter solves the optimal control problem by performing sequential updates on the actor and critic networks, i.e. while one is learning the other one is held constant. In contrast, the new algorithm relies on simultaneous adaptation of both actor and critic networks. To support the new theoretical result a simulation example is then considered.
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
Murray, 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 by
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
“, [2], [7], [24], [28], [33], [35]–[37], and [41]).”
Self-citationVamvoudakis, K. G., & Lewis, F. L. (2011) · Automatica · doi:10.1016/j.automatica.2011.03.005 · Cited by 525
“Online reinforcement learning techniques have been developed for continuous-time systems in Vamvoudakis, Vrabie, and Lewis (2009), Vrabie, Pastra-vanu, Lewis, and Abu-Khalaf (2009) and Vrabie, Vamvoudakis, and Lewis (2009).”
MethodSelf-citationReinforcement learning-based optimal tracking control of an unknown unmanned surface vehicle
Wang, N., Gao, Y., Zhao, H., & Ahn, C. K. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.3009214 · Cited by 322
“Within this trend, using actor–critic NN structures that involve synchronous continuous-time adaptive laws, policy iteration-based control schemes [36], [37] have been implemented.”
Data-Driven Performance-Prescribed Reinforcement Learning Control of an Unmanned Surface Vehicle
Wang, N., Gao, Y., & Zhang, X. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3056444 · Cited by 282
Metadata
- Authors
- Vamvoudakis, K., Vrabie, D., & Lewis, F.
- Venue
- 2009 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning
- Publisher
- IEEE
- Published
- 2009-03
- Pages
- 36-41
- OpenAlex
- W2145956080
- Cited by
- 45
- References
- 1
- FWCI
- 1.44
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Online policy iteration based algorithms to solve the continuous-time infinite horizon optimal control problem. https://app.cochat.ai/papers/10.1109/adprl.2009.4927523
- The paper
- Vamvoudakis, K., Vrabie, D., & Lewis, F. (2009). Online policy iteration based algorithms to solve the continuous-time infinite horizon optimal control problem. 2009 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning. https://doi.org/10.1109/adprl.2009.4927523
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.