Distributed Cooperative Control of Multi-Agent Systems Under Detectability and Communication Constraints

Cooperative control of multi-agent systems has recently gained widespread attention from the scientific communities due to numerous applications in areas such as the formation control in unmanned vehicles, cooperative attitude control of spacecrafts, clustering of micro-satellites, environmental monitoring and exploration by mobile sensor networks, etc. The primary goal of a cooperative control problem for multi-agent systems is to design a decentralized control algorithm for each agent, relying on the local coordination of their actions to exhibit a collective behavior. Common challenges encountered in the study of cooperative control problems are unavailable group-level information, and limited bandwidth of the shared communication. In this dissertation, we investigate one of such cooperative control problems, namely cooperative output regulation, under various local and global level constraints coming from physical and communication limitations. The objective of the cooperative output regulation problem (CORP) for multi-agent systems is to design a distributed control strategy for the agents to synchronize their state with an external system, called the leader, in the presence of disturbance inputs. For the problem at hand, we additionally consider the scenario in which none of the agents can independently access the synchronization signal from their view of the leader, and therefore it is not possible for the agents to achieve the group objective by themselves unless they cooperate among members. To this end, we devise a novel distributed estimation algorithm to collectively gather the leader states under the discussed detectability constraint, and then use this estimation to synthesize a distributed control solution to the problem. Next, we extend our results in CORP to the case with uncertain agent dynamics arising from modeling errors. In addition to the detectability constraint, we also assumed that the local regulated error signals are not available to the agents for feedback, and thus none of the agents have all the required measurements to independently synthesize a control solution. By combining the distributed observer and a control law based on the internal model principle for the agents, we offer a solution to the robust CORP under these added constraints. In practical applications of multi-agent systems, it is difficult to consistently maintain a reliable communication between the agents. By considering such challenge in the communication, we study the CORP for the case when agents are connected through a time-varying communication topology. Due to the presence of the detectability constraint that none of the agents can independently access all the leader states at any switching instant, we devise a distributed estimation algorithm for the agents to collectively reconstruct the leader states. Then by using this estimation, a distributed dynamic control solution is offered to solve the CORP under the added communication constraint. Since the fixed communication network is a special case of this time-varying counterpart, the offered control solution can be viewed as a generalization of the former results. For effective validation of previous theoretical results, we apply the control algorithms to a practical case study problem on synchronizing the position of networked motors under time-varying communication. Based on our experimental results, we also demonstrate the uniqueness of derived control solutions. Another communication constraint affecting the cooperative control performance is the presence of network delays. To this regard, first we study the distributed state estimation problem of an autonomous plant by a network of observers under heterogeneous time-invariant delays and then extend to the time-varying counterpart. With the use of a low gain based estimation technique, we derive a sufficient stability condition in terms of the upper bound of the low gain parameter or the time delay to guarantee the convergence of estimation errors. Additionally, when the plant measurements are subject to bounded disturbances, we find that that the local estimation errors also remain bounded. Lastly, by using this estimation, we present a distributed control solution for a leader-follower synchronization problem of a multi-agent system. Next, we present another case study concerning a synchronization control problem of a group of distributed generators in an islanded microgrid under unknown time-varying latency. Similar to the case of delayed communication in aforementioned works, we offer a low gain based distributed control protocol to synchronize the terminal voltage and inverter operating frequency

Dynamical Systems

Complex systems are pervasive in many areas of science integrated in our daily lives. Examples include financial markets, highway transportation networks, telecommunication networks, world and country economies, social networks, immunological systems, living organisms, computational systems and electrical and mechanical structures. Complex systems are often composed of a large number of interconnected and interacting entities, exhibiting much richer global scale dynamics than the properties and behavior of individual entities. Complex systems are studied in many areas of natural sciences, social sciences, engineering and mathematical sciences. This special issue therefore intends to contribute towards the dissemination of the multifaceted concepts in accepted use by the scientific community. We hope readers enjoy this pertinent selection of papers which represents relevant examples of the state of the art in present day research. [...

18th IEEE Workshop on Nonlinear Dynamics of Electronic Systems: Proceedings

Proceedings of the 18th IEEE Workshop on Nonlinear Dynamics of Electronic Systems, which took place in Dresden, Germany, 26 – 28 May 2010.:Welcome Address ........................ Page I Table of Contents ........................ Page III Symposium Committees .............. Page IV Special Thanks ............................. Page V Conference program (incl. page numbers of papers) ................... Page VI Conference papers Invited talks ................................ Page 1 Regular Papers ........................... Page 14 Wednesday, May 26th, 2010 ......... Page 15 Thursday, May 27th, 2010 .......... Page 110 Friday, May 28th, 2010 ............... Page 210 Author index ............................... Page XII

Cooperative Control Reconfiguration in Networked Multi-Agent Systems

Development of a network of autonomous cooperating vehicles has attracted significant attention during the past few years due to its broad range of applications in areas such as autonomous underwater vehicles for exploring deep sea oceans, satellite formations for space missions, and mobile robots in industrial sites where human involvement is impossible or restricted, to name a few. Motivated by the stringent specifications and requirements for depth, speed, position or attitude of the team and the possibility of having unexpected actuators and sensors faults in missions for these vehicles have led to the proposed research in this thesis on cooperative fault-tolerant control design of autonomous networked vehicles. First, a multi-agent system under a fixed and undirected network topology and subject to actuator faults is studied. A reconfigurable control law is proposed and the so-called distributed Hamilton-Jacobi-Bellman equations for the faulty agents are derived. Then, the reconfigured controller gains are designed by solving these equations subject to the faulty agent dynamics as well as the network structural constraints to ensure that the agents can reach a consensus even in presence of a fault while simultaneously the team performance index is minimized. Next, a multi-agent network subject to simultaneous as well as subsequent actuator faults and under directed fixed topology and subject to bounded energy disturbances is considered. An H∞ performance fault recovery control strategy is proposed that guarantees: the state consensus errors remain bounded, the output of the faulty system behaves exactly the same as that of the healthy system, and the specified H∞ performance bound is guaranteed to be minimized. Towards this end, the reconfigured control law gains are selected first by employing a geometric control approach where a set of controllers guarantees that the output of the faulty agent imitates that of the healthy agent and the consensus achievement objectives are satisfied. Then, the remaining degrees of freedom in the selection of the control law gains are used to minimize the bound on a specified H∞ performance index. Then, control reconfiguration problem in a team subject to directed switching topology networks as well as actuator faults and their severity estimation uncertainties is considered. The consensus achievement of the faulty network is transformed into two stability problems, in which one can be solved offline while the other should be solved online and by utilizing information that each agent has received from the fault detection and identification module. Using quadratic and convex hull Lyapunov functions the control gains are designed and selected such that the team consensus achievement is guaranteed while the upper bound of the team cost performance index is minimized. Finally, a team of non-identical agents subject to actuator faults is considered. A distributed output feedback control strategy is proposed which guarantees that agents outputs’ follow the outputs of the exo-system and the agents states remains stable even when agents are subject to different actuator faults

Finding structures in information networks using the affinity network

This thesis proposes a novel graphical model for inference called the Affinity Network,which displays the closeness between pairs of variables and is an alternative to Bayesian Networks and Dependency Networks. The Affinity Network shares some similarities with Bayesian Networks and Dependency Networks but avoids their heuristic and stochastic graph construction algorithms by using a message passing scheme. A comparison with the above two instances of graphical models is given for sparse discrete and continuous medical data and data taken from the UCI machine learning repository. The experimental study reveals that the Affinity Network graphs tend to be more accurate on the basis of an exhaustive search with the small datasets. Moreover, the graph construction algorithm is faster than the other two methods with huge datasets. The Affinity Network is also applied to data produced by a synchronised system. A detailed analysis and numerical investigation into this dynamical system is provided and it is shown that the Affinity Network can be used to characterise its emergent behaviour even in the presence of noise

Invariant manifold theory for impulsive functional differential equations with applications

The primary contribution of this thesis is a development of invariant manifold theory for impulsive functional differential equations. We begin with an in-depth analysis of linear systems, immersed in a nonautonomous dynamical systems framework. We prove a variation-of-constants formula, introduce appropriate generalizations of stable, centre and unstable subspaces, and develop a Floquet theory for periodic systems. Using the Lyapunov-Perron method, we prove the existence of local centre manifolds at a nonhyperbolic equilibrium of nonlinear impulsive functional differential equations. Using a formal differentiation procedure in conjunction with machinery from functional analysis -- specifically, contraction mappings on scales of Banach spaces -- we prove that the centre manifold is smooth in the state space. By introducing a coordinate system, we are able to prove that the coefficients of any Taylor expansion of the local centre manifold are unique and sufficiently regular in the time and lag arguments that they can be computed by solving an impulsive boundary-value problem. After proving a reduction principle, this leads naturally to explorations into bifurcation theory, where we establish generalizations of the classical fold and Hopf bifurcations for impulsive delay differential equations. Aside from the centre manifold, we demonstrate the existence and smoothness of stable and unstable manifolds and prove a linearized stability theorem. One of the applications of the theory above is an analysis of a SIR model with pulsed vaccination and finite temporary immunity modeled by a discrete delay. We determine an analytical stability criteria for the disease-free equilibrium and prove the existence of a transcritical bifurcation of periodic solutions at some critical vaccination coverage level for generic system parameters. Then, using numerical continuation and a monodromy operator discretization scheme, we track the bifurcating endemic periodic solution until a Hopf point is identifed. A cylinder bifurcation is observed; the periodic orbit expands into a cylinder in the extended phase space before eventually contracting onto a periodic orbit as the vaccination coverage vanishes. The other application is an impulsive stabilization method based on centre manifold reduction and optimization principles. Assuming a cost structure on the impulsive controller and a desired convergence rate target, we prove that under certain conditions there is always an impulsive controller that can stabilize a nonhyperbolic equilibrium with a trivial unstable subspace, robustly with respect to parameter perturbation, while guaranteeing a minimal cost. We then exploit the low-dimensionality of the centre manifold to develop a two-stage program that can be implemented to compute the optimal controller. To demonstrate the effectiveness of the two-stage program, which we call the centre probe method, we use the method to stabilize a complex network of 100 diffusively coupled nodes at a Hopf point. The cost structure is one that assigns higher cost to controlling of nodes that have more neighbours, while the jump functionals are required to be diagonal -- that is, they do not introduce further coupling. We also introduce a secondary goal, which is that the number of nodes that are controlled is minimized