Figure 1
From: Enabling Controlling Complex Networks with Local Topological Information
Two basic problems in controlling complex networks. (a) An essential issue interconnecting graph theory and control theory: how to provide a link from “structural controllability” to “optimal cost control”. (b) Illustration of the local topological information available to a node in a network. For a node x0 with neighbor nodes x1, x2, x3 and x4, it is assumed that the node x0 can only observe the numbers of incoming and outgoing links connected to each of the nodes x1, x2, x3 and x4. (c) Optimal cost control aims to determine a solution of driving a system state to any predefined state with minimum cost.
