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

Adaptive and optimal output feedback control of linear systems: An adaptive dynamic programming approach

Weinan Gao, Jiang, Yu, Jiang, Zhong-Ping, Tianyou Chai·2014·Proceeding of the 11th World Congress on Intelligent Control and Automation

Abstract

This paper proposes a computational adaptive optimal output feedback control method for continuous-time linear systems. By periodic sampling, we use measurable input/output data to reconstruct the unmeasurable state, and then utilize adaptive dynamic programming (ADP) technique to iteratively solve the discrete-time algebraic Riccati equation. An exploration noise is introduced for online learning purpose without compromising accuracy of the proposed iterative algorithm. The stability and the optimality of the sampled-data system in close-loop with the proposed control policy are also analyzed. The feasibility of the output feedback ADP scheme is validated by simulation on a third-order linear system.

Integrity signals

Registry

Crossref · 10.1109/wcica.2014.7053043

Cites

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?

  • The convergence of the online learning control using output feedback is guaranteed under the rank condition stated in Lemma 3.3.

    “The convergence of the online learning control using output feedback is guaranteed under the rank condition stated in the form of Lemma 3.3 [47].”
  • If the condition of Lemma 3.3 is fulfilled, with some initial stabilizing feedback gain matrix K0, then the sequences {Pj} and {Kj} received from this algorithm converge to their optimal values P and K, respectively.

    “Theorem 3.4. If the condition of Lemma 3.3 is fulfilled, with some initial stabilizing feedback gain matrix K 0 , then the sequences n Pj o 1 j = 0 and n Kj o 1 j = 0 received from this algorithm, converge to their optimal values P and K , respectively [46, 47].”

No citation lists for this paper

No citation lists for this paper yet — checked again daily.

References 21 · Cited by 35

Authors
Gao, W., Jiang, Y., Jiang, Z.-P., & Chai, T.
Affiliations
  • New York University (US)
  • State Key Laboratory of Synthetical Automation for Process Industries (CN)
Venue
Proceeding of the 11th World Congress on Intelligent Control and Automation
Publisher
IEEE
Published
2014-06
Pages
2085-2090
OpenAlex
W2058627792
Cited by
35
References
21
Citations by year
2026: 1 · 2025: 1 · 2024: 3 · 2023: 5 · 2022: 2 · 2021: 5 · 2020: 3 · 2019: 4 · 2018: 1 · 2016: 6 · 2015: 3 · 2014: 1
FWCI
2.80
Type
conference paper
Language
en
Open access
closed
Locations
World Congress on Intelligent Control and Automation (publishedVersion)
Funders
Division of Electrical, Communications and Cyber Systems
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 optimal control, output feedback control, linear systems, adaptive dynamic programming, state reconstruction, periodic sampling, discrete-time algebraic Riccati equation, exploration noise, online learning, closed-loop stability, continuous-time systems

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