Bibliographic Review on Distributed Kalman Filtering

In recent years, a compelling need has arisen to understand the effects of distributed information structures on estimation and filtering. In this paper, a bibliographical review on distributed Kalman filtering (DKF) is provided.\ud The paper contains a classification of different approaches and methods involved to DKF. The applications of DKF are also discussed and explained separately. A comparison of different approaches is briefly carried out. Focuses on the contemporary research are also addressed with emphasis on the practical applications of the techniques. An exhaustive list of publications, linked directly or indirectly to DKF in the open literature, is compiled to provide an overall picture of different developing aspects of this area

Cooperative control of autonomous connected vehicles from a Networked Control perspective: Theory and experimental validation

Formation control of autonomous connected vehicles is one of the typical problems addressed in the general context of networked control systems. By leveraging this paradigm, a platoon composed by multiple connected and automated vehicles is represented as one-dimensional network of dynamical agents, in which each agent only uses its neighboring information to locally control its motion, while it aims to achieve certain global coordination with all other agents. Within this theoretical framework, control algorithms are traditionally designed based on an implicit assumption of unlimited bandwidth and perfect communication environments. However, in practice, wireless communication networks, enabling the cooperative driving applications, introduce unavoidable communication impairments such as transmission delay and packet losses that strongly affect the performances of cooperative driving. Moreover, in addition to this problem, wireless communication networks can suffer different security threats. The challenge in the control field is hence to design cooperative control algorithms that are robust to communication impairments and resilient to cyber attacks. The work aim is to tackle and solve these challenges by proposing different properly designed control strategies. They are validated both in analytical, numerical and experimental ways. Obtained results confirm the effectiveness of the strategies in coping with communication impairments and security vulnerabilities

Distributed two-time-scale methods over clustered networks

In this paper, we consider consensus problems over a network of nodes, where the network is divided into a number of clusters. We are interested in the case where the communication topology within each cluster is dense as compared to the sparse communication across the clusters. Moreover, each cluster has one leader which can communicate with other leaders in different clusters. The goal of the nodes is to agree at some common value under the presence of communication delays across the clusters. Our main contribution is to propose a novel distributed two-time-scale consensus algorithm, which pertains to the separation in network topology of clustered networks. In particular, one scale is to model the dynamic of the agents in each cluster, which is much faster (due to the dense communication) than the scale describing the slowly aggregated evolution between the clusters (due to the sparse communication). We prove the convergence of the proposed method in the presence of uniform, but possibly arbitrarily large, communication delays between the leaders. In addition, we provided an explicit formula for the convergence rate of such algorithm, which characterizes the impact of delays and the network topology. Our results shows that after a transient time characterized by the topology of each cluster, the convergence of the two-time-scale consensus method only depends on the connectivity of the leaders. Finally, we validate our theoretical results by a number of numerical simulations on different clustered networks

Structural engineering of evolving complex dynamical networks

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". 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.     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. 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. Based on the above results, a number of other areas and applications of network dynamics are studied and expounded upon in this thesis

On the Robust Control and Optimization Strategies for Islanded Inverter-Based Microgrids

In recent years, the concept of Microgrids (MGs) has become more popular due to a significant integration of renewable energy sources (RESs) into electric power systems. Microgrids are small-scale power grids consisting of localized grouping of heterogeneous Distributed Generators (DGs), storage systems, and loads. MGs may operate either in autonomous islanded mode or connected to the main power system. Despite the significant benefits of increasing RESs, many new challenges raise in controlling MGs. Hence, a three layered hierarchical architecture consisting of three control loops closed on the DGs dynamics has been introduced for MGs. The inner loop is called Primary Control (PC), and it provides the references for the DG’s DC-AC power converters. In general, the PC is implemented in a decentralized way with the aim to establish, by means of a droop control term, the desired sharing of power among DGs while preserving the MG stability. Then, because of inverterbased DGs have no inertia, a Secondary Control (SC) layer is needed to compensate the frequency and voltage deviations introduced by the PC’s droop control terms. Finally, an operation control is designed to optimize the operation of the MGs by providing power setpoints to the lower control layers. This thesis is mainly devoted to the design of robust distributed secondary frequency and voltage restoration control strategies for AC MGs to avoid central controllers and complexity of communication networks. Different distributed strategies are proposed in this work: (i) Robust Adaptive Distributed SC with Communication delays (ii) Robust Optimal Distributed Voltage SC with Communication Delays and (iii) Distributed Finite-Time SC by Coupled Sliding-Mode Technique. In all three proposed approaches, the problem is addressed in a multi-agent fashion where the generator plays the role of cooperative agents communicating over a network and physically coupled through the power system. The first approach provides an exponentially converging voltage and frequency restoration rate in the presence of both, model uncertainties, and multiple time-varying delays in the DGs’s communications. This approach consist of two terms: 1) a decentralized Integral Sliding Mode Control (ISMC) aimed to enforce each agent (DG) to behaves as reference unperturbed dynamic; 2) an ad-hoc designed distributed protocol aimed to globally, exponentially, achieves the frequency and voltage restoration while fulfilling the power-sharing constraints in spite of the communication delays. The second approach extends the first one by including an optimization algorithm to find the optimal control gains and estimate the corresponding maximum delay tolerated by the controlled system. In the third approach, the problem of voltage and frequency restoration as well as active power sharing are solved in finite-time by exploiting delay-free communications among DGs and considering model uncertainties. In this approach, for DGs with no direct access to their reference values, a finite-time distributed sliding mode estimator is implemented for both secondary frequency and voltage schemes. The estimator determines local estimates of the global reference values of the voltage and frequency for DGs in a finite time and provides this information for the distributed SC schemes. This dissertation also proposes a novel certainty Model Predictive Control (MPC) approach for the operation of islanded MG with very high share of renewable energy sources. To this aim, the conversion losses of storage units are formulated by quadratic functions to reduce the error in storage units state of charge prediction