检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王国强 罗贺 胡笑旋 台建玮 Guo-Qiang Wang;He Luo;Xiao-Xuan Hu;Jian-Wei Tai(School of Management,Hefei University of Technology,Hefei 230009,China;Key Laboratory of Process Optimization&Intelligent Decision-making,Ministry of Education,Hefei 230009,China;Engineering Research Center for Intelligent Decision-making&Information Systems Technologies,Ministry of Education,Hefei 230009,China)
机构地区:[1]School of Management,Hefei University of Technology,Hefei 230009,China [2]Key Laboratory of Process Optimization&Intelligent Decision-making,Ministry of Education,Hefei 230009,China [3]Engineering Research Center for Intelligent Decision-making&Information Systems Technologies,Ministry of Education,Hefei 230009,China
出 处:《Chinese Physics B》2023年第7期610-624,共15页中国物理B(英文版)
基 金:Project supported by the National Natural Science Foundation of China(Grant Nos.71871079,72271076,71971075,and 71671059);the Anhui Provincial Natural Science Foundation,China(Grant No.1808085MG213).
摘 要:To address the optimization problem of communication topology for persistent formation in the case of communication faults such as link interruption,transmitter failure,and receiver failure a two-stage model including fast reconstruction of communication topology and re-optimization of communication topology is constructed.Then,a fast reconstruction algorithm of communication topology for persistent formation(FRA-CT-PF),based on optimally rigid graph,arc addition operation,and path reversal operation,is proposed,which can quickly generate a feasible reconstructed communication topology after communication faults,thus ensuring the safety of the agents and maintaining the formation shape of persistent formation.Furthermore,a re-optimization algorithm of communication topology for persistent formation(ROA-CTPF),based on agent position exchange,is proposed,which can further obtain a reoptimized communication topology to minimize the formation communication cost while still maintaining the formation shape of persistent formation.The time complexities of these two algorithms are also analyzed.Finally,the effectiveness of the above algorithms is verified by numerical experiments.Compared with existing algorithms,FRA-CT-PF can always obtain feasible reconstructed communication topology in much less time under all communication fault scenarios,and ROA-CT-PF can obtain a reoptimized communication topology to further reduce the formation communication cost in a shorter time.
关 键 词:persistent formation communication topology formation communication cost communication fault
分 类 号:TN911[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.190.152.131