Finite approximation error-based value iteration ADP

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, iterative adaptive dynamic programming (ADP) algorithms are developed to solve optimal control problems for infinite horizon discrete-time nonlinear systems with finite approximation errors. idea is to use iterative ADP algorithms to obtain the iterative control laws that guarantee the iterative value functions to reach the optimums. Then, the numerical optimal control problems are solved by an adaptive learning control scheme based on ADP algorithm. Stability properties of the system under the numerical iterative controls are proved which allow the present iterative ADP algorithm to be implemented both online and offline. Moreover, a general value iteration (GVI) algorithm with finite approximation errors is developed to guarantee the iterative value function to converge to the solution of the Bellman equation. The GVI algorithm permits an arbitrary positive semidefinite function to initialize it, which overcomes the disadvantage of traditional value iteration algorithms. Simulation examples are also included to demonstrate the effectiveness of the present control strategies.

Cite

CITATION STYLE

APA

Liu, D., Wei, Q., Wang, D., Yang, X., & Li, H. (2017). Finite approximation error-based value iteration ADP. In Advances in Industrial Control (pp. 91–149). Springer International Publishing. https://doi.org/10.1007/978-3-319-50815-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free