非完整系统
计算机科学
可扩展性
图形
翻译(生物学)
特征向量
分布式计算
多智能体系统
趋同(经济学)
观察员(物理)
有向图
控制理论(社会学)
数学优化
控制(管理)
理论计算机科学
数学
机器人
算法
移动机器人
人工智能
物理
信使核糖核酸
基因
数据库
经济
化学
量子力学
生物化学
经济增长
作者
Wei Jiang,Ahmed Rahmani,Guoguang Wen
标识
DOI:10.1080/00207179.2019.1626996
摘要
This paper addresses the time-varying formation-containment (FC) problem for general linear multi-agent systems based on an observer viewpoint under the directed communication graph which contains a spanning tree. A new format of time-varying formation shapes with the properties of translation, scalability and rotation is proposed. Then the time-varying formation tracking problem where the real leader's input is unknown to all other agents is solved independently. After that, the time-varying FC problem where the challenge is how to deal with the formation-achieving agents' unknown nonzero inputs for containment-achieving agents, is firstly addressed. All the designed controllers, which need no eigenvalue information of the whole graph, are fully distributed and so can be applied to large-scale systems. The influence of communication graph structure to the control convergence rate is further analysed. The above theoretical results are verified by multiple nonholonomic vehicles in simulations.
科研通智能强力驱动
Strongly Powered by AbleSci AI