Adaptive optimal observer design via approximate dynamic programming

Jing Na, Guido Herrmann, Kyriakos Vamvoudakis

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

3 Citations (Scopus)
446 Downloads (Pure)

Abstract

This paper presents an optimal observer design framework using a recently emerging method, approximate dynamic programming (ADP), to minimize a predefined cost function. We first exploit the duality between the linear optimal observer and the linear quadratic tracking (LQT) control. We show that the optimal observer design can be formulated as an optimal control problem subject to a specific cost function, and thus the solution can be obtained by solving an algebraic Riccati equation (ARE). For nonlinear systems, we further introduce an optimal observer design formulation and suggest a modified policy iteration method. Finally, to solve the problem online we propose a framework based on ADP and specifically on an approximator structure. Namely, a critic approximator is used to estimate the optimal value function, and a newly developed tuning law is proposed to find the parameters online. The stability and the performance are guaranteed with rigorous proofs. Numerical simulations are given to validate the theoretical studies.
Original languageEnglish
Title of host publication2017 American Control Conference, Seattle, USA: 24-26 May 2017
Subtitle of host publicationProceedings of a meeting held 24-26 May 2017, Seattle, Washington, USA
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages3288-3293
Number of pages6
ISBN (Electronic)9781509059928
ISBN (Print)9781509045839
DOIs
Publication statusPublished - Aug 2017

Publication series

Name
ISSN (Print)2378-5861

Keywords

  • Optimal observer design
  • Approximate dynamic programming
  • ADP
  • Policy iteration

Fingerprint Dive into the research topics of 'Adaptive optimal observer design via approximate dynamic programming'. Together they form a unique fingerprint.

Cite this