Cited by 677Adaptive Dynamic Programming ControlAdvanced Control Systems OptimizationReinforcement Learning in Robotics

Adaptive dynamic programming

Murray, J.J., Cox, C.J., Lendaris, G.G., Saeks, R.·2002·IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)

Abstract

Unlike the many soft computing applications where it suffices to achieve a "good approximation most of the time," a control system must be stable all of the time. As such, if one desires to learn a control law in real-time, a fusion of soft computing techniques to learn the appropriate control law with hard computing techniques to maintain the stability constraint and guarantee convergence is required. The objective of the paper is to describe an adaptive dynamic programming algorithm (ADPA) which fuses soft computing techniques to learn the optimal cost (or return) functional for a stabilizable nonlinear system with unknown dynamics and hard computing techniques to verify the stability and convergence of the algorithm. Specifically, the algorithm is initialized with a (stabilizing) cost functional and the system is run with the corresponding control law (defined by the Hamilton-Jacobi-Bellman equation), with the resultant state trajectories used to update the cost functional in a soft computing mode. Hard computing techniques are then used to show that this process is globally convergent with stepwise stability to the optimal cost functional/control law pair for an (unknown) input affine system with an input quadratic performance measure (modulo the appropriate technical conditions). Three specific implementations of the ADPA are developed for 1) the linear case, 2) for the nonlinear case using a locally quadratic approximation to the cost functional, and 3) the nonlinear case using a radial basis function approximation of the cost functional; illustrated by applications to flight control.

Integrity signals

Registry

Crossref · 10.1109/tsmcc.2002.801727

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • ADP is an effective way to achieve high performance of the optimal controller and relies on adaptive control, optimal control and reinforcement learning.

    “Adaptive dynamic programming (ADP) ensures an e ective way to achieve high performance of the optimal controller which relies on adaptive control, optimal control and reinforcement learning [9, 23-26].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Murray, J. J., Cox, C. J., Lendaris, G. G., & Saeks, R.
Affiliations
  • Stony Brook University (US)
  • Accurate Automation (United States) (US)
  • Portland State University (US)
Venue
IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
Published
2002-05
Volume
32
Issue
2
Pages
140-153
ISSN
1094-6977 (ISSN-L)
OpenAlex
W2160561608
Cited by
677
References
32
Citations by year
2026: 16 · 2025: 36 · 2024: 31 · 2023: 26 · 2022: 34 · 2021: 34 · 2020: 39 · 2019: 28 · 2018: 27 · 2017: 42 · 2016: 36 · 2015: 40 · 2014: 42 · 2013: 43 · 2012: 45
FWCI
4.99
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) (publishedVersion)
  • PDXScholar (Portland State University) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Adaptive Dynamic Programming Control
  • Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
Keywords
adaptive dynamic programming, optimal control, Hamilton-Jacobi-Bellman equation, stability analysis, convergence analysis, unknown dynamics, nonlinear systems, input-affine systems, radial basis function approximation, flight control, soft computing

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