{"title":"基于连续时间模型的一般线性多智能体系统的采样数据一致性","authors":"Xie-Yan ZHANG , Jing ZHANG","doi":"10.1016/S1874-1029(14)60400-6","DOIUrl":null,"url":null,"abstract":"<div><p>This paper discusses the sampled-data consensus problem of multi-agent systems with general linear dynamics and time-varying sampling intervals. To investigate the allowable upper bound of sampling intervals, we employ the property of discretization of sampled-data to identify the upper bound on the variable sampling intervals via a continuous-time model. Without considering the states in the sampling intervals, the decrease of Lyapunov function is guaranteed only at each sampling time. Consequently, it results in a more robust sampling interval which is obtained by verifying the feasibility of LMIs. Subsequently, provided a limited matrix variable, the control gain matrix <em>K</em> is solved by the LMI approach. Numerical simulations are provided to demonstrate the effectiveness of theoretical results.</p></div>","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"40 11","pages":"Pages 2549-2555"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1874-1029(14)60400-6","citationCount":"9","resultStr":"{\"title\":\"Sampled-data Consensus of Multi-agent Systems with General Linear Dynamics Based on a Continuous-time Model\",\"authors\":\"Xie-Yan ZHANG , Jing ZHANG\",\"doi\":\"10.1016/S1874-1029(14)60400-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper discusses the sampled-data consensus problem of multi-agent systems with general linear dynamics and time-varying sampling intervals. To investigate the allowable upper bound of sampling intervals, we employ the property of discretization of sampled-data to identify the upper bound on the variable sampling intervals via a continuous-time model. Without considering the states in the sampling intervals, the decrease of Lyapunov function is guaranteed only at each sampling time. Consequently, it results in a more robust sampling interval which is obtained by verifying the feasibility of LMIs. Subsequently, provided a limited matrix variable, the control gain matrix <em>K</em> is solved by the LMI approach. Numerical simulations are provided to demonstrate the effectiveness of theoretical results.</p></div>\",\"PeriodicalId\":35798,\"journal\":{\"name\":\"自动化学报\",\"volume\":\"40 11\",\"pages\":\"Pages 2549-2555\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S1874-1029(14)60400-6\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"自动化学报\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1874102914604006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"自动化学报","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1874102914604006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}
Sampled-data Consensus of Multi-agent Systems with General Linear Dynamics Based on a Continuous-time Model
This paper discusses the sampled-data consensus problem of multi-agent systems with general linear dynamics and time-varying sampling intervals. To investigate the allowable upper bound of sampling intervals, we employ the property of discretization of sampled-data to identify the upper bound on the variable sampling intervals via a continuous-time model. Without considering the states in the sampling intervals, the decrease of Lyapunov function is guaranteed only at each sampling time. Consequently, it results in a more robust sampling interval which is obtained by verifying the feasibility of LMIs. Subsequently, provided a limited matrix variable, the control gain matrix K is solved by the LMI approach. Numerical simulations are provided to demonstrate the effectiveness of theoretical results.
自动化学报Computer Science-Computer Graphics and Computer-Aided Design
CiteScore
4.80
自引率
0.00%
发文量
6655
期刊介绍:
ACTA AUTOMATICA SINICA is a joint publication of Chinese Association of Automation and the Institute of Automation, the Chinese Academy of Sciences. The objective is the high quality and rapid publication of the articles, with a strong focus on new trends, original theoretical and experimental research and developments, emerging technology, and industrial standards in automation.