INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY |
Prev
Next
|
|
|
Optimization of communication topology for persistent formation in case of communication faults |
Guo-Qiang Wang(王国强)1,2,3, He Luo(罗贺)1,2,3,†, Xiao-Xuan Hu(胡笑旋)1,2,3, and Jian-Wei Tai(台建玮)1,2,3 |
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 |
|
|
Abstract 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-CT-PF), 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.
|
Received: 24 September 2022
Revised: 05 December 2022
Accepted manuscript online: 06 January 2023
|
PACS:
|
89.20.Ff
|
(Computer science and technology)
|
|
87.85.St
|
(Robotics)
|
|
02.10.Ox
|
(Combinatorics; graph theory)
|
|
64.60.aq
|
(Networks)
|
|
Fund: Project supported by the National Natural Science Foundation of China (Grant Nos. 71871079, 72271076, 71971075, and 71671059) and the Anhui Provincial Natural Science Foundation, China (Grant No. 1808085MG213). |
Corresponding Authors:
He Luo
E-mail: luohe@hfut.edu.cn
|
Cite this article:
Guo-Qiang Wang(王国强), He Luo(罗贺), Xiao-Xuan Hu(胡笑旋), and Jian-Wei Tai(台建玮) Optimization of communication topology for persistent formation in case of communication faults 2023 Chin. Phys. B 32 078901
|
[1] Dai Y Y, Kim Y G, Wee S G, Lee D H and Lee S G 2016 ISA Transactions 60 321 [2] Dutta R, Sun L and Pack D 2018 IEEE T. Contr. Syst. T. 26 2206 [3] Chen Y Y, Yu R, Zhang Y and Liu C L 2020 IEEE-CAA Journal of Automatica Sinica 7 505 [4] Hua C C, Chen J N and Li Y F 2017 International Journal of Systems Science 48 2499 [5] Qian Z L, Lyu W C, Dai Y Z and Xu J 2022 J. Intell. Robot. Syst. 106 15 [6] Dimarogonas D V and Kyriakopoulos K J 2008 Automatica 44 2648 [7] Lin Z Y, Broucke M and Francis B 2004 IEEE T. Automat Contr. 49 622 [8] Summers T H, Yu C B, Dasgupta S and Anderson B D O 2011 IEEE T. Automat. Contr. 56 2772 [9] Liu H, Lin Z, Cao M, Wang X and Lu J 2018 Systems & Control Letters 119 8 [10] Oh K K, Park M C and Ahn H S 2015 Automatica 53 424 [11] Sun Z Y, de Marina H G, Anderson B D O and Cao M 2018 Int. J. Robust. Nonlin. 28 4865 [12] Wu H J, Yang Z H, Cao J N and Lai L Q 2020 IEEE T. Veh. Technol. 69 7679 [13] Kang S M, Park M C and Ahn H S 2017 IEEE T. Ind. Electron. 64 380 [14] Yu D X, Chen C L P, Ren C E and Sui S 2020 IEEE Transactions on Cybernetics 50 4481 [15] Park M C, Jeong K and Ahn H S 2015 Int. J. Robust & Nonlinear Control 25 2532 [16] Wang G Q, Luo H and Hu X X 2018 Chin. Phys. B 27 028901 [17] Luo X Y, Li S B and Guan X P 2009 Chin. Phys. B 18 3104 [18] Shao S K, Luo X Y, Jin T and Guan X P 2012 2012 24th Chinese Control and Decision Conference (CCDC), 23-25 May, 2012, Taiyuan, China, p. 152 [19] Luo X Y, Yang F, Li S B and Guan X P 2014 Acta Automatica Sinica 40 1311 [20] Wang J R, Luo X Y, Yang F and Guan X P 2015 Acta Automatica Sinica 41 1123 [21] Sun H Y, Song G M, Wei Z and Zhang Y 2018 International Journal of Aerospace Engineering 2018 [22] Wang G Q, Luo H, Hu X X and Yang S L 2021 Optim. Lett. 15 513 [23] Wang G Q, Wu P, Li X D, Cao X and Luo H 2021 2021 China Automation Congress (CAC), 22-24 October, 2021, Beijing, China, p. 1671 [24] Wang G Q, Lv Q W, Li X D, Cao X and Luo H 2021 2021 33rd Chinese Control and Decision Conference (CCDC), 22-24 May, 2021, Kunming, China, p. 3193 [25] Motevallian S A, Yu C B and Anderson B D O 2015 Int. J. Robust. Nonlin. 25 1654 [26] Wang G Q, Luo H, Hu X X, Ma H W and Yang S L 2017 Int. J. Adv. Robot. Syst. 14 1 [27] Giulietti F, Pollini L and Innocenti M 2000 IEEE Control Systems 20 34 [28] Pollini L, Giulietti F and Innocenti M 2002 American Control Conference, May 8-10,2002, Hilton Anchorage and Egan Convention Center, Anchorage, Alaska, USA, p. 2860 [29] Yang H, Jiang B and Zhang Y M 2014 International Journal of Control Automation and Systems 12 29 [30] Xue L, Chen X, Zhao J J and Guan X P 2015 2015 34th Chinese Control Conference (CCC), 28-30 July, 2015, Hangzhou, China, p. 7795 |
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|