Structural engineering of evolving complex dynamical networks
Creators: name: Moradiamani, Ali
Publisher: name: RMIT University
Year: 2024
Subjects: classificationCode: 400702
subject: Automation engineering

description: Networks are ubiquitous in nature and many natural and man-made systems can be modelled as networked systems. Complex networks, systems comprising a number of nodes that are connected through edges, have been frequently used to model large-scale systems from various disciplines such as biology, ecology, and engineering. Dynamical systems interacting through a network may exhibit collective behaviours such as synchronisation, consensus, opinion formation, flocking and unusual phase transitions. Evolution of such collective behaviours is highly dependent on the structure of the interaction network. Optimisation of network topology to improve collective behaviours and network robustness can be achieved by intelligently modifying the network structure. Here, it is referred to as "Engineering of the Network".<br><br>Although coupled dynamical systems can develop spontaneous synchronous patterns if their coupling strength lies in an appropriate range, in some applications one needs to control a fraction of nodes, known as driver nodes, in order to facilitate the synchrony. This thesis addresses the problem of identifying the set of best drivers, leading to the best pinning control performance. The eigen-ratio of the augmented Laplacian matrix, that is the largest eigenvalue divided by the second smallest one, is chosen as the controllability metric. The approach introduced in this thesis is to obtain the set of optimal drivers based on sensitivity analysis of the eigen-ratio, which requires only a single computation of the eigenvector associated with the largest eigenvalue, and thus is applicable for large-scale networks. This leads to a new "controllability centrality" metric for each subset of nodes. Simulation results reveal the effectiveness of the proposed metric in predicting the most important driver(s) correctly. <br>    <br>Interactions in complex networks might also facilitate the propagation of undesired effects, such as node/edge failure, which may crucially affect the performance of collective behaviours. In order to study the effect of node failure on network synchronisation, an analytical metric is proposed that measures the effect of a node removal on any desired eigenvalue of the Laplacian matrix. Using this metric, which is based on the local multiplicity of each eigenvalue at each node, one can approximate the impact of any node removal on the spectrum of a graph. The metric is computationally efficient as it only needs a single eigen-decomposition of the Laplacian matrix. It also provides a reliable approximation for the "Laplacian energy" of a network. Simulation results verify the accuracy of this metric in networks with different topologies.<br><br>This thesis also considers formation control as an application of network synchronisation and studies the "rigidity maintenance" problem, which is one of the major challenges in this field. This problem is to preserve the rigidity of the sensing graph in a formation during motion, taking into consideration constraints such as line-of-sight requirements, sensing ranges and power limitations. By introducing a "Lattice of Configurations" for each node, a distributed rigidity maintenance algorithm is proposed to preserve the rigidity of the sensing network when failure in a sensing link would result in loss of rigidity. The proposed algorithm recovers rigidity by activating, almost always, the minimum number of new sensing links and considers real-time constraints of practical formations. A sufficient condition for this problem is proved and tested via numerical simulations.<br> <br>Based on the above results, a number of other areas and applications of network dynamics are studied and expounded upon in this thesis.