A Radial Basis Function Implementation of the Adaptive Dynamic Programming Algorithm
Midwest Symposium on Circuits and Systems
Adaptive Dynamic Programming constitutes a potentially powerful approach to optimal control. An approximation to the Bellman cost functional is updated in real time. The technique is applicable to a broad class of nonlinear networks with unknown dynamics and is guaranteed to converge to the optimal control with stepwise stability. The goal of this paper is to describe an implementation of the Adaptive Dynamic Programming Algorithm in which a radial basis function is used to define the approximate cost functional, which is updated locally in the neighborhood of the state trajectory each time the system is run. An application of the algorithm to a nonlinear flight control problem with unknown aircraft dynamics is presented.
Locate the Document
Lendaris, G., Cox, C., Saeks, R., & Murray, J. (2002, August). A radial basis function implementation of the adaptive dynamic programming algorithm. In The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002. (Vol. 2, pp. II-II). IEEE.