|
|
Approximation-error-ADP-based optimal tracking control for chaotic systems with convergence proof |
Song Rui-Zhuo (宋睿卓)a, Xiao Wen-Dong (肖文栋)a, Sun Chang-Yin (孙长银)a, Wei Qing-Lai (魏庆来)b |
a School of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing 100083, China;
b The State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China |
|
|
Abstract In this paper, an optimal tracking control scheme is proposed for a class of discrete-time chaotic systems using the approximation-error-based adaptive dynamic programming (ADP) algorithm. Via the system transformation, the optimal tracking problem is transformed into an optimal regulation problem, and then the novel optimal tracking control method is proposed. It is shown that for the iterative ADP algorithm with finite approximation error, the iterative performance index functions can converge to a finite neighborhood of the greatest lower bound of all performance index functions under some convergence conditions. Two examples are given to demonstrate the validity of the proposed optimal tracking control scheme for chaotic systems.
|
Received: 06 December 2012
Revised: 25 March 2013
Accepted manuscript online:
|
PACS:
|
05.45.Gg
|
(Control of chaos, applications of chaos)
|
|
Fund: Project supported by the Open Research Project from SKLMCCS (Grant No. 20120106), the Fundamental Research Funds for the Central Universities of China (Grant No. FRF-TP-13-018A), the Postdoctoral Science Foundation of China (Grant No. 2013M530527), and the National Natural Science Foundation of China (Grant Nos. 61304079, 61125306, and 61034002). |
Corresponding Authors:
Song Rui-Zhuo
E-mail: ruizhuosong@163.com
|
Cite this article:
Song Rui-Zhuo (宋睿卓), Xiao Wen-Dong (肖文栋), Sun Chang-Yin (孙长银), Wei Qing-Lai (魏庆来) Approximation-error-ADP-based optimal tracking control for chaotic systems with convergence proof 2013 Chin. Phys. B 22 090502
|
[1] |
Balakrishnan S and Biega V 1996 J. Guid. Control Dynam. 19 893
|
[2] |
Chen S and Lu J 2002 Chaos Soliton. Fract. 14 643
|
[3] |
Enns R and Si J 2003 IEEE Tran. Neural Netw. 14 929
|
[4] |
Héno M 1976 Commun. Math. Phys. 50 69
|
[5] |
Lewis F and Vrabie D 2009 IEEE Circ. Syst. Mag. 9 32
|
[6] |
Liu D and Wei Q 2012 IEEE Tran. Syst. Man Cyber. B 43 779
|
[7] |
Lu J, Wu X, Lü J and Kang L 2004 Chaos Soliton. Fract. 22 311
|
[8] |
Ma T and Fu J 2011 Chin. Phys. B 20 050511
|
[9] |
Ma T, Fu J and Sun Y 2010 Chin. Phys. B 19 090502
|
[10] |
Ma T, Zhang H and Fu J 2008 Chin. Phys. B 17 4407
|
[11] |
Murray J, Cox C, Lendaris G and Saeks R 2002 IEEE Tran. Syst. Man Cyber. B 32 140
|
[12] |
Si J and Wang Y 2001 IEEE Tran. Neural Netw. 12 264
|
[13] |
Vamvoudakis K and Lewis F 2010 Automatica 46 878
|
[14] |
Wang F, Jin N, Liu D and Wei Q 2011 IEEE Tran. Neural Netw. 22 24
|
[15] |
Wang F, Zhang H and Liu D 2009 IEEE Computational Intelligence Magazine 4 39
|
[16] |
Werbos P 1991 Neural Network Control (edited by Miller W T, Sutton R S and Werbos P J) (Cambridge: MIT Press) pp. 67-95
|
[17] |
Werbos P 1992 Approximate Dynamic Programming for Real-Time Control and Neural Modelingin Handbook of Intelligent Control: Neural, Fuzzy and Adaptive Approaches (edited by White D A and Sofge D A) (New York: Van Nostrand Reinhold) ch. 13
|
[18] |
Zhang H, Cui L, Zhang X and Luo Y 2011 IEEE Tran. Neural Netw. 22 2226
|
[19] |
Zhang H, Huang W, Wang Z and Chai T 2006 Phys. Lett. A 350 363
|
[20] |
Zhang H, Ma T, Fu J and Tong S 2009 Chin. Phys. B 18 3751
|
[21] |
Zhang H, Song R, Wei Q and Zhang T 2011 IEEE Tran. Neural Netw. 22 1851
|
[22] |
Zhang H, Wang Z and Liu D 2004 Int. J. Bifur. Chaos 14 1
|
[23] |
Zhang H, Wei Q and Liu D 2011 Automatica 47 207
|
[24] |
Zhang H, Wei Q and Luo Y 2008 IEEE Tran. Syst. Man Cyber. B 38 937
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|