>
    当前位置:首页>科研成果
论文编号:
第一作者所在部门:
中文论文题目: Multi-step heuristic dynamic programming for optimal control of nonlinear discrete-time systems
英文论文题目: Multi-step heuristic dynamic programming for optimal control of nonlinear discrete-time systems
论文题目英文:
作者: Luo, Biao
论文出处:
刊物名称: INFORMATION SCIENCES
年: 2017
卷: 411
期:
页: 66-83
联系作者:
收录类别:
影响因子:
摘要: Policy iteration and value iteration are two main iterative adaptive dynamic programming frameworks for solving optimal control problems. Policy iteration converges fast while requiring an initial stabilizing control policy, which is a strict constraint in practice. Value iteration avoids the requirement of initial admissible control policy while converging much slowly. This paper tries to utilize the advantages of policy iteration and value iteration, and avoids their drawbacks at the same time. Therefore, a multi-step heuristic dynamic programming (MsHDP) method is developed for solving the optimal control problem of nonlinear discrete-time systems. MsHDP speeds up value iteration and avoids the requirement of initial admissible control policy in policy iteration at the same time. The convergence theory of MsHDP is established by proving that it converges to the solution of the Bellman equation. For implementation purpose, the actor-critic neural network (NN) structure is developed. The critic NN is employed to estimate the value function and its NN weight vector is computed with a least-square scheme. The actor NN is used to estimate the control policy and a gradient descent method is proposed for updating its NN weight vector. According to the comparative simulation studies on two examples, the effectiveness and advantages of MsHDP are verified. (C) 2017 Elsevier Inc. All rights reserved.
英文摘要:
外单位作者单位:
备注:

关闭窗口