Journal of Guangdong University of Technology ›› 2017, Vol. 34 ›› Issue (06): 15-19.doi: 10.12052/gdutxb.170082

Previous Articles     Next Articles

A Cooperative Optimization Algorithm Based on Adaptive Dynamic Programming

Liu Yi, Zhang Yun   

  1. School of Automation, Guangdong University of Technology, Guangzhou 510006, China
  • Received:2017-04-11 Online:2017-11-09 Published:2017-11-22

Abstract: If the initial iterative performance index function is a positive semi-definite function, then the value iteration of adaptive dynamic programming will converge to the optimal. This is the convergence condition of value-iteration based adaptive dynamic programming. Based on the condition, the initializing and updating methods for iterative performance index function is studied and a cooperative optimization algorithm based on adaptive dynamic programming is proposed. The simulation results show that the proposed algorithm can rapidly reduce the iteration residuals and greatly improve the convergence rate of adaptive dynamic programming.

Key words: adaptive dynamic programming, value iteration, cooperative optimization

CLC Number: 

  • TP273
[1] Yuan Jun, Zhang Yun, Zhang Gui-dong, Li Zhong, Chen Zhe, Yu Sheng-long. A Survey of Energy Management System Based on Adaptive Dynamic Programming [J]. Journal of Guangdong University of Technology, 2022, 39(05): 21-28.
[2] Chen Ci, Xie Li-hua. A Data-Driven Prescribed Convergence Rate Design for Robust Tracking of Discrete-Time Systems [J]. Journal of Guangdong University of Technology, 2021, 38(06): 29-34.
[3] Liu Yi, Zhang Yun. Convergence Condition of Value-iteration Based Adaptive Dynamic Programming [J]. Journal of Guangdong University of Technology, 2017, 34(05): 10-14.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!