arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1411.4346eess.SYcs.SY
收藏

基于PI^n型方法的多智能体系统动态领导者一致性控制

Containment Control of Multi-Agent Systems with Dynamic Leaders Based on a $PI^n$-Type Approach

State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所复杂系统管理与控制国家重点实验室);Department of Electrical and Computer Engineering, University of California at Riverside(加州大学河滨分校电气与计算机工程系)

Yunpeng Wang, Long Cheng, Wei Ren, Zeng-Guang Hou, Min Tan

AI总结:

本文提出PI^n型一致性算法,解决多智能体系统在连续和离散时间域中动态领导者的一致性问题,改进了传统方法在积分动力学阶次和积分项阶次上的限制,避免了符号函数导致的震荡现象。

摘要:

本文研究了多智能体系统在离散时间和连续时间域中多个动态领导者的一致性控制问题。领导者运动由(n-1)阶多项式轨迹描述,该设定具有实际意义,因为给定关键点后,领导者轨迹通常通过多项式插值规划。为驱动所有跟随者进入领导者张成的凸包,提出PI^n型一致性算法。理论上证明该算法能够解决跟随者为任意阶积分动力学的多智能体系统一致性问题。与现有结果相比,本文的特点在于:(1) 一致性问题不仅在连续时间域研究,还在离散时间域研究;(2) 为处理(n-1)阶多项式轨迹的领导者,现有结果要求跟随者动力学为n阶积分,而本文考虑的跟随者可为任意阶积分;(3) 所提算法未采用符号函数,避免了震荡现象。为进一步说明所提方法的实用性,研究了多移动机器人的一致性控制应用。最后给出了两个仿真示例以展示所提算法的有效性。

英文摘要:

This paper studies the containment control problem of multi-agent systems with multiple dynamic leaders in both the discrete-time domain and the continuous-time domain. The leaders' motions are described by $(n-1)$-order polynomial trajectories. This setting makes practical sense because given some critical points, the leaders' trajectories are usually planned by the polynomial interpolations. In order to drive all followers into the convex hull spanned by the leaders, a $PI^n$-type ($P$ and $I$ are short for {\it Proportion} and {\it Integration}, respectively; $I^n$ implies that the algorithm includes high-order integral terms) containment algorithm is proposed. It is theoretically proved that the $PI^n$-type containment algorithm is able to solve the containment problem of multi-agent systems where the followers are described by any order integral dynamics. Compared with the previous results on the multi-agent systems with dynamic leaders, the distinguished features of this paper are that: (1) the containment problem is studied not only in the continuous-time domain but also in the discrete-time domain while most existing results only work in the continuous-time domain; (2) to deal with the leaders with the $(n-1)$-order polynomial trajectories, existing results require the follower's dynamics to be $n$-order integral while the followers considered in this paper can be described by any-order integral; and (3) the "sign" function is not employed in the proposed algorithm, which avoids the chattering phenomenon. Furthermore, in order to illustrate the practical value of the proposed approach, an application, the containment control of multiple mobile robots is studied. Finally, two simulation examples are given to demonstrate the effectiveness of the proposed algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑