Search

In this paper, the $ H_{\infty } $ H ∞ consensus problem of stochastic nonlinear multi-agent systems with time-delay, Markov jump and $ (x, u, v) $ (x , u , v) -dependent noises is studied. Firstly, the $ H_{\infty } $ H ∞ consensus problem is transformed into a standard $ H_{\infty } $ H ∞ control problem by model transformation. Then, a dynamic output feedback control protocol is constructed by solving a set of linear matrix inequalities to ensure that the closed-loop system achieves the mean square consensus and meets the specified $ H_{\infty } $ H ∞ performance level. After that, both delay-independent and delay-dependent stochastic bounded real lemmas are established by taking advantage of the Lyapunov–Krasovskii function method and the generalised It $ \hat {\rm {o}} $ o ^ formula. Finally, we illustrate the validity of the developed method with numerical simulations. [ABSTRACT FROM AUTHOR]

In this paper, we study the controllability of multi-agent systems by equitable partition and automorphism. For the case that cells are incompletely connected outside but completely connected inside, a necessary condition for controllability is given from the perspective of the rank of connection matrix. For the case of multiple cells being completely connected outside and incompletely connected inside, in terms of the eigenvalues and eigenvectors of L and L π , several sufficient and necessary conditions for controllability are presented. Once the quotient graph is controllable under single input or all nodes in nontrivial cells are leaders, the lower bound of controllable subspace is determined. Finally, we give the gap between the necessary condition and the sufficient condition for controllability from the aspect of equitable partition. One highlight of the results in this paper is that we show sufficient conditions to judge controllability by equitable partition and automorphism, which, for specific cases, provides one method that how to break through the defect that equitable partition can only obtain necessary conditions. [ABSTRACT FROM AUTHOR]

Communication network could suffer uncertainties originating from link faults and network attacks. This situation, in multi-agent systems, can be featured by unknown weights of network topology. To impair the influence of the uncertain topology, typical compensation should be taken into account in distributed protocols to the workability of multi-agent systems. This paper, in the context of uncertain topology, addresses finite-time leader-following consensus for second-order uncertain nonlinear multi-agent systems. In addition to uncertainties in topology, the systems also allow unknown control coefficients, which together with the unknown weights renders the realisation of finite-time leader-following consensus nontrivial. Specifically, a fully distributed protocol based on distributed finite-time observer is designed via integrating the adaptive compensation scheme. Notably, in the designed protocol, dynamic high gains are introduced for the compensations of the network uncertainties and agents uncertainties. It turns out that the designed fully distributed protocol guarantees the global finite-time leader-following consensus. Simulation examples are provided to illustrate the validity of the proposed approach. [ABSTRACT FROM AUTHOR]

This paper researches the fixed-time leader-following consensus problem for nonlinear multi-agent systems (MASs) affected by unknown disturbances under the jointly connected graph. In order to achieve control goal, this paper designs a fixed-time consensus protocol, which can offset the unknown disturbances and the nonlinear item under the jointly connected graph, simultaneously. In this paper, the states of multiple followers can converge to the state of the leader within a fixed time regardless of the initial conditions rather than just converging to a small neighborhood near the leader state. Finally, a simulation example is given to illustrate the theoretical result. [ABSTRACT FROM AUTHOR]

In this article, the effects of different models on the controllability of leader‐follower dynamics system based on Laplacian matrix are studied, and the controllability results applicable to general model are obtained. Our research is based on three different control modes, namely, broadcast control, UI$$ {U}_I $$ control, and non‐broadcast control, which cover all the control modes in the general model. Specifically, we first identify the relation of different UI$$ {U}_I $$ control, that is, if the system is controllable under i1$$ {i}_1 $$ different control signals, then increasing the number of control signals does not change the controllability of the system. Furthermore, it is proved that in a fixed topology, when the number of control inputs is increased, the controllability of the system is not correlated with the controllability of the original system, which appears counter‐intuitive. But the spectral radius of the Gramian matrix of the controllable system is increased. In addition, we analyze the condition number of Gramian matrix. Based on the above conclusions, we put forward the concept of hierarchical equivalent partition (HEP), and prove that under the general model, the existence of HEP makes the system uncontrollable. Finally, we expect to find a way to make the system controllable under the general model. Therefore, we obtain sufficient conditions for the system to be controllable. As a by‐product, we find that there is no completely uncontrollable graph when the general model with broadcast control is removed. [ABSTRACT FROM AUTHOR]

In this article, the adaptive finite-time consensus problem is discussed for uncertain nonlinear multiagent systems. In contrast with the correlative literature, the systems permit multiple uncertainties (not only in control coefficients but also in inherent nonlinearities), and typically the consensus protocol is pursued in a fully distributed fashion (independent from any global information of network topology). This essentially challenges the realization of the finite-time consensus. To overcome the challenge, a new continuous fully distributed protocol is proposed by combining adaptive techniques such that the finite-time consensus of the systems under investigation is achieved. Remarkably, a dynamic high gain, rather than multiple ones in the related literature, is adequate to resist two kinds of uncertainties and to guarantee the fully distributed fashion of the consensus protocol. Moreover, the adaptive finite-time consensus protocol is specified on the scenario of leader-following multiagent systems. Simulation results of three interaction topologies are acquired to illustrate the validity and the wider applicability of the proposed protocol. [ABSTRACT FROM AUTHOR]

This article is devoted to the optimal protocol for the leader-following consensus of second-order multiagent systems. Remarkably, the global consensus cost functional and the directed topology are pregiven, and the optimal protocol to be sought is distributed. This makes the Riccati-based strategies inapplicable, by which merely centralized protocol can be derived. As the main contribution of this article, an effective strategy of seeking a distributed optimal protocol is proposed for second-order agents over the digraph of the directed tree. Detailedly, the feasibility of distributed optimal protocol is first affirmed, that is, the existence of optimal gain parameters can be guaranteed. Then, by recursively deriving the completely explicit formulas of the consensus errors of relative position and velocity, an online implementable algorithm is developed to achieve the parameterization of the cost functional, that is, to obtain the explicit formula of the cost functional with respect to gain parameters of all agents. Lastly, the desired optimal gain parameters are obtained by minimizing the explicit formula. [ABSTRACT FROM AUTHOR]

This paper addresses the linear quadratic regulator optimal leader-following consensus for multiagent systems in a single-integrator form. Substantially different from the existing related works, the cost function, a global one, and the topology structure are both pregiven, and the optimal protocol to be sought is distributed (which merely depends on relative state information). This violates the optimal protocol design based on the algebraic Riccati equation, although a centralized protocol can be derived. To solve the problem, a novel design strategy of distributed optimal protocol is proposed for the multiagent systems over the digraph of a directed tree. Specifically, the dynamics of the consensus error is explicitly obtained, by which an online-implementable algorithm is given to achieve the parameterization of the cost function. Namely, the completely explicit formula with respect to the gain parameters of all agents is derived for the cost function. Based on this, the existence of optimal gain parameters is rigorously proven, which means the existence of the desired distributed optimal protocol. Furthermore, the optimal gain parameters are derived by minimizing the explicit formula. Two simulation examples are provided to illustrate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, finite-time consensus tracking is investigated via time-varying feedback for uncertain nonlinear multi-agent systems (NMASs). The presence of inherent uncertainties and disturbances in the NMASs highlights the main novelty : (1) The inherent uncertainties imply that more serious unknowns and time-variations are allowed in the nonlineartities and the control coefficients of the NMASs. (2) The inherent disturbances mean that the upper bound of the disturbances is unknown. To compensate the inherent uncertainties and disturbances, time-varying protocols are proposed by integrating time-varying technique and sliding mode method. Based on the proposed protocols, the finite-time leader-following consensus and finite-time containment are achieved under directed graph. Finally, the validation of the proposed protocols is verified by two examples. [ABSTRACT FROM AUTHOR]

This paper focuses on the almost sure consensus via time-varying feedback for a class of uncertain stochastic nonlinear multiagent systems. A remarkable feature of the systems is that the nonlinearities allow serious unknowns and time-variations. Moreover, there exists no known bound for the unknown control coefficients. To handle the unknowns and time-variations, a time-varying consensus scheme is developed. The main idea of the scheme is to incorporate a delicate function of time into consensus protocols such that the unknowns and time-variations can be compensated as time increases. Based on the proposed protocols, the almost sure leaderless consensus and almost sure leader-following consensus are achieved. Finally, two simulation examples are provided to illustrate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

This paper constructs a lower dimensional multi-agent system (MAS) utilizing the structural decomposition of system matrix. Through equivalent transformation, it has been proven that the sampling controllability of the original system is inherited by the lower dimensional system, allowing us to further obtain a criterion for determining the sampling controllability based on topology structure and sampling period. The paper also applies state feedback to the protocol design of MAS during the sampling period, achieving that the sampled-data MAS can still maintain controllability in uncontrollable topologies, and controllability is unaffected by the sampling period. Finally, numerical examples are provided for verification. [ABSTRACT FROM AUTHOR]

In view of the problems of large consumption of communication and computing resources in the control process, this paper studies a fundamental property for a class of multi-agent systems under event-triggered strategy: the S-stabilizability of a group of multi-agent systems with general linear dynamics under weakly connected directed topology. The results indicate that the S-stabilizability can be described in some way that the stabilizability region and feedback gain can evaluate the performance of the protocol. Firstly, a new distributed event-triggered protocol is proposed. Under this protocol, a kind of hybrid static and dynamic event-triggered strategy are presented, respectively. In particular, by using Lyapunov stability theory and graph partition tool, it is proved that the proposed event-triggered control strategy can guarantee the closed-loop system achieve S-stabilizability effectively, if at least one vertex in each iSCC (independent strongly connected component) cell receives information from the leader, which reflects the ability of distributed control law. Further, we demonstrate that the stabilizability can be realized if the initial system matrix A is Hurwitz. Moreover, it is confirmed that the designed static event-triggered condition is a limit case of dynamic event condition and can guarantee Zeno-free behavior. Finally, the validity of the theoretical results is proved by numerical simulation. [ABSTRACT FROM AUTHOR]

In this paper, the influences of negative weights on the consensus problems of multi-agent systems are investigated. While the system is subject to external attacks or agents in the system break down, there are errors in information transmission between agents. As a result, for non-negative systems, the connection weights between agents may change, or even change from positive to negative. In this paper, we provide a unified approach to deal with the problem of how to ensure the consensus of the system when the connection weight becomes negative. It is found that the consensus of multi-agent systems and general linear multi-agent systems will be guaranteed while the weights change to a certain extent without changing the protocol and feedback gains. We obtain a necessary and sufficient condition to ensure that the system can still reach asymptotic consensus when the connection weight is negative. The result is applicable to first-order, high-order integrator type of multi-agent systems as well as the general linear multi-agent system. [ABSTRACT FROM AUTHOR]