GrDHP: A general utility function representation for dual heuristic dynamic programming
Document Type
Article
Date of Original Version
3-1-2015
Abstract
A general utility function representation is proposed to provide the required derivable and adjustable utility function for the dual heuristic dynamic programming (DHP) design. Goal representation DHP (GrDHP) is presented with a goal network being on top of the traditional DHP design. This goal network provides a general mapping between the system states and the derivatives of the utility function. With this proposed architecture, we can obtain the required derivatives of the utility function directly from the goal network. In addition, instead of a fixed predefined utility function in literature, we conduct an online learning process for the goal network so that the derivatives of the utility function can be adaptively tuned over time. We provide the control performance of both the proposed GrDHP and the traditional DHP approaches under the same environment and parameter settings. The statistical simulation results and the snapshot of the system variables are presented to demonstrate the improved learning and controlling performance. We also apply both approaches to a power system example to further demonstrate the control capabilities of the GrDHP approach.
Publication Title, e.g., Journal
IEEE Transactions on Neural Networks and Learning Systems
Volume
26
Issue
3
Citation/Publisher Attribution
Ni, Zhen, Haibo He, Dongbin Zhao, Xin Xu, and Danil V. Prokhorov. "GrDHP: A general utility function representation for dual heuristic dynamic programming." IEEE Transactions on Neural Networks and Learning Systems 26, 3 (2015): 614-627. doi: 10.1109/TNNLS.2014.2329942.