Robustness of multi-agent formation based on natural connectivity

Abstract The robustness of multi-agent topology has great importance to the design of multi-agent formation, while to improve the robustness of the topology without increasing its cost is also very important. In this paper, we proposed an optimization method for the robustness of multi-agent formation. The natural connectivity is used for measuring the robustness of multi-agent formation. Through analysis, the formation optimization problem is transformed into a 0–1 nonlinear programming problem. In order to solve the problem quickly, the paper presents a genetic algorithm based on chaotic search optimization. When the method given in this paper is applied to specific requirements, only the constraint conditions need to be modified, so the method has good universality. The results show that the optimized network can significantly improve the robustness of the network.

[1]  L. Benguigui,et al.  Relationships between centrality measures of networks with diameter 2 , 2018, Physica A: Statistical Mechanics and its Applications.

[2]  Yangming Guo,et al.  Investigation of epidemic spreading process on multiplex networks by incorporating fatal properties , 2019, Applied Mathematics and Computation.

[3]  Siddhartha Bhattacharyya,et al.  Topology, Search, and Fault Tolerance in Unstructured P2P Networks , 2004, HICSS.

[4]  Reuven Cohen,et al.  Stability and topology of scale-free networks under attack and defense strategies. , 2005, Physical review letters.

[5]  S. Havlin,et al.  Optimization of robustness of complex networks , 2004, cond-mat/0404331.

[6]  Hans J. Herrmann,et al.  Onion-like network topology enhances robustness against malicious attacks , 2011 .

[7]  Y. Moreno,et al.  Resilience to damage of graphs with degree correlations. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  M. Perc,et al.  Coevolutionary resolution of the public goods dilemma in interdependent structured populations , 2018, EPL (Europhysics Letters).

[9]  R. Solé,et al.  Information Theory of Complex Networks: On Evolution and Architectural Constraints , 2004 .

[10]  Damien Magoni,et al.  Tearing down the Internet , 2003, IEEE J. Sel. Areas Commun..

[11]  S. Havlin,et al.  Optimization of network robustness to waves of targeted and random attacks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Yabing Yao,et al.  Ranking the spreading influence of nodes in complex networks: An extended weighted degree centrality based on a remaining minimum degree decomposition , 2018, Physics Letters A.

[13]  Hiroki Sayama,et al.  Optimization of robustness and connectivity in complex networks. , 2003, Physical review letters.

[14]  Leibo Liu,et al.  Stochastic Analysis of Multiplex Boolean Networks for Understanding Epidemic Propagation , 2018, IEEE Access.

[15]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[16]  Dawei Zhao,et al.  Virus Propagation and Patch Distribution in Multiplex Networks: Modeling, Analysis, and Optimal Allocation , 2019, IEEE Transactions on Information Forensics and Security.

[17]  吴俊,et al.  Normalized entropy of rank distribution: a novel measure of heterogeneity of complex networks , 2007 .

[18]  Wu Jun,et al.  Natural Connectivity of Complex Networks , 2010 .

[19]  Huijia Li,et al.  Punishment diminishes the benefits of network reciprocity in social dilemma experiments , 2017, Proceedings of the National Academy of Sciences.

[20]  Shi Xiao,et al.  NISp1-06: On Intentional Attacks and Protections in Complex Communication Networks , 2006, IEEE Globecom 2006.

[21]  M. Xiong,et al.  Symmetry-based structure entropy of complex networks , 2007, 0710.0108.

[22]  Chang Liu,et al.  Improving the attack tolerance of scale-free networks by adding and hiding edges , 2011 .

[23]  Jürgen Kurths,et al.  Onymity promotes cooperation in social dilemma experiments , 2017, Science Advances.

[24]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[25]  S. Boccaletti,et al.  Winner-weaken-loser-strengthen rule leads to optimally cooperative interdependent networks , 2019 .

[26]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[27]  Stephanie Forrest,et al.  Email networks and the spread of computer viruses. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[29]  Chonghui Guo,et al.  Entropy optimization of scale-free networks’ robustness to random failures , 2005, cond-mat/0506725.

[30]  Alireza Abdollahpouri,et al.  Ranking nodes in complex networks based on local structure and improving closeness centrality , 2019, Neurocomputing.

[31]  Yoh Iwasa,et al.  Exploiting a cognitive bias promotes cooperation in social dilemma experiments , 2018, Nature Communications.

[32]  S. Boccaletti,et al.  Popularity enhances the interdependent network reciprocity , 2018, New Journal of Physics.

[33]  Zengqiang Chen,et al.  Error and attack tolerance of evolving networks with local preferential attachment , 2007 .