共查询到20条相似文献，搜索用时 0 毫秒
1.
“Kronecker Basis” Based Average Consensus Analyses for High‐Order Linear Multi‐Agent Systems with Multiple Time Delays 
下载免费PDF全文
下载免费PDF全文 Huangyong Zhu Yirui Cong Xiangke Wang Daibing Zhang Qingjie Zhang 《Asian journal of control》2015,17(4):1444-1452
This paper investigates the average consensus for multi‐agent systems governed by high‐order linear dynamics with multiple time delays. Necessary and sufficient conditions for high‐order average consensus under balanced communication topology are provided by using a newly defined mathematical concept – the Kronecker basis. Furthermore, previous studies for average consensus governed by first‐order, or high‐order integrator can be regarded as special cases of our results. Simulation results are employed to demonstrate the effectiveness of our results for high‐order average consensus. 相似文献
2.
Bo Zhou Xiaofeng Liao Tingwen Huang Huaqing Li Guo Chen 《Asian journal of control》2017,19(2):564-574
In this paper, we consider the semiglobal leader‐following consensus of general linear multi‐agent systems subject to input saturation. First, an event‐triggered control protocol is provided to ensure semiglobal consensus of the multi‐agent systems, in which the agents should continuously monitor the information of their neighbors. Second, a self‐triggered control protocol is proposed to guarantee the semiglobal consensus of the multi‐agent systems, in which the agents only have access to the information of their neighbors in discrete time instants. Moreover, both event‐triggered control protocol and self‐triggered control protocol are proved to be Zeno‐free, that is, the inter‐event times for such two protocols have positive lower bounds. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed event‐based semiglobal consensus protocols. 相似文献
3.
Huan Pan 《Asian journal of control》2014,16(1):188-197
This paper is concerned with the leader‐following consensus problem for multi‐agent systems consisting of one stationary leader and multiple cooperative followers, where the controlling effect of each follower depends on its own state. It is noted that the influence of diffusion among followers is taken into account and the system is modeled by reaction‐diffusion equations. With the assumption of the followers' initial states, a linear control protocol is designed. Based on algebraic graph theory, the method of energy estimates, and Sobolev embedding theorem, the sufficient conditions guaranteeing the leader‐following consensus under the proposed control protocol are provided. Numerical examples illustrate the effectiveness of the theoretical results. 相似文献
4.
We consider the multi‐agent optimization problem where multiple agents try to cooperatively optimize the sum of their local convex objective functions, subject to global inequality constraints and a convex constraint set over a network. Through characterizing the primal and dual optimal solutions as the saddle points of the associated Lagrangian function, which can be evaluated with stochastic errors, we propose the distributed primal–dual stochastic subgradient algorithms for two cases: (i) the time model is synchronous and (ii) the time model is asynchronous. In the first case, we obtain bounds on the convergence properties of the algorithm for a diminishing step size. In the second case, for a constant step size, we establish some error bounds on the algorithm's performance. In particular, we prove that the error bounds scale as in the number of n agents. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
5.
In this paper, we consider the consensus problem for heterogeneous multi‐agent systems composed of some first‐order and some second‐order dynamic agents in directed communication graphs. Consensus protocols are proposed for the second‐ and first‐order dynamic agents, respectively. Under certain assumptions on the control parameters, for fixed communication topologies, necessary and sufficient conditions for consensus are given, and the consensus values of all agents are established. For switching topologies, sufficient conditions are given for all agents to reach consensus. Finally, simulation examples are presented to demonstrate the effectiveness of the proposed methods. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
6.
This paper studies the problem of minimizing the sum of convex functions that all share a common global variable, each function is known by one specific agent in the network. The underlying network topology is modeled as a time‐varying sequence of directed graphs, each of which is endowed with a non‐doubly stochastic matrix. We present a distributed method that employs gradient‐free oracles and push‐sum algorithms for solving this optimization problem. We establish the convergence by showing that the method converges to an approximate solution at the expected rate of , where T is the iteration counter. A numerical example is also given to illustrate the proposed method. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
7.
This paper is concerned with the fixed‐time coordinated tracking problem for a class of nonlinear multi‐agent systems under detail‐balanced directed communication graphs. Different from conventional finite‐time coordinated tracking strategies, the fixed‐time approach developed in this paper guarantees that a settling time bound is prescribed without dependence on initial states of agents. First, for the case of a single leader, a distributed protocol based on fixed‐time stability techniques is proposed for each follower to accomplish the consensus tracking in a fixed time. Second, in the presence of multiple leaders, a new distributed protocol is proposed such that states of followers converge to the dynamic convex hull spanned by those of leaders in a fixed time. In addition, for a class of linear multi‐agent systems, sufficient conditions that guarantee the fixed‐time coordinated tracking are provided. Finally, numerical simulations are given to demonstrate the effectiveness of the theoretical results. 相似文献
8.
In this paper, the leader‐following consensus problem of uncertain high‐order nonlinear multi‐agent systems on directed graph with a fixed topology is studied, where it is assumed that the relative states of a follower and its neighbors are immeasurable and only the relative outputs are available. Nonlinear adaptive observers are firstly proposed for each follower to estimate the states of it and its neighbors, and an observer‐based distributed adaptive control scheme is constructed to guarantee that all followers asymptotically synchronize to a leader with tracking errors being semi‐globally uniform ultimate bounded. On the basis of algebraic graph theory and Lyapunov theory, the closed‐loop system stability analysis is conducted. Finally, numerical simulations are presented to illustrate the effectiveness and potential of the proposed new design techniques. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献
9.
Gang Chen 《国际强度与非线性控制杂志
》2015,25(11):1721-1738
》2015,25(11):1721-1738
This paper addresses the synchronization problems with/without a dynamic leader for a team of distributed Lagrange systems on digraph. A systematic way to design and analyze the distributed control algorithms is presented. The contributions of the paper are twofold. First, the adaptive coordination control protocols are proposed for synchronization of networked uncertain Lagrange systems with/without tracking. This protocol can guarantee synchronization in finite time. Second, the design of the distributed tracking controller for the networked dynamic systems is proposed by using Lyapunov methods. The development is suitable for the general digraph communication topologies. Simulation examples are included to demonstrate the effectiveness of the proposed algorithms. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
10.
This paper studies consensus in linear multi‐agent systems with current and sampled partial relative states. A distributed linear consensus protocol is designed, where both current and sampled relative states are utilized. A necessary and sufficient condition for consensus in this setting is established. The notion of the consensus region is then introduced and analyzed for third‐order systems, provided that each agent can only know its relative positions and velocities. It is shown that the consensus regions are stable to control gains and sampling period. Additionally, how to choose the control gains and the sampling period is given for consensus in third‐order systems. Finally, an example is given to verify and illustrate the analysis. 相似文献
11.
Wenlong Ma Minyue Fu Peng Cui Huanshui Zhang Zhipeng Li 《Asian journal of control》2020,22(1):323-333
In this paper, we consider a distributed convex optimization problem where the objective function is an average combination of individual objective function in multi‐agent systems. We propose a novel Newton Consensus method as a distributed algorithm to address the problem. This method utilises the efficient finite‐time average consensus method as an information fusion tool to construct the exact Newtonian global gradient direction. Under suitable assumptions, this strategy can be regarded as a distributed implementation of the classical standard Newton method and eventually has a quadratic convergence rate. The numerical simulation and comparison experiment show the superiority of the algorithm in convergence speed and performance. 相似文献
12.
This paper focuses on the composite‐rotating consensus problem of second‐order multi‐agent systems with a leader and nonuniform time‐delays. First, a distributed control law is proposed to solve this problem. Second, by using the complex frequency domain analysis method, the maximal upper bound of time‐delays is deduced and it is proven that all agents eventually rotate around a common point while this point rotates around the origin, provided all communication time‐delays are less than the the maximal upper bound of time‐delays. Finally, simulation results are provided to demonstrate the effectiveness of the theoretical results. 相似文献
13.
In this paper, a consensus problem is studied for a group of second‐order nonlinear heterogeneous agents with non‐uniform time delay in communication links and uncertainty in agent dynamics. We design a class of novel decentralized control protocols for the consensus problem whose solvability is converted into stability analysis of an associated closed‐loop system with uncertainty and time delay. Using an explicitly constructed Lyapunov functional, the stability conditions or the solvability conditions of the consensus problem are given in terms of a set of linear matrix inequalities apart from a small number of scalar parameters that appear nonlinearly. Furthermore, the linear matrix inequalities are theoretically verified to be solvable when the communication delay is sufficiently small. The effectiveness of the proposed control protocol is illustrated by numerical examples. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
14.
This paper deals with the robust consensus tracking problem for a class of heterogeneous second‐order nonlinear multi‐agent systems with bounded external disturbances. First, a distributed adaptive control law is proposed based on the relative position and velocity information. It is shown that for any connected undirected communication graph, the proposed control law solves the robust consensus tracking problem. Then, by introducing a novel distributed observer and employing backstepping design techniques, a distributed adaptive control law is constructed based only on the relative position information. Compared with the existing results, the proposed adaptive consensus protocols are in a distributed fashion, and the nonlinear functions are not required to satisfy any globally Lipschitz or Lipschitz‐like condition. Numerical examples are given to verify our proposed protocols. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
15.
In this paper, we consider the quantization effect on an adaptive motion coordination control law for passive multi‐agent systems when the time‐varying reference velocity is only available to the leader. Both logarithmic quantizers and uniform quantizers are investigated. Using tools from nonsmooth analysis and the Barbalat lemma, we prove that with undirected connected communication graphs, coordination problem is still solvable when logarithmic quantizers are used and the parameter convergence is also guaranteed when the basis functions satisfy certain persistently exciting property. When uniform quantizers are used, we prove that practical consensus can be achieved, and both the bounds of the consensus error and the velocity tracking error are proportional to the parameter of the quantizer. Simulation examples are provided to illustrate the results. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
16.
We are concerned with the consensus problem for a class of uncertain nonlinear multi‐agent systems (MASs) connected through an undirected communication topology via event‐triggered approaches in this paper. Two distributed control strategies, the adaptive centralized event‐triggered control one and adaptive distributed event‐triggered control one, are presented utilizing neural networks (NNs) and event‐driven mechanisms, where the advantages of the proposed control laws lie that they remove the requirement for exact priori knowledge about parameters of individual agents by taking advantage of NNs approximators and they save computing and communication resources since control tasks only execute at certain instants with respect to predefined threshold functions. Also, the trigger coefficient can be regulated adaptively with dependence on state errors to ensure not only the control performance but also the efficiency of the network interactions. It is proven that all signals in the closed‐loop system are bounded and the Zeno behavior is excluded. Finally, simulation examples are presented for illustration of the theoretical claims. 相似文献
17.
In this paper, the distributed consensus and tracking protocols are developed for the second‐order time‐varying nonlinear multi‐agent systems under general directed graph. Firstly, the consensus and tracking problems can be converted into a conventional stabilization control problem. Then a state transformation is employed to deal with the time‐varying nonlinearities. By choosing an appropriate time‐varying parameter and coupling strengths, exponential consensus and tracking of second‐order nonlinear multi‐agent systems can be achieved. Finally, a simulation is given to illustrate the effectiveness of the proposed consensus and tracking protocols. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献
18.
We use a high‐gain methodology to construct linear decentralized controllers for consensus, in networks with identical but general multi‐input linear time‐invariant (LTI) agents and quite‐general time‐invariant and time‐varying observation topologies. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
19.
Distributed dynamic average consensus is investigated under quantized communication data. We use a uniform quantizer with constant quantization step‐size to deal with the saturation caused by the dynamic consensus error and propose a communication feedback‐based distributed consensus protocol suitable for directed time‐varying topologies to make the internal state of each agent's encoder consistent with the output of its neighbors' decoder. For the case where the communication topology is directed, balanced and periodically connected, it is shown that if the difference of the reference inputs satisfies some boundedness condition, then the designed quantized dynamic consensus protocol can ensure the states of all the agents achieve dynamic average consensus with arbitrarily small steady state error by properly choosing system parameters. The lower bound of the required quantization levels and the method to choose the system parameters are also presented. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
20.
This paper proposes a new class of nonlinear protocols for fixed‐time consensus in networked agents with directed and intermittent communications. First of all, based on the assumption of a common positive dwell time for all successful links, it is theoretically shown that the asymptotical consensus can be achieved if the interaction topology with some fixed length of time has a spanning tree. Then, if the length sum of time intervals, over which the directed interaction topology contains a spanning tree, is larger that a threshold value, which is independent of initial conditions, the system will solve a fixed‐time consensus problem. Furthermore, in light of the mirror operation principle of graph theory, the proposed protocol is extended to solve the fixed‐time consensus problem if a common positive dwell time for all active links is strongly connected without the detailed balanced condition. Finally, the effectiveness of the theoretical results is illustrated by simulation results. 相似文献