计算机应用 ›› 2018, Vol. 38 ›› Issue (9): 2455-2458.DOI: 10.11772/j.issn.1001-9081.2018020439

• 人工智能 • 上一篇    下一篇

正则系统在Lebesgue-p范数意义下的快速迭代学习控制

曹伟1, 李艳东1, 王妍玮2   

  1. 1. 齐齐哈尔大学 计算机与控制工程学院, 黑龙江 齐齐哈尔 161006;
    2. 哈尔滨石油学院 机械工程学院, 哈尔滨 150027
  • 收稿日期:2018-03-09 修回日期:2018-04-01 出版日期:2018-09-10 发布日期:2018-09-06
  • 通讯作者: 曹伟
  • 作者简介:曹伟(1977—),男,吉林白城人,副教授,博士,主要研究方向:迭代学习控制、滑模控制;李艳东(1978—),男,黑龙江呼兰人,副教授,博士,主要研究方向:移动机器人控制、智能控制;王妍玮(1982—),女,黑龙江哈尔滨人,教授,博士,主要研究方向:模式识别、图像处理。
  • 基金资助:
    国家自然科学基金面上项目(61672304);黑龙江省自然科学基金面上项目(F2015025);齐齐哈尔市科学技术工业攻关项目(GYGG-201620)。

Fast iterative learning control for regular system in sense of Lebesgue-p norm

CAO Wei1, LI Yandong1, WANG Yanwei2   

  1. 1. College of Computer and Control Engineering, Qiqihar University, Qiqihar Heilongjiang 161006, China;
    2. School of Mechnical Engineering, Harbin Institute of Petroleum, Harbin Heilongjiang 150027, China
  • Received:2018-03-09 Revised:2018-04-01 Online:2018-09-10 Published:2018-09-06
  • Contact: 曹伟
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (61672304), the Natural Science Foundation of Heilongjiang Province (F2015025), the Qiqihar Science and Technology Industrial Project (GYGG-201620).

摘要: 针对一类线性正则系统,传统迭代学习控制算法收敛速度较低的问题,设计了一种快速迭代学习控制算法。该算法在传统P型迭代学习控制算法基础上,增加了由相邻两次迭代时跟踪误差构成的上一次差分信号和当前差分信号,并在Lebesgue-p范数度量意义下,利用卷积推广的Young不等式严格证明了,当迭代次数趋于无穷大时,系统的跟踪误差收敛于零,并给出了算法的收敛条件。该算法与传统P型迭代学习控制算法相比,不仅提高了收敛速度,而且还避免了采用λ范数度量跟踪误差的缺陷,最后通过仿真结果进一步验证了所提算法的有效性。

关键词: 正则系统, 迭代学习控制, Lebesgue-p范数, Young不等式, 跟踪误差

Abstract: Focused on the problem that the convergence speed of traditional iterative learning control algorithm used in linear regular systems is slow, a kind of fast iterative learning control algorithm was designed for a class of linear regular systems. Compared with the traditional P-type iterative learning control algorithm, the algorithm increases tracking error at neighboring two iterations generated from last difference signal and present difference signal. And the convergence of the algorithm was proven by using Yong inequality of convolutional inference in the sense of Lebesgue-p norm. The results show the tracking error of the system will converge to zero with infinite iterations. The convergence condition is also given. Compared with P-type iterative learning control, the proposed algorithm can fasten the convergence and avoid the shortcomings of using λ norm to measure the tracking error. Simulation further testifies the validity and effectiveness.

Key words: regular system, iterative learning control, Lebesgue-p norm, Young inequality, tracking error

中图分类号: