Communication Topology Reconstruction for a Three-Dimensional Persistent Formation With Fault Constraint

IF 6.7 2区计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY

IEEE Transactions on Network Science and Engineering Pub Date : 2024-09-12 DOI:10.1109/TNSE.2024.3457489

Guoqiang Wang;He Luo;Xiaoxuan Hu

{"title":"Communication Topology Reconstruction for a Three-Dimensional Persistent Formation With Fault Constraint","authors":"Guoqiang Wang;He Luo;Xiaoxuan Hu","doi":"10.1109/TNSE.2024.3457489","DOIUrl":null,"url":null,"abstract":"The aim of communication topology reconstruction of a persistent formation with fault constraint is to reconstruct the communication topology in a timely manner in the case of a fault to ensure that the agents continue to maintain the formation shape and to minimize the communication energy consumption among agents. The formation communication cost of solutions obtained by existing algorithms is high, and their calculation time is long. To address this problem, a novel communication topology reconstruction algorithm for persistent formations in three-dimensional space is proposed based on arc addition and path reversal operations. Then, the correctness of the algorithm is proved theoretically, and its scalability for two-dimensional space is also analyzed. Finally, its effectiveness is verified through numerical experiments. Compared with existing algorithms, its advantages regarding solution quality and calculation time increase with the increase in the number of agents and the proportion of link loss in the faults.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6574-6588"},"PeriodicalIF":6.7000,"publicationDate":"2024-09-12","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/10679098/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

Abstract

The aim of communication topology reconstruction of a persistent formation with fault constraint is to reconstruct the communication topology in a timely manner in the case of a fault to ensure that the agents continue to maintain the formation shape and to minimize the communication energy consumption among agents. The formation communication cost of solutions obtained by existing algorithms is high, and their calculation time is long. To address this problem, a novel communication topology reconstruction algorithm for persistent formations in three-dimensional space is proposed based on arc addition and path reversal operations. Then, the correctness of the algorithm is proved theoretically, and its scalability for two-dimensional space is also analyzed. Finally, its effectiveness is verified through numerical experiments. Compared with existing algorithms, its advantages regarding solution quality and calculation time increase with the increase in the number of agents and the proportion of link loss in the faults.

查看原文本刊更多论文

带断层约束的三维持久性阵型的通信拓扑重构

带故障约束的持久编队通信拓扑重建的目的是在发生故障时及时重建通信拓扑，以确保代理继续保持编队形状，并最大限度地减少代理间的通信能耗。现有算法得到的解决方案的编队通信成本高，计算时间长。针对这一问题，提出了一种基于弧添加和路径反转操作的新型三维空间持久队形通信拓扑重建算法。然后，从理论上证明了该算法的正确性，并分析了其在二维空间中的可扩展性。最后，通过数值实验验证了算法的有效性。与现有算法相比，该算法在解质量和计算时间方面的优势随着代理数量和故障中链路损耗比例的增加而增加。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering

CiteScore

12.60

自引率

9.10%

发文量

393

期刊介绍： 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.