具有切换拓扑和时变时滞的离散线性多智能体系统一致性的平均驻留时间条件

Q2 Computer Science

自动化学报 Pub Date : 2014-11-01 DOI:10.1016/S1874-1029(14)60407-9

Yan-Rong GE , Yang-Zhou CHEN , Ya-Xiao ZHANG

{"title":"具有切换拓扑和时变时滞的离散线性多智能体系统一致性的平均驻留时间条件","authors":"Yan-Rong GE , Yang-Zhou CHEN , Ya-Xiao ZHANG","doi":"10.1016/S1874-1029(14)60407-9","DOIUrl":null,"url":null,"abstract":"<div><p>This paper investigates the consensus problem of discrete-time linear multi-agent systems (DLMASs) with directed switching information topologies and time-varying delays. First, we transform the consensus problem to an asymptotic stability problem of a corresponding time-delayed switched linear system (TDSLS) via a proper linear transformation. Then by using a constructed Lyapunov functional and the average dwell-time scheme, we establish a novel delay-dependent sufficient condition for the solvability of the consensus problem in terms of linear matrix inequalities (LMIs) for two cases, respectively: 1) all of the given information topologies are consensusable; 2) some of the given information topologies are consensusable. Finally, numerical examples are given to show the validness of the established results.</p></div>","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"40 11","pages":"Pages 2609-2617"},"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)60407-9","citationCount":"10","resultStr":"{\"title\":\"Average Dwell-time Conditions for Consensus of Discrete-time Linear Multi-agent Systems with Switching Topologies and Time-varying Delays\",\"authors\":\"Yan-Rong GE , Yang-Zhou CHEN , Ya-Xiao ZHANG\",\"doi\":\"10.1016/S1874-1029(14)60407-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper investigates the consensus problem of discrete-time linear multi-agent systems (DLMASs) with directed switching information topologies and time-varying delays. First, we transform the consensus problem to an asymptotic stability problem of a corresponding time-delayed switched linear system (TDSLS) via a proper linear transformation. Then by using a constructed Lyapunov functional and the average dwell-time scheme, we establish a novel delay-dependent sufficient condition for the solvability of the consensus problem in terms of linear matrix inequalities (LMIs) for two cases, respectively: 1) all of the given information topologies are consensusable; 2) some of the given information topologies are consensusable. Finally, numerical examples are given to show the validness of the established results.</p></div>\",\"PeriodicalId\":35798,\"journal\":{\"name\":\"自动化学报\",\"volume\":\"40 11\",\"pages\":\"Pages 2609-2617\"},\"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)60407-9\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"自动化学报\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1874102914604079\",\"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/S1874102914604079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 10

摘要

研究了具有有向交换信息拓扑和时变时滞的离散线性多智能体系统的一致性问题。首先，通过适当的线性变换，将一致性问题转化为相应时滞切换线性系统的渐近稳定性问题。然后，利用构造的Lyapunov泛函和平均驻留时间格式，分别针对以下两种情况，建立了共识问题在线性矩阵不等式(lmi)上的可解性的一个新的延迟相关充分条件:1)所有给定的信息拓扑都是共识的;2)某些给定的信息拓扑是可同意的。最后，通过数值算例验证了所建立结果的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Average Dwell-time Conditions for Consensus of Discrete-time Linear Multi-agent Systems with Switching Topologies and Time-varying Delays

This paper investigates the consensus problem of discrete-time linear multi-agent systems (DLMASs) with directed switching information topologies and time-varying delays. First, we transform the consensus problem to an asymptotic stability problem of a corresponding time-delayed switched linear system (TDSLS) via a proper linear transformation. Then by using a constructed Lyapunov functional and the average dwell-time scheme, we establish a novel delay-dependent sufficient condition for the solvability of the consensus problem in terms of linear matrix inequalities (LMIs) for two cases, respectively: 1) all of the given information topologies are consensusable; 2) some of the given information topologies are consensusable. Finally, numerical examples are given to show the validness of the established 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.