首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 156 毫秒
1.
In this article, the average consensus problem in directed networks of agents with both switching topology and coupling delay is investigated. First, based on a specific orthogonal transformation of the Laplacian matrix, an important proposition for verifying the positive definiteness of a class of quadratic forms is provided, which is of independent interest in matrix theory. And the relation between weakly connected and strongly connected digraphs is also investigated. Then, it is proved that all the agents reach the average consensus asymptotically for appropriate time delay if the communication topology keeps weakly connected and balanced. Finally, a numerical example is given to demonstrate the effectiveness and advantage of the new result.  相似文献   

2.
In this article, finite-time consensus algorithms for a swarm of self-propelling agents based on sliding mode control and graph algebraic theories are presented. Algorithms are developed for swarms that can be described by balanced graphs and that are comprised of agents with dynamics of the same order. Agents with first and higher order dynamics are considered. For consensus, the agents' inputs are chosen to enforce sliding mode on surfaces dependent on the graph Laplacian matrix. The algorithms allow for the tuning of the time taken by the swarm to reach a consensus as well as the consensus value. As an example, the case when a swarm of first-order agents is in cyclic pursuit is considered.  相似文献   

3.
The consensus problem of discrete-time networked multi-agent systems (NMASs) with a communication delay is investigated in this article, where the dynamics of agents described by discrete-time linear time-invariant systems can be either uniform or non-uniform. For the NMASs with a directed topology and constant delay, a novel protocol based on the networked predictive control scheme is proposed to compensate for communication delay actively. Using algebraic graph theories and matrix theories, necessary and/or sufficient conditions of achieving consensus are obtained, which indicates that, under the proposed protocol, the consensus is independent of the network delay and only dominated by agents' dynamics and communication topology. Meanwhile, the protocol design and consensus analysis are also presented in the case of no network delay. Simulation results are further presented to demonstrate the effectiveness of theoretical results.  相似文献   

4.
In this paper, the cluster consensus problem with delays of first-order nonlinear multi-agent systems is studied through pinning leader-following approach with periodic intermittent effect. The graph of the networked system is assumed to be directed and weakly connected. A new type of pinning consensus protocol with intermittent effect is designed according to the ways in which the agents link, specifically, the agents in each cluster are divided into three subsets due to the orientation of their topological degree, and each subset of agents is controlled by an individual law. A redefined notion on cluster consensus with two sorts of time delays is proposed in this article. Some consensus criteria are derived to guarantee that the agents in the same cluster asymptotically follow the virtual leader with a delay, while agents in different clusters reach consensus with delays via following their leaders. Some numerical simulations are given to illustrate the effectiveness of the theoretical results.  相似文献   

5.
研究带有不确定性拓扑的双积分系统在有时滞的情况下的一致性问题,通过线性矩阵不等式的方法,得到一致性的充分条件。本文最大的贡献是考虑双积分系统,在有不确定性信息和时变时滞的情况下,找出控制协议使其一致。最大合适的时变时滞和不确定性可以由线性矩阵不等式得到。最后给出仿真,证明定理的有效性。  相似文献   

6.
This paper investigates the consensus tracking problem for general linear multiagent systems on directed graph containing a spanning tree. For the considered linear systems, the consensus tracking aim cannot be achieved by using only memoryless static relative output feedbacks. Of particular interest is that both current and delayed relative output information of agents are required to achieve consensus. For the case of continuous communication among agents, an artificial delay output feedback control method is proposed. By utilizing the Taylor representation for the delayed signal with the remainder in the integral form, a delay‐dependent sufficient condition is presented to guarantee the exponential convergence of the global tracking error systems. For the intermittent case, the consensus tracking performance can still be guaranteed based on a multiple graph‐dependent Lyapunov functionals method. It is theoretically revealed that the time delay plays a key role in the exponential convergence of the closed‐loop systems, and the definite relationships among the time delay, network structure, communication rate, and consensus convergence rate are also provided. The effectiveness of the proposed control scheme is confirmed by numerical simulations.  相似文献   

7.
This paper studies the consensusability of a continuous‐time linear time‐invariant multi‐agent system (MAS) with time delay in an undirected network with N nodes. We show that the MAS can achieve consensus if and only if N ? 1 time‐delay subsystems associated with the eigenvalues of the Laplacian matrix of the network are simultaneously asymptotically stable. By employing a linear matrix inequality (LMI) method, we present a controller design method for a MAS to reach consensus. We also obtain a bound on the maximum time delay for consensusability for a MAS with first‐order integrator dynamics by using frequency‐domain analysis. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   

8.
This paper investigates two kinds of different consensus strategies for multi-vehicle systems with a time-varying reference velocity under directed communication topology, where the systems are modeled by double-integrator dynamics. For the fixed communication topology case, we provide a necessary and sufficient condition for all the vehicles with reference velocity to reach consensus by the use of a new graphic methodology. We then extend this method to deal with the general case, that is, both the communication topologies and weighting factors are dynamically changing. In particular, it is shown that all the vehicles can reach consensus even though the dynamically changing interaction topology may not have a globally reachable node.  相似文献   

9.
In this paper, we discuss the finite-time consensus problem for leaderless and leader–follower multi-agent systems with external disturbances. Based on the finite-time control technique, continuous distributed control algorithms are designed for these agents described by double integrators. Firstly, for the leaderless multi-agent systems, it is shown that the states of all agents can reach a consensus in finite time in the absence of disturbances. In the presence of disturbances, the steady-state errors of any two agents can reach a region in finite time. Secondly, for the leader–follower multi-agent systems, finite-time consensus algorithms are also designed based on distributed finite-time observers. Rigorous proof is given by using Lyapunov theory and graph theory. Finally, one example is employed to verify the efficiency of the proposed method.  相似文献   

10.
The problem of the convergence of the consensus strategies for multiple agents with double-integrator dynamics is studied in this paper. The investigation covers two kinds of different settings. In the setting with the interaction topologies for the position and velocity information flows being modeled by different graphs, some sufficient conditions on the fixed interaction topologies are derived for the agents to reach consensus. In the setting with the interaction topologies for the position and velocity information flows being modeled by the same graph, we systematically investigate the consensus algorithm for the agents under both fixed and dynamically changing directed interaction topologies. Specifically, for the fixed case, a necessary and sufficient condition on the interaction topology is established for the agents to reach (average) consensus under certain assumptions. For the dynamically changing case, some sufficient conditions are obtained for the agents to reach consensus, where the condition imposed on the dynamical topologies is shown to be more relaxed than that required in the existing literature. Finally, we demonstrate the usefulness of the theoretical findings through some numerical examples.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号