Enabling controlling complex networks with local topological information

• Main Authors: Li, Guoqi, Deng, Lei, Xiao, Gaoxi, Tang, Pei, Wen, Changyun, Hu, Wuhua, Pei, Jing, Shi, Luping, Stanley, H. Eugene
• Other Authors: School of Electrical and Electronic Engineering
• Format: Article
• Language: English
• Published: 2018
• Subjects: Structural Controllability; Optimal Control
• Online Access: https://hdl.handle.net/10356/87366; http://hdl.handle.net/10220/45397
• Institution: Nanyang Technological University

Complex networks characterize the nature of internal/external interactions in real-world systems including social, economic, biological, ecological, and technological networks. Two issues keep as obstacles to fulfilling control of large-scale networks: structural controllability which describes the ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs; and optimal control, which is a typical control approach to minimize the cost for driving the network to a predefined state with a given number of control inputs. For large complex networks without global information of network topology, both problems remain essentially open. Here we combine graph theory and control theory for tackling the two problems in one go, using only local network topology information. For the structural controllability problem, a distributed local-game matching method is proposed, where every node plays a simple Bayesian game with local information and local interactions with adjacent nodes, ensuring a suboptimal solution at a linear complexity. Starring from any structural controllability solution, a minimizing longest control path method can efficiently reach a good solution for the optimal control in large networks. Our results provide solutions for distributed complex network control and demonstrate a way to link the structural controllability and optimal control together.