Convergence analysis for an identifier-based adaptive dynamic programming algorithm

This paper investigates the uniformly ultimate boundedness (UUB) of an identifier-based adaptive dynamic programming (ADP) algorithm proposed in [7]. It is demonstrated that the estimation errors of weights in both critic and action networks are UUB during iteration learning. Moreover, a selection method on learning rates is also given.