首页> 外文学位 >On-line radial basis function network center adaptation for nonlinear adaptive identification and control.
【24h】

On-line radial basis function network center adaptation for nonlinear adaptive identification and control.

机译:在线径向基函数网络中心自适应,用于非线性自适应识别和控制。

获取原文
获取原文并翻译 | 示例

摘要

Nonlinear adaptive identification and control are difficult to solve problems which are now being solved by the application of neural networks. Neural networks provide a solid framework for attacking these problems as they are described by adjustable parameters which are readily adaptable on-line and they are universal function approximators. Radial basis function networks have been shown to be functional in these systems especially when one attempts to consider the analytical proof of stability. Most algorithms developed for radial basis function networks for these applications consider only on-line adaptation of the output layer weights alone. This dissertation describes and demonstrates two novel algorithms which adapt the radial basis function center parameters as well as the output layer weights on-line. The first algorithm simply translates the initially chosen center lattice within the network input space. This algorithm is also shown to be equivalent to a recurrent radial basis function network. Using this algorithm results in faster learning of the output layer weights. The second algorithm described is a discrete-time algorithm that moves the centers to new locations within the network input space. Use of this algorithm reduces the amount of required a priori information about the functions to be approximated. Heuristic and analytical stability results are provided along with simulation examples which show the potential for these algorithms.
机译:非线性自适应识别和控制很难解决目前通过神经网络解决的问题。神经网络为解决这些问题提供了坚实的框架,因为它们由可在线自适应的可调参数描述,并且它们是通用函数逼近器。径向基函数网络已被证明在这些系统中起作用,特别是当人们试图考虑稳定性的分析证明时。针对这些应用针对径向基函数网络开发的大多数算法仅考虑对输出层权重进行在线调整。本文描述并演示了两种新颖的算法,它们可以自适应调整径向基函数中心参数以及在线输出层权重。第一种算法只是在网络输入空间内平移最初选择的中心晶格。该算法还显示等效于递归径向基函数网络。使用此算法可以更快地学习输出层权重。所描述的第二种算法是离散时间算法,可将中心移动到网络输入空间内的新位置。此算法的使用减少了有关要近似的函数的先验信息量。提供了启发式和分析性稳定性结果以及仿真示例,这些示例说明了这些算法的潜力。

著录项

  • 作者

    Chan, Alistair Keating.;

  • 作者单位

    University of Cincinnati.;

  • 授予单位 University of Cincinnati.;
  • 学科 Engineering Aerospace.;Artificial Intelligence.;Engineering System Science.;Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 1995
  • 页码 172 p.
  • 总页数 172
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号