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