Adaptive critic design with graph Laplacian for online learning control of nonlinear systems
Lists
Only you see this
Abstract
SUMMARY In recent years, reinforcement learning (RL) and approximate dynamic programming (ADP) have been widely studied in the community of artificial intelligence and machine learning. As an important class of RL and ADP methods, adaptive critic designs (ACDs) with function approximation have been studied to realize online learning control of nonlinear dynamical systems. However, how to construct efficient feature representations for approximating value functions or policies is still a difficult problem. In this paper, ACDs with graph Laplacian (GL) are proposed by integrating manifold learning methods into feature representations of ACDs. An online learning control algorithm called graph Laplacian dual heuristic programming (GL‐DHP) is presented, and its performance is analyzed both theoretically and empirically. Because of the nonlinear approximation ability of feature representation with GL, the GL‐DHP method has much better performance than previous DHP methods with manually designed neural networks. Simulation results on learning control of a ball and plate system, which is a typical nonlinear dynamical system with continuous state and action spaces, demonstrate the effectiveness of the GL‐DHP method. Copyright © 2012 John Wiley & Sons, Ltd.
BibTeX
@article{lian2012adaptive,
author = {Chuanqiang Lian and Xin Xu and Lei Zuo and Zhenhua Huang},
title = {{Adaptive critic design with graph Laplacian for online learning control of nonlinear systems}},
journal = {International Journal of Adaptive Control and Signal Processing},
year = {2012},
doi = {10.1002/acs.2344},
}Loading related content...