详细信息
Adaptive Event-Triggered Consensus of Multiagent Systems on Directed Graphs ( SCI-EXPANDED收录 EI收录)
文献类型:期刊文献
英文题名:Adaptive Event-Triggered Consensus of Multiagent Systems on Directed Graphs
作者:Li, Xianwei[1,2];Sun, Zhiyong[3,4];Tang, Yang[5];Karimi, Hamid Reza[6]
机构:[1]Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China;[2]Minist Educ China, Key Lab Syst Control & Informat Proc, Shanghai 200240, Peoples R China;[3]Lund Univ, Dept Automat Control, S-22100 Lund, Sweden;[4]Eindhoven Univ Technol TU E, Dept Elect Engn, NL-5612 AZ Eindhoven, Netherlands;[5]East China Univ Sci & Technol, Key Lab Adv Control & Optimizat Chem Proc, Shanghai 200237, Peoples R China;[6]Politecn Milan, Dept Mech Engn, I-20156 Milan, Italy
年份:2021
卷号:66
期号:4
起止页码:1670
外文期刊名:IEEE TRANSACTIONS ON AUTOMATIC CONTROL
收录:;EI(收录号:20211410172419);WOS:【SCI-EXPANDED(收录号:WOS:000634485900016)】;
基金:This work was supported in part by the Natural Science Foundation of China under Grant 61903250 and Grant 61673176, and in part by the Programme of Introducing Talents of Discipline to Universities (the 111 Project) under Grant B17017.
语种:英文
外文关键词:Adaptive control; consensus; directed graphs; event-triggering control; multiagent systems (MASs)
摘要:This article systematically studies consensus of linear multiagent systems (MASs) on directed graphs through adaptive event-triggered control. It presents innovative adaptive event-triggered state-feedback protocols with novel composite event-triggering conditions. Two specific designs in terms of different event-triggering conditions and laws of adaption are first discussed for linear MASs on strongly connected directed graphs, which are then extended to general directed graphs that contain a spanning tree. Moreover, another adaptive event-triggered protocol is proposed for solving leader-follower consensus that tracks a leader of a bounded control input. The protocols inherit the merits of both adaptive control and event-triggered control: the protocols can be implemented in a fully distributed way, since the Laplacian is avoided in design, and each agent only needs to know the relative information between neighbors at discrete instants determined by event-triggering conditions. Compared with the existing related results, the proposed protocols are applicable for linear MASs on general directed graphs, and moreover, the time-dependent term in the event-triggering conditions is allowed to be a class of positive L-1 functions. Two numerical examples clearly verify the effectiveness of the proposed protocols.
参考文献:
正在载入数据...
