Stability Analysis of Optimal Adaptive Control using Value Iteration with Approximation Errors
Author:
Preprint
Abstract
Adaptive optimal control using value iteration initiated from a stabilizing control policy is theoretically analyzed in terms of stability of the system during the learning stage without ignoring the effects of approximation errors. This analysis includes the system operated using any single/constant resulting control policy and also using an evolving/time-varying control policy. A feature of the presented results is providing estimations of the \textit{region of attraction} so that if the initial condition is within the region, the whole trajectory will remain inside it and hence, the function approximation results remain valid.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Model-Free Optimal Tracking Control via Critic-Only Q-LearningIEEE Transactions on Neural Networks and Learning Systems, 2016
- Theoretical and Numerical Analysis of Approximate Dynamic Programming with Approximation ErrorsJournal of Guidance, Control, and Dynamics, 2016
- Value Iteration Adaptive Dynamic Programming for Optimal Control of Discrete-Time Nonlinear SystemsIEEE Transactions on Cybernetics, 2015
- Convergence Proof of Approximate Policy Iteration for Undiscounted Optimal Control of Discrete-Time SystemsCognitive Computation, 2015
- Revisiting Approximate Dynamic Programming and its ConvergenceIEEE Transactions on Cybernetics, 2014
- Finite-Approximation-Error-Based Optimal Control Approach for Discrete-Time Nonlinear SystemsIEEE Transactions on Cybernetics, 2013
- Discrete-Time Nonlinear HJB Solution Using Approximate Dynamic Programming: Convergence ProofIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2008
- Relaxing Dynamic ProgrammingIEEE Transactions on Automatic Control, 2006
- Multilayer feedforward networks are universal approximatorsNeural Networks, 1989