Approximate dynamic programming for continuous-time linear quadratic regulator problems: Relaxation of known input-coupling matrix assumption

J. Y. Lee, J. B. Park, Y. H. Choi

Research output: Contribution to journalArticle

11 Citations (Scopus)


This study proposes an approximate dynamic programming (ADP) scheme which solves approximately the continuous-time (CT) infinite horizon, linear quadratic (LQ) optimal control problems (OCPs) online for CT linear time-invariant (LTI) systems whose model is not exactly given a priori. In order to relax the assumption of the perfectly known input-coupling matrix, a cheap OCP consisting of a dynamic controller and a modified quadratic performance index is formulated from the conventional LQ OCP. Then, the CT ADP technique based on policy iteration is embedded in the controller as an adaptive element for iteratively solving this cheap OCP in online fashion. By solving the cheap OCP, the near-optimal solution of the original LQ OCP can be obtained, which is proven in this study. The proposed scheme guarantees the stability and convergence to a near-optimal solution, and does not require the knowledge regarding system dynamics during the iterations. Finally, the simulation results are provided to verify the applicability and effectiveness of the proposed control scheme.

Original languageEnglish
Pages (from-to)2063-2075
Number of pages13
JournalIET Control Theory and Applications
Issue number13
Publication statusPublished - 2012 Sep 6


All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Human-Computer Interaction
  • Computer Science Applications
  • Control and Optimization
  • Electrical and Electronic Engineering

Cite this