Bounded Stability in Networked Systems with Parameter Mismatch and Adaptive Decentralized Estimation

Here, we study the ultimately bounded stability of network of mismatched systems using Lyapunov direct method. The upper bound on the error of oscillators from the center of the neighborhood is derived. Then the performance of an adaptive compensation via decentralized control is analyzed. Finally, the analytical results for a network of globally connected Lorenz oscillators are verified.Comment: 6 pages, 3 figures, Accepted and presented in IEEE Conference Allerton 201

Attitude Synchronization of Spacecraft Formation with Optimization and Adaptation of Consensus Penalty Terms

The contribution of this thesis is on the temporal adjustment of the consensus weights, as applied to spacecraft formation control. Such an objective is attained by dynamically enforcing attitude synchronization via coupling terms included in each spacecraft controller. It is assumed that each spacecraft has identical dynamics but with unknown inertia parameters and external disturbances. By augmenting a standard adaptive controller that accounts for the unknown parameters, made feasible via an assumption on parameterization, with adaptation of the consensus weights, one opts to improve spacecraft synchronization. The coupling terms, responsible for enforcing synchronization amongst spacecraft, are weighted dynamically in proportion to the disagreement between the states of the spacecraft. The time adjustment of edge-dependent gains as well as the special cases of node-dependent and agent-independent constant gains are derived using Lyapunov redesign methods. The proposed adaptive control architectures which allow for adaptation of both parameter uncertainties and consensus penalty terms are demonstrated via extensive numerical studies of spacecraft networks with limited connectivity. By considering the sum of deviation-from-the-mean and rotational kinetic energy as appropriate metrics for synchronization and controller performance, the numerical studies also provide insights on the choice of optimal consensus gains

Distributed Fault Diagnosis of Interconnected Nonlinear Uncertain Systems

Fault diagnosis is crucial in achieving safe and reliable operations of interconnected control systems. This dissertation presents a distributed fault detection and isolation (FDI) method for interconnected nonlinear uncertain systems. The contributions of this dissertation include the following: First, the detection and isolation problem of process faults in a class of interconnected input-output nonlinear uncertain systems is investigated. A novel fault detection and isolation scheme is devised, and the fault detectability and isolability conditions are rigorously investigated, characterizing the class of faults in each subsystem that are detectable and isolable by the proposed distributed FDI method. Second, a distributed sensor fault FDI scheme is developed in a class of interconnected input-output nonlinear systems where only the measurable part of state variables are directly affected by the interconnections between subsystems. A class of multimachine power systems is used as an application example to illustrate the effectiveness of the proposed approach. Third, the previous results are extended to a class of interconnected input-output nonlinear systems where both the unknown and the measurable part of system states of each subsystem are directly affected by the interconnections between subsystems. In this case, the fault propagation effect among subsystems directly affects the unknown part of state variables of each subsystem. Thus, the problem considered is more challenging than what is described above. Finally, a fault detection scheme is presented for a more general distributed nonlinear systems. With a removal of a restrictive limitation on the system model structure, the results described above are extended to a class of interconnected nonlinear uncertain systems with a more general structure. In addition, the effectiveness of the above fault diagnosis schemes is illustrated by using simulations of interconnected inverted pendulums mounted on carts and multi-machine power systems. Different fault scenarios are considered to verify the diagnosis performances, and the satisfactory performances of the proposed diagnosis scheme are validated by the good simulation results. Some interesting future research work is also discussed

Fault diagnosis for uncertain networked systems

Fault diagnosis has been at the forefront of technological developments for several decades. Recent advances in many engineering fields have led to the networked interconnection of various systems. The increased complexity of modern systems leads to a larger number of sources of uncertainty which must be taken into consideration and addressed properly in the design of monitoring and fault diagnosis architectures. This chapter reviews a model-based distributed fault diagnosis approach for uncertain nonlinear large-scale networked systems to specifically address: (a) the presence of measurement noise by devising a filtering scheme for dampening the effect of noise; (b) the modeling of uncertainty by developing an adaptive learning scheme; (c) the uncertainty issues emerging when considering networked systems such as the presence of delays and packet dropouts in the communication networks. The proposed architecture considers in an integrated way the various components of complex distributed systems such as the physical environment, the sensor level, the fault diagnosers, and the communication networks. Finally, some actions taken after the detection of a fault, such as the identification of the fault location and its magnitude or the learning of the fault function, are illustrated

Stability and Control in Complex Networks of Dynamical Systems

Stability analysis of networked dynamical systems has been of interest in many disciplines such as biology and physics and chemistry with applications such as LASER cooling and plasma stability. These large networks are often modeled to have a completely random (Erdös-Rényi) or semi-random (Small-World) topologies. The former model is often used due to mathematical tractability while the latter has been shown to be a better model for most real life networks. The recent emergence of cyber physical systems, and in particular the smart grid, has given rise to a number of engineering questions regarding the control and optimization of such networks. Some of the these questions are: How can the stability of a random network be characterized in probabilistic terms? Can the effects of network topology and system dynamics be separated? What does it take to control a large random network? Can decentralized (pinning) control be effective? If not, how large does the control network needs to be? How can decentralized or distributed controllers be designed? How the size of control network would scale with the size of networked system? Motivated by these questions, we began by studying the probability of stability of synchronization in random networks of oscillators. We developed a stability condition separating the effects of topology and node dynamics and evaluated bounds on the probability of stability for both Erdös-Rényi (ER) and Small-World (SW) network topology models. We then turned our attention to the more realistic scenario where the dynamics of the nodes and couplings are mismatched. Utilizing the concept of ε-synchronization, we have studied the probability of synchronization and showed that the synchronization error, ε, can be arbitrarily reduced using linear controllers. We have also considered the decentralized approach of pinning control to ensure stability in such complex networks. In the pinning method, decentralized controllers are used to control a fraction of the nodes in the network. This is different from traditional decentralized approaches where all the nodes have their own controllers. While the problem of selecting the minimum number of pinning nodes is known to be NP-hard and grows exponentially with the number of nodes in the network we have devised a suboptimal algorithm to select the pinning nodes which converges linearly with network size. We have also analyzed the effectiveness of the pinning approach for the synchronization of oscillators in the networks with fast switching, where the network links disconnect and reconnect quickly relative to the node dynamics. To address the scaling problem in the design of distributed control networks, we have employed a random control network to stabilize a random plant network. Our results show that for an ER plant network, the control network needs to grow linearly with the size of the plant network

Gossip Algorithms for Distributed Signal Processing

Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This article presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.Comment: Submitted to Proceedings of the IEEE, 29 page