Search

This paper systematically investigates consensus tracking of linear multi-agent systems with disturbances over directed switching topologies. Both state and output feedback H ∞ controllers are jointly synthesized with the triggering mechanism. First, a state-based event-triggered H ∞ controller design for achieving consensus tracking is carried out, which can result in settling the occurrence of disturbances and the reduction of controller updates as well as averting Zeno behavior. Considering the case that only output information of agent is required, an event-triggered H ∞ output feedback controller is then proposed and sufficient condition for the solvability of consensus tracking problem are also derived. Compared with the existing results, the effects of disturbances on directed switching topologies can be tackled when continuous communication and full-state information of the agent are not needed. Numerical simulation are finally conducted to illustrate the effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]

In this paper, the finite-time dynamic event-triggered consensus of second-order multi-agent systems with mismatched disturbances is studied. First, a nonlinear finite-time disturbance observer is designed to estimate the mismatched and matched disturbance of each follower. Second, the nonlinear dynamic integral sliding surface is developed through the mismatched and matched disturbance estimated by the observer. Then, combined with the dynamic event trigger strategy and the designed integral sliding surface, a new distributed control protocol is proposed, ensuring the finite-time consensus of the system. An analysis of Zeno behavior has found that the event-triggered interval has a positive lower bound. Finally, the effectiveness of the proposed control algorithm is verified by numerical simulation. [ABSTRACT FROM AUTHOR]

This paper studies the distributed optimal coordinated control problem for Euler–Lagrange multi-agent systems with connectivity preservation. The aim is to force agents to achieve the optimal solution minimizing the sum of the local objective functions while guaranteeing the connectivity of the communication graph. For practical purposes, the gradient vector of the local objective function is allowed to use only at the real-time generalized position instead of at the auxiliary system state. To make the control parameters independent of the global information and guarantee the fully distributed manner of controller, the adaptive control is introduced to update the coupling weights of the relative states among neighbors. Moreover, to reduce the resource for control updates, the event-driven communication is employed for the updates of both the relative states and the gradient of the connectivity-preserving potential function. Based on the Lyapunov analysis framework, it is proved that agents can converge to the optimal solution with connectivity preservation and Zeno behavior is excluded for the two event-triggering conditions. Finally, the effectiveness of the proposed method is verified by a numerical simulation example. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the problem of leaderless consensus control for the multiagent systems whose nonlinear dynamics satisfying incremental quadratic constraints. A distributed dynamic consensus protocol, decided by communication among neighboring agents, is presented to render nonlinear agent consensus with appropriate coupling weights. Next, an observer-based distributed protocol is considered to ensure consensus of nonlinear system without knowing full state information. Further, extensions to consensus strategies with nonlinear dynamics for the leader-following fashion are also addressed. By comparison to the traditional nonlinear consensus control methodologies, the proposed approach generalizes the Lipschitz nonlinearity as well as the combined nonlinearity of one-sided Lipschitz condition and quadratic inner-boundness condition towards a more generalized type of nonlinearity, which shows us a less conservative result in the Lyapunov proof. Finally, the numerical simulations for six agents are illustrated to show the feasibility and performance of the proposed control protocol with or without the presence of the observer. [ABSTRACT FROM AUTHOR]

In this paper, the optimal consensus control problem of nonlinear multi-agent systems(MASs) with completely unknown dynamics is considered. The problem is formulated in a differential graphical game approach which can be solved by Hamilton-Jacobi (HJ) equations. The main difficulty in solving the HJ equations lies in the nonlinear coupling between equations. Based on the Adaptive Dynamic Programming (ADP) technique, an VI-PI mixed HDP algorithm is proposed to solve the HJ equations distributedly. With the PI step, a suitable iterative initial value can be obtained according to the initial policies. Then, VI steps are run to get the optimal solution with exponential convergence rate. Neural networks (NNs) are applied to approximate the value functions, which makes the data-driven end-to-end learning possible. A numerical simulation is conducted to show the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper is concerned with the secure bipartite consensus of second-order multi-agent systems under denial-of-service (DoS) attacks. The communication network is an antagonistic network, in which there is cooperative or competitive relationship between neighboring agents. Meanwhile, information cannot be transmitted when the system is attacked. A novel event-triggered control algorithm based on sampled data is proposed to save limited resources and exclude the Zeno behavior. By applying the convergence of monotone sequences, graph theory as well as the discrete-time Lyapunov function method, some sufficient conditions on threshold parameters, frequency and duration of DoS attacks, and sampling period are derived to ensure the bipartite consensus under DoS attacks. Finally, the correctness and advantages of theoretical results are demonstrated by a numerical simulation. [ABSTRACT FROM AUTHOR]

This paper studies the flocking control problem of heterogenous multi-agent systems with multi-group tracking various virtual leaders. In particular, hybrid impulsive control protocol is designed based on the partially discrete agents' information transmission, where full information exchange only occurs at each impulsive time instant. Meanwhile, braking and gyroscopic forces are implemented for the collision avoidance purpose. Conditions for multi-group formation are established in terms of coupling strength and the length of impulse period. The designed control protocols guarantee that the multi-agent systems are able to achieve asymptotic stability as well as collision-free motions. Numerical examples and computer simulations are provided to validate the theoretical results. [ABSTRACT FROM AUTHOR]

This paper studies practical consensus problems for continuous-time multiagent systems with heterophilous dynamics. Agents in the network tend to cease communication when they are close enough to each other inspired by the heterophily principle in social and opinion dynamics. We propose two types of state constraints on dynamical agents, in which the hard constraint refers to exogenous restrictions that rule the entire evolution of the agent behavior and the soft constraint turns out to be endogenous and only the ultimate equilibria of the agents are restricted. Sufficient conditions have been established to achieve practical consensus for both types of constrained systems. Numerical simulations show that the practical consensus time grows logarithmically, revealing a rapid convergence with respect to disagreement of initial conditions. [ABSTRACT FROM AUTHOR]

In this paper, the consensus tracking problem is studied for a group of nonlinear heterogeneous multiagent systems with asymmetric state constraints and input delays. Different from the existing works, both input delays and asymmetric state constraints are assumed to be nonuniform and time-varying. By introducing a nonlinear mapping to handle the problem caused by state constraints, not only the feasibility condition is removed, but also the restriction on the constraint boundary functions is relaxed. The time-varying input delays are compensated by developing an auxiliary system. Furthermore, by utilizing the dynamic surface control method, neural network technology and the designed finite-time observer, the distributed adaptive control scheme is developed, which can achieve the synchronization between the followers' output and the leader without the violation of full-state constraints. Finally, a numerical simulation is provided to verify the effectiveness of the proposed control protocol. [ABSTRACT FROM AUTHOR]

In this paper, the problem of localizing and circumnavigating an unknown stationary target by multiple autonomous agents using bearing-only measurements is studied. We assume that all agents are anonymous in the sense that they are indistinguishable from each other, and each agent is not permitted to exchange its local measurements or state information. A novel collision avoidance mechanism is proposed to ensure collision-free system evolution, and a distributed control algorithm is developed to steer the group of agents to circumnavigate the target at a desired distance with any prescribed angular spaced formation. Global finite-time stability of the system is rigorously derived. The performance of the proposed algorithms is verified through numerical simulations. [ABSTRACT FROM AUTHOR]

Practical time-varying formation-containment tracking (TVFCT) issue for nonlinear multi-agent systems with general noise is researched in this paper. A neuro-adaptive practical TVFCT protocol is put forward, where neural networks (NNs) and parameter adaptive laws are developed for estimating the nonlinearities and compensating the upper bound of the time-varying formation (TVF) condition, respectively. Leaders are expected to achieve the predetermined TVF and followers are driven to move into the formation structure confined by leaders simultaneously. The whole formation position depends on the desired trajectory produced by a virtual-leader. General noise rather than white noise is investigated in the multi-agent systems. The noise-to-state-practically stability in probability (NSPS-P) criteria can be guaranteed by employing the Lyapunov theories combined random differential equations (RDEs). Numerical simulation results reveal the effectiveness of the developed protocols. [ABSTRACT FROM AUTHOR]

This paper deals with the privacy-preserving average consensus problem for continuous-time multi-agent network systems (MANSs) based on the event-triggered strategy. A novel event-triggered privacy-preserving consensus algorithm is designed to achieve the average consensus of MANSs while avoiding the disclosure of the agents' initial states. Different from the approaches incorporating stochastic noises, an output mask function in the proposed algorithm is developed to make initial state of each agent indiscernible by the others. Particularly, under the output mask function, all agents can exactly tend to the average value of initial states rather than the mean square value. Under the proposed algorithm, detailed theoretical proof about average consensus and privacy of the MANSs are conducted. Moreover, the proposed algorithm is extended to nonlinear continuous-time MANSs, and the corresponding results are also derived. A numerical simulation eventually is performed to demonstrate the validity of our results. [ABSTRACT FROM AUTHOR]

In this paper, we study the cooperation problem over a group of discrete-time nonlinear dynamically decoupled multi-agent systems (MAS). A distributed model predictive control (DMPC) scheme is proposed in the event-triggered context. Agents cooperate through a coupled cost function subject to input constraints. From the practical perspective, the additive disturbances are taken into account in the controller design. Using the contraction theory in the framework of Riemannian manifolds, a novel constraint is constructed in the DMPC optimization problem to provide the capability of disturbance rejection. Moreover, the event-triggered mechanism is introduced for saving computational and communicational resources. The event-triggering condition is developed by checking the Riemannian distance between the actual and optimal state trajectories. The stability of the closed-loop system and recursive feasibility of the DMPC scheme, thereafter, are rigorously analyzed. In particular, the stability analysis is built upon the contraction theory, which distinguishes this work from the existing results using the conventional Lyapunov theory. It is shown that the recursive feasibility is guaranteed if the additive disturbances are bounded and the event-triggering condition is properly designed. The numerical simulation results demonstrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]