检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Zhenhua WANG Huanshui ZHANG Minyue FU Huaxiang ZHANG
机构地区:[1]School of Information Science and Engineering,Shandong Normal University,Jinan 250014,China [2]Institute of Data Science and Technology,Shandong Normal University,Jinan 250014,China [3]School of Control Science and Engineering,Shandong University,Jinan 250061,China [4]School of Electrical Engineering and Computer Science,University of Newcastle,NSW 2308,Australia [5]School of Automation,Guangdong Key Laboratory of IoT Information Technology,Guangdong University of Technology,Guangzhou 510006,China
出 处:《Science China(Information Sciences)》2017年第9期237-248,共12页中国科学(信息科学)(英文版)
基 金:supported by National Natural Science Foundation of China(Grant Nos.61120106011,61403235,61573221,61633014);Natural Science Foundation of Shandong Province(Grant Nos.ZR2014FQ011,BS2015DX016)
摘 要:In this study, consensus problem for general high-order multi-agent systems with communication delay is investigated. Given the unstable agent dynamics and a known communication delay, two consensus protocols are designed to guarantee consensus over undirected network. By jointly researching the effects of agent dynamics and network topology, allowable delay bounds depending on the maxima of concave functions are easy to calculate. Especially, the maximum delay bound is derived when the network topology is completely connected. The main approach for the same involves designing the control gains on the basis of the solution of a parametric algebraic Riccati equation. Finally, the theoretical results are demonstrated via numerical simulations.In this study, consensus problem for general high-order multi-agent systems with communication delay is investigated. Given the unstable agent dynamics and a known communication delay, two consensus protocols are designed to guarantee consensus over undirected network. By jointly researching the effects of agent dynamics and network topology, allowable delay bounds depending on the maxima of concave functions are easy to calculate. Especially, the maximum delay bound is derived when the network topology is completely connected. The main approach for the same involves designing the control gains on the basis of the solution of a parametric algebraic Riccati equation. Finally, the theoretical results are demonstrated via numerical simulations.
关 键 词:CONSENSUS communication delay historical input information parametric algebraic Riccati equa-tion eigenratio
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249