Local policy iteration adaptive dynamic programming for discrete-time nonlinear systems

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

Abstract

Adaptive dynamic programming is a hot research topic nowadays. Therefore, the paper concerns a new local policy adaptive iterative dynamic programming (ADP) algorithm. Moreover, this algorithm is designed for the discrete-time nonlinear systems, which are used to solve problems concerning infinite horizon optimal control. The new local policy iteration ADP algorithm has the characteristics of updating the iterative control law and value function within one subset of the state space. Morevover, detailed iteration process of the local policy iteration is presented thereafter. The simulation example is listed to show the good performance of the newly developed algorithm.

Cite

CITATION STYLE

APA

Wei, Q., Xu, Y., Lin, Q., Liu, D., & Song, R. (2017). Local policy iteration adaptive dynamic programming for discrete-time nonlinear systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10262 LNCS, pp. 148–153). Springer Verlag. https://doi.org/10.1007/978-3-319-59081-3_18

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