Constrained Binary Optimization Approach for Pinned Node Selection in Pinning Control of Complex Dynamical Networks

• Published in: Axioms Vol. 12; no. 12; p. 1088
• Main Authors: Alanis, Alma Y., Hernandez-Barragan, Jesus, Ríos-Rivera, Daniel, Sanchez, Oscar D., Martinez-Soltero, Gabriel
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.11.2023
• Subjects: Algorithms; binary optimization; combinatorial optimization; Comparative studies; complex dynamical networks; Complex systems; Constraints; Genetic algorithms; Heuristic methods; Mathematical optimization; Mathematical research; Networks; Nodes; Nonlinear dynamics; Optimization; Optimization algorithms; Optimization techniques; Pinning; pinning control; State-of-the-art reviews; Systems stability; Mexico
• ISSN: 2075-1680; 2075-1680
• DOI: 10.3390/axioms12121088

In complex dynamical networks, pinning control techniques are often applied to control a small fraction of the nodes in order to stabilize the network with reduced control effort and energy, facilitating adequate development of the complex network. Selecting the controlled nodes is a key challenge to achieving optimal performance. Theoretical analysis of the network provides the minimum quantity of nodes to control but does not specify which ones should be controlled. Analytically, controllability analysis of the entire network would be ideal, but this becomes difficult for complex networks with a large number of nodes and non-linear dynamics. Another option is to evaluate all possible combinations with the minimum number of necessary nodes or the nodes that can be controlled, but this presents a computational challenge due to the large number of possible combinations. Therefore, the remaining option is the use of metaheuristic algorithms for the rapid and practical evaluation of these combinations. In this work, we propose to optimize the selection of nodes for pinning control based on binary optimization algorithms, subject to control and development constraints. The proposed approach involves finding a binary combination with a fixed number of controlled nodes that best stabilizes the network state to zero. This paper includes a comparative study among state-of-the-art binary optimization algorithms and modified classic optimization algorithms. The applicability of the proposed approach is validated through simulations considering a dynamical discrete-time complex network.