{"title":"不涉及可行性条件的网络系统分布式保证性能一致性:一种层次算法","authors":"Lei Chen;Hongjing Liang;Xilin Zhang;Tieshan Li","doi":"10.1109/TNSE.2025.3548313","DOIUrl":null,"url":null,"abstract":"This paper utilizes a hierarchical algorithm to focus on the distributed guaranteed-performance consensus problem of multiagent systems subjected to communication faults. With this algorithm, the consensus problem can be transformed into the tracking problem of agents in adjacent layers, and the constraint range for tracking errors does not depend on the Laplacian matrix of the communication topology. Compared to the existing hierarchical algorithm, a fault-tolerant compensation approach is designed to solve the communication fault between agents. Furthermore, the hierarchical rules are redefined according to the physical significance of topological weights, which enhances the rationality of the partition results. In addition, a shifting function is designed and incorporated into the conventional prescribed performance control approach to eliminate the existing feasibility condition. Based on Lyapunov theory, the sufficient conditions for the boundedness of all signals in the closed-loop system are derived. Finally, two simulation examples verify the efficacy of the scheme.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2445-2457"},"PeriodicalIF":7.9000,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Guaranteed-Performance Consensus of Networked Systems Without Involving the Feasibility Condition: A Hierarchical Algorithm\",\"authors\":\"Lei Chen;Hongjing Liang;Xilin Zhang;Tieshan Li\",\"doi\":\"10.1109/TNSE.2025.3548313\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper utilizes a hierarchical algorithm to focus on the distributed guaranteed-performance consensus problem of multiagent systems subjected to communication faults. With this algorithm, the consensus problem can be transformed into the tracking problem of agents in adjacent layers, and the constraint range for tracking errors does not depend on the Laplacian matrix of the communication topology. Compared to the existing hierarchical algorithm, a fault-tolerant compensation approach is designed to solve the communication fault between agents. Furthermore, the hierarchical rules are redefined according to the physical significance of topological weights, which enhances the rationality of the partition results. In addition, a shifting function is designed and incorporated into the conventional prescribed performance control approach to eliminate the existing feasibility condition. Based on Lyapunov theory, the sufficient conditions for the boundedness of all signals in the closed-loop system are derived. Finally, two simulation examples verify the efficacy of the scheme.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 4\",\"pages\":\"2445-2457\"},\"PeriodicalIF\":7.9000,\"publicationDate\":\"2025-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10916783/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10916783/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
Distributed Guaranteed-Performance Consensus of Networked Systems Without Involving the Feasibility Condition: A Hierarchical Algorithm
This paper utilizes a hierarchical algorithm to focus on the distributed guaranteed-performance consensus problem of multiagent systems subjected to communication faults. With this algorithm, the consensus problem can be transformed into the tracking problem of agents in adjacent layers, and the constraint range for tracking errors does not depend on the Laplacian matrix of the communication topology. Compared to the existing hierarchical algorithm, a fault-tolerant compensation approach is designed to solve the communication fault between agents. Furthermore, the hierarchical rules are redefined according to the physical significance of topological weights, which enhances the rationality of the partition results. In addition, a shifting function is designed and incorporated into the conventional prescribed performance control approach to eliminate the existing feasibility condition. Based on Lyapunov theory, the sufficient conditions for the boundedness of all signals in the closed-loop system are derived. Finally, two simulation examples verify the efficacy of the scheme.
期刊介绍:
The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.