杨秀霞,严瑄,张毅.基于网络复杂性的最小刚性编队通信拓扑生成[J].南京航空航天大学学报,2020,52(6):855-860 |
基于网络复杂性的最小刚性编队通信拓扑生成 |
Topology Generation of Minimum Rigid Formation Communication Based on Network Complexity |
投稿时间:2020-05-12 修订日期:2020-11-22 |
DOI:10.16356/j.1005-2615.2020.06.003 |
中文关键词: 多智能体编队 通信拓扑 网络复杂性 刚性图 最小刚性图 |
英文关键词:multi agent formation communication topology network complexity rigidity graph minimum rigidity graph |
基金项目:总装预研基金(6142055040203)资助项目。 |
|
摘要点击次数: 42 |
全文下载次数: 63 |
中文摘要: |
基于编队通信拓扑的网络复杂性,提出了一种多智能体系统最小刚性编队通信拓扑生成算法。首先基于刚度矩阵生成最小刚性编队通信拓扑的方式,找出智能体编队的最小刚性通信拓扑集;然后从降低通信消耗等方面建立网络复杂性评价指标,采用熵权法对各指标权重进行求解,给出网络复杂性的计算方法;基于此评价指标,在最小刚性通信拓扑集中找出网络复杂性最小的编队通信拓扑。仿真结果表明,该算法能有效减少编队通信拓扑网络复杂性,简化通信拓扑结构。 |
英文摘要: |
Based on the network complexity of formation communication topology, a minimum rigid formation communication topology generation algorithm is proposed for multi-agent system. First, the minimum rigid communication topology set of the agent formation is found by generating the minimum rigid communication topology based on the stiffness matrix. Second, the evaluation index of network complexity is established through reducing the collision probability between the members of the formation and reducing the communication consumption. The entropy weight method is used to solve the weight of each index. The calculation method of network complexity is given. Third,in the minimal rigid communication topology set, the formation communication topology with the minimum network complexity is found. Simulation results show that the algorithm can effectively reduce the complexity of formation communication topology and simplify the communication topology structure. |
[HTML] 查看全文 查看/发表评论 下载PDF阅读器 |
关闭 |