Rosenfeld Joel A, Kamalapurkar Rushikesh, Dixon Warren E
IEEE Trans Neural Netw Learn Syst. 2019 Jun;30(6):1716-1730. doi: 10.1109/TNNLS.2018.2870040. Epub 2018 Oct 25.
A function approximation method is developed which aims to approximate a function in a small neighborhood of a state that travels within a compact set. The method provides a novel approximation strategy for the efficient approximation of nonlinear functions for real-time simulations and experiments. The development is based on the theory of universal reproducing kernel Hilbert spaces over the n -dimensional Euclidean space. Several theorems are introduced which support the development of this state following (StaF) method. In particular, it is shown that there is a bound on the number of kernel functions required for the maintenance of an accurate function approximation as a state moves through a compact set. In addition, a weight update law, based on gradient descent, is introduced where arbitrarily close accuracy can be achieved provided the weight update law is iterated at a sufficient frequency, as detailed in Theorem 4. An experience-based approximation method is presented which utilizes the samples of the estimations of the ideal weights to generate a global approximation of a function. The experience-based approximation interpolates the samples of the weight estimates using radial basis functions. To illustrate the StaF method, the method is utilized for derivative estimation, function approximation, and is applied to an adaptive dynamic programming problem where it is demonstrated that the stability is maintained with a reduced number of basis functions.
开发了一种函数逼近方法,其目的是在紧凑集内移动的状态的小邻域内逼近函数。该方法为实时模拟和实验中非线性函数的高效逼近提供了一种新颖的逼近策略。该方法的开发基于n维欧几里得空间上的通用再生核希尔伯特空间理论。引入了几个定理来支持这种状态跟踪(StaF)方法的开发。特别地,表明当状态在紧凑集内移动时,维持精确函数逼近所需的核函数数量存在一个界限。此外,引入了一种基于梯度下降的权重更新法则,如定理4中所详述,只要权重更新法则以足够高的频率迭代,就可以实现任意接近的精度。提出了一种基于经验的逼近方法,该方法利用理想权重估计的样本生成函数的全局逼近。基于经验的逼近使用径向基函数对权重估计的样本进行插值。为了说明StaF方法,该方法被用于导数估计、函数逼近,并应用于一个自适应动态规划问题,结果表明在减少基函数数量的情况下仍能保持稳定性。