Abstract
In this paper, based on the Hamiltonian, an alternative interpretation about the iterative adaptive dynamic programming (ADP) approach from the perspective of optimization is developed for discrete time nonlinear dynamic systems. The role of the Hamiltonian in iterative ADP is explained. The resulting Hamiltonian driven ADP is able to evaluate the performance with respect to arbitrary admissible policies, compare two different admissible policies and further improve the given admissible policy. The convergence of the Hamiltonian ADP to the optimal policy is proven. Implementation of the Hamiltonian-driven ADP by neural networks is discussed based on the assumption that each iterative policy and value function can be updated exactly. Finally, a simulation is conducted to verify the effectiveness of the presented Hamiltonian-driven ADP.
| Original language | American English |
|---|---|
| Journal | Proceedings of the 2017 International Joint Conference on Neural Networks (2017, Anchorage, AK) |
| DOIs | |
| State | Published - May 1 2017 |
Keywords
- Adaptive dynamic programming
- Discrete time
- Dynamic programming
- Dynamical systems
- Hamiltonians
- Nonlinear discrete-time
- Nonlinear dynamical systems
- Optimal policies
- Value functions
Disciplines
- Electrical and Computer Engineering
Fingerprint
Dive into the research topics of 'Hamiltonian-Driven Adaptive Dynamic Programming for Nonlinear Discrete-Time Dynamic Systems'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS