引用本文:陈引娟,宁小刚,魏永东,李宗刚.切换拓扑下测量受限多智能体系统一致性迭代学习控制[J].控制理论与应用,2023,40(8):1384~1394.[点击复制]
CHEN Yin-juan,NING Xiao-gang,WEI Yong-dong,LI Zong-gang.Iterative learning control for consensus of measurement-constrained multi-agent systems under switching topology[J].Control Theory and Technology,2023,40(8):1384~1394.[点击复制]
切换拓扑下测量受限多智能体系统一致性迭代学习控制
Iterative learning control for consensus of measurement-constrained multi-agent systems under switching topology
摘要点击 2698  全文点击 288  投稿时间:2022-06-11  修订日期:2023-08-25
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  10.7641/CTA.2023.20515
  2023,40(8):1384-1394
中文关键词  多智能体系统  输出一致性  测量受限  迭代学习控制  切换拓扑
英文关键词  multi-agent systems  output consensus  measurement constraint  iterative learning control  switching topology
基金项目  国家自然科学基金项目(61663020), 甘肃省高等学校产业支撑计划项目(2022CYZC–33), 兰州交通大学“百名青年优秀人才培养计划”基金项目
作者单位E-mail
陈引娟 兰州交通大学 机电工程学院 20294861@qq.com 
宁小刚 兰州交通大学 机电工程学院  
魏永东 兰州交通大学 机电工程学院  
李宗刚* 兰州交通大学 机电工程学院 lizongg@126.com 
中文摘要
      针对通信拓扑至少含有一个沿迭代轴的联合生成树且同时沿有限时间轴和无限迭代轴切换的情况, 文本研究了存在测量受限的连续线性多智能体系统输出一致性迭代学习控制问题. 首先, 文章采用迭代学习控制方法设 计了一种基于跟随者局部信息的分布式输出一致性协议. 然后, 给出了系统可解输出一致性问题的两个充分性条件, 其中之一可使跟随者实时获取迭代学习增益, 避免了全局信息对学习增益设计的影响, 且保证了算法的分布式 实现. 接着, 利用λ范数理论和圆盘定理严格证明了所设计算法的收敛性. 最后, 通过实例仿真验证了所得结论的有效性.
英文摘要
      Aiming at the case that the communication topology contains at least one joint spanning tree along the iteration axis and simultaneously switches along the finite time axis and the infinite iteration axis, the output consensus problem of continuous linear multi-agent systems with measurement constraint based on the iterative learning control is studied. Firstly, a distributed output consensus protocol based on the local information available to the follower is designed by using iterative learning control method. Then two sufficient conditions for the solvable output consensus problem of the system are given, one of which can make the follower obtain the iterative learning gain in real time, avoid the influence of global information on the design of learning gain, and ensure the distributed implementation of the algorithm. Next, the convergence of the designed algorithm is strictly proved by using the λ norm theory and the disk theorem. Finally, the validity of the conclusions is verified by an example simulation.