{"title":"Fault-Tolerant Finite-Time Consensus of Multi-Agent Systems Under Asynchronous Self-Sensing Function Failures","authors":"Zhihai Wu;Shun Jiang;Linbo Xie","doi":"10.1109/TSIPN.2023.3299079","DOIUrl":null,"url":null,"abstract":"This article investigates fault-tolerant finite-time consensus (FTC) problems of single/double-integrator multi-agent systems (MASs) with partial agents subject to asynchronous self-sensing function failures (SSFFs). First, the strategy named DRMNNS is developed to recover the connectivity of network topology among normal agents by converting asynchronous SSFFs into multiple piecewise synchronous SSFFs and using multi-hop communication (MHC) together with agents subject to SSFFs as routing nodes. Second, by employing the state and input information of all agents in minimum-hop normal neighbor set (MHNNS) of an agent subject to SSFF and utilizing the history information of the agent subject to SSFF for computing its state information at the instants when its MHNNS changes, two switching fault-tolerant FTC protocols with single/double time-varying gains are designed, respectively, for single/double-integrator MASs. Third, convergence analysis is carried out by separately investigating the closed-loop dynamics of normal agents and the open-loop dynamics of agents subject to SSFFs, and convergence conditions in terms of time-varying gains are derived. It turns out that single/double-integrator MASs under asynchronous SSFFs using the proposed DRMNNS strategy and two fault-tolerant FTC protocols with proper time-varying gains can reach FTC/finite-time dynamical consensus (FTDC), respectively. Finally, comparison numerical simulations are provided to illustrate the effectiveness of the theoretical results.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"477-489"},"PeriodicalIF":3.0000,"publicationDate":"2023-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Signal and Information Processing over Networks","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10195880/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract
This article investigates fault-tolerant finite-time consensus (FTC) problems of single/double-integrator multi-agent systems (MASs) with partial agents subject to asynchronous self-sensing function failures (SSFFs). First, the strategy named DRMNNS is developed to recover the connectivity of network topology among normal agents by converting asynchronous SSFFs into multiple piecewise synchronous SSFFs and using multi-hop communication (MHC) together with agents subject to SSFFs as routing nodes. Second, by employing the state and input information of all agents in minimum-hop normal neighbor set (MHNNS) of an agent subject to SSFF and utilizing the history information of the agent subject to SSFF for computing its state information at the instants when its MHNNS changes, two switching fault-tolerant FTC protocols with single/double time-varying gains are designed, respectively, for single/double-integrator MASs. Third, convergence analysis is carried out by separately investigating the closed-loop dynamics of normal agents and the open-loop dynamics of agents subject to SSFFs, and convergence conditions in terms of time-varying gains are derived. It turns out that single/double-integrator MASs under asynchronous SSFFs using the proposed DRMNNS strategy and two fault-tolerant FTC protocols with proper time-varying gains can reach FTC/finite-time dynamical consensus (FTDC), respectively. Finally, comparison numerical simulations are provided to illustrate the effectiveness of the theoretical results.
期刊介绍:
The IEEE Transactions on Signal and Information Processing over Networks publishes high-quality papers that extend the classical notions of processing of signals defined over vector spaces (e.g. time and space) to processing of signals and information (data) defined over networks, potentially dynamically varying. In signal processing over networks, the topology of the network may define structural relationships in the data, or may constrain processing of the data. Topics include distributed algorithms for filtering, detection, estimation, adaptation and learning, model selection, data fusion, and diffusion or evolution of information over such networks, and applications of distributed signal processing.