检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:韩娜妮 罗小元[2] 朱亚锟 HAN Na-ni;LUO Xiao-yuan;ZHU Ya-kun(College of Electrical Engineering,Longdong University,Qingyang 745000,China;School of Electrical Engineering,Yanshan University,Qinhuangdao 066004,China;School of Control Engineering,Northeastern University at Qinhuangdao,Qinhuangdao 066004,China)
机构地区:[1]陇东学院电气工程学院,甘肃庆阳745000 [2]燕山大学电气工程学院,河北秦皇岛066004 [3]东北大学秦皇岛分校控制工程学院,河北秦皇岛066004
出 处:《控制与决策》2019年第8期1803-1808,共6页Control and Decision
基 金:国家自然科学基金项目(61375105,61703079)
摘 要:针对高阶离散异构多自主体系统的时变编队-合围控制问题,考虑时变时延,提出分布式编队-合围控制协议.首先,在合理假设的基础上,通过模型转变和状态空间分解,将编队-合围控制问题转化为子系统的稳定性问题,再利用Lyapunov-Krasovskii函数,以LMIs的形式给出协议有效的充分条件,并指出LMIs的个数与系统中自主体的个数无关;然后,给出编队参考函数的具体形式,证明指出编队参考函数不受时变时延的影响;最后,通过固定和时变编队-合围仿真验证所设计的协议的有效性.To investigate the formation-containment problem of discrete-time heterogeneous multi-agent systems, the formation-containment protocols with time-varying delay are presented. Firstly, based on reasonable hypothesises,by model transformation and state space decomposition, the problem of formation-containment is transformed into stability problem of subsystems. By using the Lyapunov-Krasovskii function, the sufficient conditions that guarantee the effectiveness of the proposed protocols are presented in the form of LMIs, and it is pointed out that the number of LMIs is independent of that of agents. Then, the formation reference function is also described in detail, and the proof illustrates that the formation reference function is not affected by time-varying delay. Finally, the simulation results demonstrate the effectiveness of the designed protocols.
关 键 词:编队-合围 异构多自主体系统 离散系统 时变时延
分 类 号:TP273[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3