Distributed Fault-Tolerant Consensus Tracking Control of Multi-Agent Systems under Fixed and Switching Topologies

This paper proposes a novel distributed fault-tolerant consensus tracking control design for multi-agent systems with abrupt and incipient actuator faults under fixed and switching topologies. The fault and state information of each individual agent is estimated by merging unknown input observer in the decentralized fault estimation hierarchy. Then, two kinds of distributed fault-tolerant consensus tracking control schemes with average dwelling time technique are developed to guarantee the mean-square exponential consensus convergence of multi-agent systems, respectively, on the basis of the relative neighboring output information as well as the estimated information in fault estimation. Simulation results demonstrate the effectiveness of the proposed fault-tolerant consensus tracking control algorithm

Cooperative Control of Nonlinear Multi-Agent Systems

Multi-agent systems have attracted great interest due to their potential applications in a variety of areas. In this dissertation, a nonlinear consensus algorithm is developed for networked Euler-Lagrange multi-agent systems. The proposed consensus algorithm guarantees that all agents can reach a common state in the workspace. Meanwhile, the external disturbances and structural uncertainties are fundamentally considered in the controller design. The robustness of the proposed consensus algorithm is then demonstrated in the stability analysis. Furthermore, experiments are conducted to validate the effectiveness of the proposed consensus algorithm. Next, a distributed leader-follower formation tracking controller is developed for networked nonlinear multi-agent systems. The dynamics of each agent are modeled by Euler-Lagrange equations, and all agents are guaranteed to track a desired time-varying trajectory in the presence of noise. The fault diagnosis strategy of the nonlinear multi-agent system is also investigated with the help of differential geometry tools. The effectiveness of the proposed controller is verified through simulations. To further extend the application area of the multi-agent technique, a distributed robust controller is then developed for networked Lipschitz nonlinear multi-agent systems. With the appearance of system uncertainties and external disturbances, a sampled-data feedback control protocol is carried out through the Lyapunov functional approach. The effectiveness of the proposed controller is verified by numerical simulations. Other than the robustness and sampled-data information exchange, this dissertation is also concerned with the event-triggered consensus problem for the Lipschitz nonlinear multi-agent systems. Furthermore, the sufficient condition for the stochastic stabilization of the networked control system is proposed based on the Lyapunov functional method. Finally, simulation is conducted to demonstrate the effectiveness of the proposed control algorithm. In this dissertation, the cooperative control of networked Euler-Lagrange systems and networked Lipschitz systems is investigated essentially with the assistance of nonlinear control theory and diverse controller design techniques. The main objective of this work is to propose realizable control algorithms for nonlinear multi-agent systems

Optimal control approaches for consensus and path planning in multi-agent systems

Optimal control is one of the most powerful, important and advantageous topics in control engineering. The two challenges in every optimal control problem are defining the proper cost function and obtaining the best method to minimize it. In this study, innovative optimal control approaches are developed to solve the two problems of consensus and path planning in multi-agent systems (MASs). The consensus problem for general Linear-Time Invariant systems is solved by implementing an inverse optimal control approach which enables us to start by deriving a control law based on the stability and optimality condition and then according to the derived control define the cost function. We will see that this method in which the cost function is not specified a priori as the conventional optimal control design has the benefit that the resulting control law is guaranteed to be both stabilizing and optimal. Three new theorems in related linear algebra are developed to enable us to use the algorithm for all the general LTI systems. The designed optimal control is distributed and only needs local neighbor-to-neighbor information based on the communication topology to make the agents achieve consensus and track a desired trajectory. Path planning problem is solved for a group are Unmanned Aerial Vehicles (UAVs) that are assigned to track the fronts of a fires in a process of wildfire management. We use Partially Observable Markov Decision Process (POMDP) in order to minimize the cost function that is defined according to the tracking error. Here the challenge is designing the algorithm such that (1) the UAVs are able to make decisions autonomously on which fire front to track and (2) they are able to track the fire fronts which evolve over time in random directions. We will see that by defining proper models, the designed algorithms provides real-time calculation of control variables which enables the UAVs to track the fronts and find their way autonomously. Furthermore, by implementing Nominal Belief-state Optimization (NBO) method, the dynamic constraints of the UAVs is considered and challenges such as collision avoidance is addressed completely in the context of POMDP

A Survey on Aerial Swarm Robotics

The use of aerial swarms to solve real-world problems has been increasing steadily, accompanied by falling prices and improving performance of communication, sensing, and processing hardware. The commoditization of hardware has reduced unit costs, thereby lowering the barriers to entry to the field of aerial swarm robotics. A key enabling technology for swarms is the family of algorithms that allow the individual members of the swarm to communicate and allocate tasks amongst themselves, plan their trajectories, and coordinate their flight in such a way that the overall objectives of the swarm are achieved efficiently. These algorithms, often organized in a hierarchical fashion, endow the swarm with autonomy at every level, and the role of a human operator can be reduced, in principle, to interactions at a higher level without direct intervention. This technology depends on the clever and innovative application of theoretical tools from control and estimation. This paper reviews the state of the art of these theoretical tools, specifically focusing on how they have been developed for, and applied to, aerial swarms. Aerial swarms differ from swarms of ground-based vehicles in two respects: they operate in a three-dimensional space and the dynamics of individual vehicles adds an extra layer of complexity. We review dynamic modeling and conditions for stability and controllability that are essential in order to achieve cooperative flight and distributed sensing. The main sections of this paper focus on major results covering trajectory generation, task allocation, adversarial control, distributed sensing, monitoring, and mapping. Wherever possible, we indicate how the physics and subsystem technologies of aerial robots are brought to bear on these individual areas

Leader-following consensus for lower-triangular nonlinear multi-agent systems with unknown controller and measurement sensitivities

summary:In this paper, a novel consensus algorithm is presented to handle with the leader-following consensus problem for lower-triangular nonlinear MASs (multi-agent systems) with unknown controller and measurement sensitivities under a given undirected topology. As distinguished from the existing results, the proposed consensus algorithm can tolerate to a relative wide range of controller and measurement sensitivities. We present some important matrix inequalities, especially a class of matrix inequalities with multiplicative noises. Based on these results and a dual-domination gain method, the output consensus error with unknown measurement noises can be used to construct the compensator for each follower directly. Then, a new distributed output feedback control is designed to enable the MASs to reach consensus in the presence of large controller perturbations. In view of a Lyapunov function, sufficient conditions are presented to guarantee that the states of the leader and followers can achieve consensus asymptotically. In the end, the proposed consensus algorithm is tested and verified by an illustrative example