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]

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]

Summary: Event‐triggered consensus of multi‐agent systems (MASs) under directed topology is investigated in this paper. First, one shortcoming about the event‐trigger conditions in some recent results is pointed out through a counterexample. Then, two reasonable event‐trigger conditions are proposed and analyzed. Meanwhile, a novel dynamic event‐trigger strategy is applied in the two designed event‐trigger conditions, in which an auxiliary term is introduced for each agent to regulate its threshold dynamically. It is proved that the dynamic term plays an essential role in excluding Zeno behavior. The case of strongly connected topology is first investigated. Then, the results are extended to the more general topology containing a spanning tree. Numerical example is provided to illustrate the effectiveness of the designed event‐trigger conditions. [ABSTRACT FROM AUTHOR]

This paper investigates the optimisation problem of second-order multi-agent systems. Distributed optimisation algorithms are proposed based on sampling data. Two kinds of sampling techniques, namely, aperiodic sampling and dynamic event-triggered sampling, are utilised. Moreover, the proportional integral (PI) strategy is utilised in the proposed algorithms. Compared with the existing distributed optimisation algorithm based on periodic sampling, the proposed algorithm dependent on aperiodic sampling is more general. Compared with the existing steady event-triggered algorithm, the distributed optimisation algorithm based on dynamic event-triggered sampling has the merit of lower energy consumption. Under the assumption that the global cost function is strongly convex about global minimum point, it is proved that the proposed algorithms solve the optimisation problem. Lyapunov stability theory is applied to give sufficient criteria guaranteeing convergence to optimal point. Finally, the effectiveness of the proposed algorithms is illustrated by numerical simulation. [ABSTRACT FROM AUTHOR]

Consensus of multi-agent systems (MASs) with general linear dynamics is investigated. In order to reduce communication frequency and avoid dependence on global information, adaptive event-triggered strategy is applied. A kind of dynamic event-triggered strategy, which is more flexible in giving event-trigger threshold, is proposed. An event-trigger condition based on continuous relative measurement is first designed. Then, the event-trigger condition is improved to only utilize event-triggered information. Sufficient criteria are derived to guarantee consensus. Moreover, it is proved that the designed event-trigger conditions can exclude Zeno behavior. Numerical simulation is performed to verify the effectiveness of the obtained results. [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]

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, the structural controllability of leader–follower systems over digraphs is discussed. Firstly, with the aid of leader–follower partition, we analyze the topological characteristics of systems without dilations. Moreover, we divide the digraph into the leader subgraph and the follower subgraph. By analyzing the topological characteristics of the follower subgraph, a sufficient condition to ensure the system structurally controllable is given. Furthermore, some special topologies of follower graphs are analyzed, such as unidirectional cycle graphs and directed paths, and the corresponding sufficient conditions of structural controllability are given. Meanwhile, a method to construct digraphs with structural controllability is presented. Finally, the strong structural controllability of directed tree graphs is considered, as well as the selection mechanism of leaders and the lower bound of the number of leaders under strong structural controllability are given. The above results reflect the effects of topologies on strong (or weak) structural controllability. [ABSTRACT FROM AUTHOR]

This paper investigates the number of switchings and design of switching sequences for controllability of switched linear systems. Two related results are established. One is a new constructive approach to designing switching sequences. The controllable state set of each switching sequence designed via the approach coincides with the controllable subspace of switched linear systems. The other is a well-estimated value for the minimum number of switchings required for controllability. Each state in the controllable subspace can be steered to origin within this value of switching times. Index Terms--Constructive method, controllability, hybrid systems, reachability, switched systems, switching sequence.

This paper addresses robust [H.sub.[infinity]] control and stabilization of switched linear systems with norm-bounded time-varying uncertainties. First, based on multiple Lyapunov functions methodology, a sufficient condition is derived for robust stabilization with a prescribed disturbance attenuation level [gamma] only by employing state-dependent switching rules. Then the robust [H.sub.[infinity]] control synthesis via switched state feedback is studied. It is shown that a switched state-feedback controller can be designed to stabilize the switched systems with an [H.sub.[infinity]]-norm bound if a matrix inequality based condition is feasible. This condition can be dealt with as linear matrix inequalities (LMIs) provided that the associated parameters are selected in advance. All the results presented can be regarded as an extension of some existing results for both switched and nonswitched systems. [DOI: 10.1115/1.2238874] Keywords: uncertain switched systems, Lyapunov methods, disturbance attenuation, feedback stabilization, switching rule

In this article, by analyzing the eigenvalues and eigenvectors of Laplacian $L$ , we investigate the controllability of multiagent systems under equitable partitions. Two classes of nontrivial cells are defined according to the different numbers of links between them, which are completely connected nontrivial cells (CCNCs) and incompletely connected nontrivial cells. For the system with CCNCs, a necessary condition for controllability is found to be choosing leaders from each nontrivial cell, the number of which should be one less than the cardinality of the cell. It is shown that the controllability is affected by three factors: 1) the number of the links between nontrivial cells; 2) the rank of the connection matrix; and 3) the odevity of the capacity of the nontrivial cells. In the case of nontrivial cells under the equitable partition, there are automorphisms of interconnection graph $\mathcal {G}$ , which induce the eigenvectors of $L$ with zero entries. For the system with automorphisms, by taking advantage of the property of eigenvectors associated with $L$ , we propose several graphical necessary conditions for controllability. In addition, by the PBH rank criterion, the controllable subspaces of the system with different classes of nontrivial cells are compared. Finally, a necessary and sufficient condition for controllability under minimum inputs is given. [ABSTRACT FROM AUTHOR]

Experimental results show that the edge detection method of the crater proposed in this paper is better than other edge detection methods; compared with other crater detection methods, the proposed method has higher detection accuracy and more correct detection rate. In the paper entitled 'A novel color image encryption based on fractional order Lorenz system' by S. Li et al., we have a novel colour image encryption algorithm is proposed based on the fractional order Lorenz system. Since the node information of a complex network is always not fully available, state estimation technique becomes an important tool to estimate the desired node information through the received measurement outputs. The high precision mechanical sensors are used to install on the rotating shaft in the traditional methods, occupied the space and increased system cost and the mechanical sensors are easily affected by the environment, reduced the measurement accuracy and system stability. [Extracted from the article]

The consensus problem of multi-agent systems with general second-order dynamics is studied. A distributed event-triggering strategy is proposed to reduce the communication frequency of agents and the update frequency of event-triggering controller. Under the fixed topology, a consensus protocol and event-triggering function are designed for each agent. The sufficient conditions of consensus are obtained by the stability theory, and the theoretical proof of excluding Zeno behaviour is presented. Finally, a simulation example is given to illustrate the effectiveness of the obtained results. [ABSTRACT FROM AUTHOR]

This article investigates the controllability of path and star graphs under the protocol of second-order neighbours. With identified special control nodes, a sufficient condition is first derived for the controllability of path graph by taking advantage of the protocol of second-order neighbours. Then necessary and sufficient conditions are developed respectively for the single and multiple leaders. Some differences between the protocol of second-order neighbours and first-order neighbours are also presented for path graph. Finally, a necessary and sufficient condition is proposed for the controllability of star graph by taking advantage of the protocol of second-order neighbours. [ABSTRACT FROM AUTHOR]

This paper is concerned with the optimal output feedback control problem for networked control systems (NCSs) with Markovian packet losses. In this paper, the packet losses occur both between the sensor and controller and between the controller and actuator. Moreover, the packet loss channels are described with two-state Markov chains. Since the precise state information cannot be obtained, thus an optimal recursive estimator is designed. Furthermore, by adopting the dynamic programming approach, we derive the optimal output feedback control, which is based on the solution to a given modified Riccati equation. The obtained results can be seen as an important implementation of the control theory for NCSs with unreliable communication channels. [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]