无需事先分配的基于比邻的保连接编队控制方法

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Jinyong Chen;Rui Zhou;Yunjie Zhang;Bin Di;Guibin Sun
{"title":"无需事先分配的基于比邻的保连接编队控制方法","authors":"Jinyong Chen;Rui Zhou;Yunjie Zhang;Bin Di;Guibin Sun","doi":"10.1109/TNSE.2024.3478174","DOIUrl":null,"url":null,"abstract":"This paper explores information sharing within cliques to enable flexible formation pattern control of networked agents with limited communication range, where each agent is not pre-assigned a fixed point in the pattern and is unaware of the total number of agents. To achieve this, we first present a new representation of formation patterns that enables the agents to reach a consensus on the desired pattern by negotiating formation motion and agent numbers. The problem of continuously assigning each agent a point in the desired pattern is then decomposed into small size problems in terms of \n<inline-formula><tex-math>$\\delta$</tex-math></inline-formula>\n-maximal cliques, which can be solved in a distributed manner. Furthermore, a maximal clique-based formation controller is employed to ensure that the agents converge to the desired pattern while preserving the connectivity of the communication topology. Simulation results demonstrate that the pattern assembly time of seven agents using the proposed algorithm is reduced by 55.1% compared with a state-of-the-art pre-assigned method, and this improvement tends to amplify with an increasing number of agents. In addition, we conduct a physical experiment involving five robots to verify the ability of the proposed algorithm in terms of formation shape assembly, manipulation, and automatic repair.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"5916-5929"},"PeriodicalIF":6.7000,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Connectivity-Preserving Formation Control via Clique-Based Approach Without Prior Assignment\",\"authors\":\"Jinyong Chen;Rui Zhou;Yunjie Zhang;Bin Di;Guibin Sun\",\"doi\":\"10.1109/TNSE.2024.3478174\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper explores information sharing within cliques to enable flexible formation pattern control of networked agents with limited communication range, where each agent is not pre-assigned a fixed point in the pattern and is unaware of the total number of agents. To achieve this, we first present a new representation of formation patterns that enables the agents to reach a consensus on the desired pattern by negotiating formation motion and agent numbers. The problem of continuously assigning each agent a point in the desired pattern is then decomposed into small size problems in terms of \\n<inline-formula><tex-math>$\\\\delta$</tex-math></inline-formula>\\n-maximal cliques, which can be solved in a distributed manner. Furthermore, a maximal clique-based formation controller is employed to ensure that the agents converge to the desired pattern while preserving the connectivity of the communication topology. Simulation results demonstrate that the pattern assembly time of seven agents using the proposed algorithm is reduced by 55.1% compared with a state-of-the-art pre-assigned method, and this improvement tends to amplify with an increasing number of agents. In addition, we conduct a physical experiment involving five robots to verify the ability of the proposed algorithm in terms of formation shape assembly, manipulation, and automatic repair.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"11 6\",\"pages\":\"5916-5929\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2024-10-10\",\"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/10713503/\",\"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/10713503/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

本文探讨了小团体内的信息共享问题,以实现对通信范围有限的联网代理的灵活编队模式控制,在这种模式下,每个代理都没有被预先分配到模式中的一个固定点,也不知道代理的总数。为了实现这一目标,我们首先提出了一种新的编队模式表示法,使各代理能够通过协商编队运动和代理数量,就所需模式达成共识。然后,将每个代理在所需模式中连续分配一个点的问题分解为$\delta$-maximal cliques 的小规模问题,这些问题可以分布式方式求解。此外,还采用了一种基于最大簇的形成控制器,以确保代理汇聚到所需模式,同时保持通信拓扑的连通性。仿真结果表明,与最先进的预分配方法相比,使用所提算法的七个代理的模式组装时间缩短了 55.1%,而且随着代理数量的增加,这种改进还有扩大的趋势。此外,我们还进行了一项涉及五个机器人的物理实验,以验证所提算法在队形组装、操纵和自动修复方面的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Connectivity-Preserving Formation Control via Clique-Based Approach Without Prior Assignment
This paper explores information sharing within cliques to enable flexible formation pattern control of networked agents with limited communication range, where each agent is not pre-assigned a fixed point in the pattern and is unaware of the total number of agents. To achieve this, we first present a new representation of formation patterns that enables the agents to reach a consensus on the desired pattern by negotiating formation motion and agent numbers. The problem of continuously assigning each agent a point in the desired pattern is then decomposed into small size problems in terms of $\delta$ -maximal cliques, which can be solved in a distributed manner. Furthermore, a maximal clique-based formation controller is employed to ensure that the agents converge to the desired pattern while preserving the connectivity of the communication topology. Simulation results demonstrate that the pattern assembly time of seven agents using the proposed algorithm is reduced by 55.1% compared with a state-of-the-art pre-assigned method, and this improvement tends to amplify with an increasing number of agents. In addition, we conduct a physical experiment involving five robots to verify the ability of the proposed algorithm in terms of formation shape assembly, manipulation, and automatic repair.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network Science and Engineering
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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信