Search

This paper investigates the adaptive consensus problem of general linear multi‐agent systems. Finite‐time consensus and fixed‐time consensus are both discussed. In order to remove the dependence on global information about system topology, distributed adaptive mechanisms are introduced. Compared with the existing asymptotic consensus results, the system's convergence speed is improved by the proposed distributed finite‐time consensus protocol. Furthermore, a distributed fixed‐time consensus protocol is proposed to remove the dependence on system's initial state. Under the fixed‐time consensus protocol, it is proved that an upper bound of the system's convergence time can be estimated. Sufficient conditions are given to ensure that all agents can achieve consensus in finite time and fixed time, respectively. Finally, the effectiveness of the proposed protocols is illustrated by a simulation example. [ABSTRACT FROM AUTHOR]

This paper is concerned with adaptive event-triggered consensus of general linear multi-agent systems (MASs). Leaderless consensus and leader-following consensus are both considered. In order to avoid dependence on global information about system topology and reduce communication frequency, distributed adaptive event-triggered consensus protocols are designed. Through model transformation, the consensus problems of MASs are transformed into the stability problems of the corresponding error systems. By using algebraic graph theory and Lyapunov stability theory, some sufficient criteria for MASs to achieve consensus are obtained. Meanwhile, it is proved that the proposed event-trigger conditions can exclude Zeno behaviour effectively. One simulation example is provided to validate the effectiveness of obtained theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, event-triggered leader-following consensus of general linear multiagent systems under both fixed topology and switching topologies is studied. First, centralised and decentralised event-triggered control strategies based on neighbors' state estimation are proposed under fixed topology, in which the controller is only updated at the time of triggering. Obviously, compared with the continuous time control algorithms, the event-triggered control strategies can reduce the communication frequency among agents effectively. Meanwhile, event-triggering conditions are derived for systems to achieve consensus by using the Lyapunov stability theory and model transformation method. Then, the theoretical results obtained under the fixed topology are extended to the switching topologies, and the sufficient conditions for the system to achieve leader-following consensus under the switching topologies are given. However, different from fixed topology, the control input of each agent is updated both at event-triggering and topology switching time. Finally, Zeno behaviors can be excluded by proving that the minimum triggering interval of each agent is strictly positive, and the effectiveness of the event-triggered protocol is verified by simulation experiments. [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]

Abstract: The paper presents a unified perspective on geometric and algebraic criteria for reachability and controllability of controlled switched linear discrete-time systems. Direct connections between geometric and algebraic criteria are established as well as that between the subspace based controllability/reachability algorithm and Kalman-type algebraic rank criteria. Also the existing geometric criteria is simplified and new algebraic conditions on controllability and reachability are given. [Copyright &y& Elsevier]

Abstract: This paper studies the reachability of discrete-time switched linear systems. A new constructive approach to designing switching sequences is developed so that not only the reachable subspace is realized but also the required number of switchings is reduced significantly. Detailed comparison between the obtained result and that reported in the open literature is also made, which verifies the advantage of the proposed approach. [Copyright &y& Elsevier]

Abstract: In this paper, we study the problem of designing switching sequences for controllability of switched linear systems. Each controllable state set of designed switching sequences coincides with the controllable subspace. Both aperiodic and periodic switching sequences are considered. For the aperiodic case, a new approach is proposed to construct switching sequences, and the number of switchings involved in each designed switching sequence is shown to be upper bounded by Here d is the dimension of the controllable subspace, , where are subsystems. For the periodic case, we show that the controllable subspace can be realized within d switching periods. [Copyright &y& Elsevier]