Coordination of multi-agent systems: stability via nonlinear Perron-Frobenius theory and consensus for desynchronization and dynamic estimation.

This thesis addresses a variety of problems that arise in the study of complex networks composed by multiple interacting agents, usually called multi-agent systems (MASs). Each agent is modeled as a dynamical system whose dynamics is fully described by a state-space representation. In the first part the focus is on the application to MASs of recent results that deal with the extensions of Perron-Frobenius theory to nonlinear maps. In the shift from the linear to the nonlinear framework, Perron-Frobenius theory considers maps being order-preserving instead of matrices being nonnegative. The main contribution is threefold. First of all, a convergence analysis of the iterative behavior of two novel classes of order-preserving nonlinear maps is carried out, thus establishing sufficient conditions which guarantee convergence toward a fixed point of the map: nonnegative row-stochastic matrices turns out to be a special case. Secondly, these results are applied to MASs, both in discrete and continuous-time: local properties of the agents' dynamics have been identified so that the global interconnected system falls into one of the above mentioned classes, thus guaranteeing its global stability. Lastly, a sufficient condition on the connectivity of the communication network is provided to restrict the set of equilibrium points of the system to the consensus points, thus ensuring the agents to achieve consensus. These results do not rely on standard tools (e.g., Lyapunov theory) and thus they constitute a novel approach to the analysis and control of multi-agent dynamical systems. In the second part the focus is on the design of dynamic estimation algorithms in large networks which enable to solve specific problems. The first problem consists in breaking synchronization in networks of diffusively coupled harmonic oscillators. The design of a local state feedback that achieves desynchronization in connected networks with arbitrary undirected interactions is provided. The proposed control law is obtained via a novel protocol for the distributed estimation of the Fiedler vector of the Laplacian matrix. The second problem consists in the estimation of the number of active agents in networks wherein agents are allowed to join or leave. The adopted strategy consists in the distributed and dynamic estimation of the maximum among numbers locally generated by the active agents and the subsequent inference of the number of the agents that took part in the experiment. Two protocols are proposed and characterized to solve the consensus problem on the time-varying max value. The third problem consists in the average state estimation of a large network of agents where only a few agents' states are accessible to a centralized observer. The proposed strategy projects the dynamics of the original system into a lower dimensional state space, which is useful when dealing with large-scale systems. Necessary and sufficient conditions for the existence of a linear and a sliding mode observers are derived, along with a characterization of their design and convergence properties

Average Consensus in Multiagent Systems with the Problem of Packet Losses When Using the Second-Order Neighbors’ Information

This paper mainly investigates the average consensus of multiagent systems with the problem of packet losses when both the first-order neighbors’ information and the second-order neighbors’ information are used. The problem is formulated under the sampled-data framework by discretizing the first-order agent dynamics with a zero-order hold. The communication graph is undirected and the loss of data across each communication link occurs at certain probability, which is governed by a Bernoulli process. It is found that the distributed average consensus speeds up by using the second-order neighbors’ information when packets are lost. Numerical examples are given to demonstrate the effectiveness of the proposed methods

Semiglobal observer-based leader- following consensus with input saturation

published_or_final_versio

COOPERATIVE AND CONSENSUS-BASED CONTROL FOR A TEAM OF MULTI-AGENT SYSTEMS

Cooperative control has attracted a noticeable interest in control systems community due to its numerous applications in areas such as formation flying of unmanned aerial vehicles, cooperative attitude control of spacecraft, rendezvous of mobile robots, unmanned underwater vehicles, traffic control, data network congestion control and routing. Generally, in any cooperative control of multi-agent systems one can find a set of locally sensed information, a communication network with limited bandwidth, a decision making algorithm, and a distributed computational capability. The ultimate goal of cooperative systems is to achieve consensus or synchronization throughout the team members while meeting all communication and computational constraints. The consensus problem involves convergence of outputs or states of all agents to a common value and it is more challenging when the agents are subjected to disturbances, measurement noise, model uncertainties or they are faulty. This dissertation deals with the above mentioned challenges and has developed methods to design distributed cooperative control and fault recovery strategies in multi-agent systems. Towards this end, we first proposed a transformation for Linear Time Invariant (LTI) multi-agent systems that facilitates a systematic control design procedure and make it possible to use powerful Lyapunov stability analysis tool to guarantee its consensus achievement. Moreover, Lyapunov stability analysis techniques for switched systems are investigated and a novel method is introduced which is well suited for designing consensus algorithms for switching topology multi-agent systems. This method also makes it possible to deal with disturbances with limited root mean square (RMS) intensities. In order to decrease controller design complexity, a iii method is presented which uses algebraic connectivity of the communication network to decouple augmented dynamics of the team into lower dimensional parts, which allows one to design the consensus algorithm based on the solution to an algebraic Riccati equation with the same order as that of agent. Although our proposed decoupling method is a powerful approach to reduce the complexity of the controller design, it is possible to apply classical pole placement methods to the transformed dynamics of the team to develop and obtain controller gains. The effects of actuator faults in consensus achievement of multi-agent systems is investigated. We proposed a framework to quantitatively study actuator loss-of-effectiveness effects in multi-agent systems. A fault index is defined based on information on fault severities of agents and communication network topology, and sufficient conditions for consensus achievement of the team are derived. It is shown that the stability of the cooperative controller is linked to the fault index. An optimization problem is formulated to minimize the team fault index that leads to improvements in the performance of the team. A numerical optimization algorithm is used to obtain the solutions to the optimal problem and based on the solutions a fault recovery strategy is proposed for both actuator saturation and loss-of-effectiveness fault types. Finally, to make our proposed methodology more suitable for real life scenarios, the consensus achievement of a multi-agent team in presence of measurement noise and model uncertainties is investigated. Towards this end, first a team of LTI agents with measurement noise is considered and an observer based consensus algorithm is proposed and shown that the team can achieve H∞ output consensus in presence of both bounded RMS disturbance input and measurement noise. In the next step a multi-agent team with both linear and Lipschitz nonlinearity uncertainties is studied and a cooperative control algorithm is developed. An observer based approach is also developed to tackle consensus achievement problem in presence of both measurement noise and model uncertainties

Model Predictive Control of Highway Emergency Maneuvering and Collision Avoidance

Autonomous emergency maneuvering (AEM) is an active safety system that automates safe maneuvers to avoid imminent collision, particularly in highway driving situations. Uncertainty about the surrounding vehicles’ decisions and also about the road condition, which has significant effects on the vehicle’s maneuverability, makes it challenging to implement the AEM strategy in practice. With the rise of vehicular networks and connected vehicles, vehicles would be able to share their perception and also intentions with other cars. Therefore, cooperative AEM can incor- porate surrounding vehicles’ decisions and perceptions in order to improve vehicles’ predictions and estimations and thereby provide better decisions for emergency maneuvering. In this thesis, we develop an adaptive, cooperative motion planning scheme for emergency maneuvering, based on the model predictive control (MPC) approach, for vehicles within a ve- hicular network. The proposed emergency maneuver planning scheme finds the best combination of longitudinal and lateral maneuvers to avoid imminent collision with surrounding vehicles and obstacles. To implement real-time MPC for the non-convex problem of collision free motion planning, safety constraints are suggested to be convexified based on the road geometry. To take advantage of vehicular communication, the surrounding vehicles’ decisions are incorporated in the prediction model to improve the motion planning results. The MPC approach is prone to loss of feasibility due to the limited prediction horizon for decision-making. For the autonomous vehicle motion planning problem, many of detected ob- stacles, which are beyond the prediction horizon, cannot be considered in the instantaneous de- cisions, and late consideration of them may cause infeasibility. The conditions that guarantee persistent feasibility of a model predictive motion planning scheme are studied in this thesis. Maintaining the system’s states in a control invariant set of the system guarantees the persis- tent feasibility of the corresponding MPC scheme. Specifically, we present two approaches to compute control invariant sets of the motion planning problem; the linearized convexified ap- proach and the brute-force approach. The resulting computed control invariant sets of these two approaches are compared with each other to demonstrate the performance of the proposed algorithm. Time-variation of the road condition affects the vehicle dynamics and constraints. Therefore, it necessitates the on-line identification of the road friction parameter and implementation of an adaptive emergency maneuver motion planning scheme. In this thesis, we investigate coopera- tive road condition estimation in order to improve collision avoidance performance of the AEM system. Each vehicle estimates the road condition individually, and disseminates it through the vehicular network. Accordingly, a consensus estimation algorithm fuses the individual estimates to find the maximum likelihood estimate of the road condition parameter. The performance of the proposed cooperative road condition estimation has been validated through simulations

Robust Observation and Control of Complex Networks

The problem of understanding when individual actions of interacting agents display to a coordinated collective behavior has receiving a considerable attention in many research fields. Especially in control engineering, distributed applications in cooperative environments are achieving resounding success, due to the large number of relevant applications, such as formation control, attitude synchronization tasks and cooperative applications in large-scale systems. Although those problems have been extensively studied in Literature, themost of classic approaches use to consider the unrealistic scenario in which networks always consist of identical, linear, time-invariant entities. It’s clear that this assumption strongly approximates the effective behavior of a network. In fact agents can be subjected to parameter uncertainties, unmodeled dynamics or simply characterized by proper nonlinear dynamics. Therefore, motivated by those practical problems, the present Thesis proposes various approaches for dealing with the problem of observation and control in both the framework of multi-agents and complex interconnected systems. The main contributions of this Thesis consist on the development of several algorithms based on concepts of discontinuous slidingmode control. This techniques can be employed for solving in finite-time problems of robust state estimation and consensus-based synchronization in network of heterogenous nonlinear systems subjected to unknown but bounded disturbances and sudden topological changes. Both directed and undirected topologies have been taken into account. It is worth to mention also the extension of the consensus problem to networks of agents governed by a class parabolic partial differential equation, for which, for the first time, a boundary-based robust local interaction protocol has been presented

Robust Observation and Control of Complex Networks

The problem of understanding when individual actions of interacting agents display to a coordinated collective behavior has receiving a considerable attention in many research fields. Especially in control engineering, distributed applications in cooperative environments are achieving resounding success, due to the large number of relevant applications, such as formation control, attitude synchronization tasks and cooperative applications in large-scale systems. Although those problems have been extensively studied in Literature, themost of classic approaches use to consider the unrealistic scenario in which networks always consist of identical, linear, time-invariant entities. It’s clear that this assumption strongly approximates the effective behavior of a network. In fact agents can be subjected to parameter uncertainties, unmodeled dynamics or simply characterized by proper nonlinear dynamics. Therefore, motivated by those practical problems, the present Thesis proposes various approaches for dealing with the problem of observation and control in both the framework of multi-agents and complex interconnected systems. The main contributions of this Thesis consist on the development of several algorithms based on concepts of discontinuous slidingmode control. This techniques can be employed for solving in finite-time problems of robust state estimation and consensus-based synchronization in network of heterogenous nonlinear systems subjected to unknown but bounded disturbances and sudden topological changes. Both directed and undirected topologies have been taken into account. It is worth to mention also the extension of the consensus problem to networks of agents governed by a class parabolic partial differential equation, for which, for the first time, a boundary-based robust local interaction protocol has been presented