共查询到20条相似文献，搜索用时 15 毫秒
1.
Consensus problems are studied for both continuous‐time and discrete‐time multi‐agent singular systems with time‐invariant and directed communication topologies. Under restricted system equivalence of singular agents, sufficient and necessary conditions are obtained for admissible consensus ability with static protocols, which are based on both the relative information of the dynamic states and the absolute information of the static states. For a network of continuous‐time singular systems, the existence of admissible consensualization can be cast into strong stabilizability of the agent dynamics. Once discrete‐time multi‐agent singular systems satisfy the condition of reaching nontrivial final consensus states, strong stabilizability is a sufficient condition to achieve admissible consensualization. Two algorithms are proposed to construct two protocols, which are based on a linear matrix inequality and a modified Riccati equation, respectively. Finally, the algorithms are illustrated by two simulation examples. 相似文献
2.
In this paper, the consensus problem is investigated via bounded controls for the multi‐agent systems with or without communication. Based on the nested saturation method, the saturated control laws are designed to solve the consensus problem. Under the designed saturated control laws, the transient performance of the closed‐loop system can be improved by tuning the saturation level. First of all, asymptotical consensus algorithms with bounded control inputs are proposed for the multi‐agent systems with or without communication delays. Under these consensus algorithms, the states’ consensus can be achieved asymptotically. Then, based on a kind of novel nonlinear saturation functions, bounded finite‐time consensus algorithms are further developed. It is shown that the states’ consensus can be achieved in finite time. Finally, two examples are given to verify the efficiency of the proposed methods. 相似文献
3.
A time averaging technique is introduced to consensus algorithms in networked multi‐agent systems under a noisy environment. Each agent communicates with its neighboring agents via a constant gain, while the time averaging states of the agents are considered as the values for agreement. The variation of the time averaging states then is evaluated at a specific number of iterations, where the number is given explicitly in terms of parameters related to the consensus accuracy and its probabilistic guarantee. This result establishes a rigorous stopping rule for the multi‐agent consensus with noisy measurements. Several results on this type of stopping rules are provided for undirected, directed, and time‐varying communication graphs. These theoretical results are illustrated through numerical examples. 相似文献
4.
In this paper, the finite‐time agreement problem of continuous‐time multi‐agent systems with communication delays is considered. First, the multi‐agent system researched in the paper is described. Second, some notations and lemmas used in the paper are given. Then, agreement protocols for continuous (but non‐smooth) multi‐agent systems are proposed, which ensure that the states of agents reach agreement in finite time. The stability analysis and simulations are presented to show the effectiveness of the method. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society 相似文献
5.
In this paper, we propose two asynchronous distributed protocols for the heading consensus of a multi‐agent group which cannot access a global coordinate system and a global time. Both the leaderless and leader‐following cases are addressed, and inter‐agent communication delay is taken into account. It is proved, under some standard connectivity assumptions, that our leaderless algorithm ensures the heading consensus provided the initial headings are not balanced; and the leader‐based algorithm guarantees the global heading consensus. 相似文献
6.
This paper investigates the finite‐time consensus problem for multi‐agent systems with second‐order individual dynamics under switching topologies. A distributed continuous‐time protocol is designed to guarantee finite‐time consensus for homogeneous agents without predetermined leaders, i.e., it ensures agents asymptotically converge to an average consensus within finite time, even if the interaction topology among them is time‐varying but stepwise jointly‐connected. In particular, it introduces a distributed continuous‐time protocol to reach consensus in finite time and reduce the chattering together. Finally, the simulation results are also given to validate the proposed approach. 相似文献
7.
Consensus in second‐order Markovian jump multi‐agent systems via impulsive control using sampled information with heterogenous delays 
下载免费PDF全文
下载免费PDF全文 This paper investigates the consensus problem of second‐order Markovian jump multi‐agent systems with delays. Both network‐induced random delay and node‐induced state delay are considered, where the network‐induced random delay, subjected to a Markov chain, exists in the switching signal and the node‐induced state delay, related to switching topologies, is heterogeneous between any two linked agents. In order to reduce communication and control energy, an impulsive protocol is proposed, where each agent only can get delayed relative positions to neighbors and the velocity of itself at impulsive instants. By performing three steps of model transformation and introducing a mapping for two independent Markov chains, the consensus problem of the original continuous‐time system is equivalent to the stability problem of a discrete‐time expand error system with two Markovian jumping parameters and a necessary and sufficient criterion is derived. A numerical example is given to illustrate the effectiveness of the theoretical result.@@@@This work is supported by the National Natural Science Foundation of China under Grants 61374171, 61572210, and 51537003, the Fundamental Research Funds for the Central Universities (2015TS030), and the Program for Changjiang Scholars and Innovative Research Team in University (IRT1245). 相似文献
8.
This paper studies the consensus problem for a class of general third‐order multi‐agent systems on an undirected connected network. By employing a variables transformation, the consensus control problem can be turned into a asymptotical stability problem. Then we present a necessary and sufficient condition for guaranteeing consensus by using Routh‐Hurwitz stability criterion. And this result can be applied to a special case of third‐order integrator systems. Also we will present a tolerable communication time delay for third‐order integrator systems under the assumption that multi‐agent systems can reach consensus without communication delay. 相似文献
9.
In this paper, an adaptive protocol is proposed to solve the consensus problem of multi‐agent systems with high‐order nonlinear dynamics by using neural networks (NNs) to approximate the unknown nonlinear system functions. It is derived that all agents achieve consensus if the undirected interaction graph is connected, and the transient performance of the multi‐agent system is also investigated. It shows that the adaptive protocol and the consensus analysis can be easily extended to switching networks by the existing LaSalle's Invariance Principle of switched systems. A numerical simulation illustrates the effectiveness of the proposed consensus protocol. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society 相似文献
10.
This paper considers the problem of the convergence of the consensus for multiple agents in a directed network. A general distributed consensus protocol is designed, the advantage of this protocol is that almost all the existing linear local interaction consensus protocols can be considered as special cases of the present paper. Necessary and sufficient conditions are established for reaching consensus of the system by choosing the appropriate sampling period, the control parameters and the spectra of the Laplacian matrix. It is found that second‐order consensus cannot be reached for a sufficiently large sampling period while it can be reached for a sufficiently small one. Furthermore, the coupling gains can be carefully designed under the given network structure and the sampling period. Finally, a simulation example is given to verify and illustrate the theoretical analysis. 相似文献
11.
This paper addresses the consensus problem of nonlinear multi‐agent systems with unknown external disturbance. First, a distributed observer is proposed to estimate the state and unknown disturbance of each agent simultaneously. Then, a novel event‐triggered control scheme based on the agent state estimation and disturbance estimation is proposed. Unlike the existing strategies, our event‐triggered conditions depend on agent state estimation and disturbance estimation, which are more effective and practical. Under this observer and control strategy, some sufficient conditions are derived to ensure the consensus of the multi‐agent system with unknown external disturbance. Moreover, the Zeno‐behavior of triggering time sequences is also excluded. Finally, a simulation example is given to verify the theoretical analysis. 相似文献
12.
Yu Zhao Guanghui Wen Zhisheng Duan Xiang Xu Guanrong Chen 《Asian journal of control》2013,15(2):571-582
The consensus problem is investigated in this paper for a class of multi‐agent systems with general linear node dynamics and directed communication topologies. A new distributed observer‐type consensus protocol is designed based only on the relative output measurements of neighboring agents. Compared with existing observer‐type protocols, the one presented here does not require information about the relative states of the observers. Tools from small gain theory and matrix analysis, some sufficient conditions are obtained for achieving consensus in such multi‐agent systems where the underlying network topology contains a directed spanning tree. Finally, some numerical examples including an application in low‐Earth‐orbit satellite formation flying are provided to illustrate the theoretical results. 相似文献
13.
This paper studies the synchronization of general linear multi‐agent systems with measurement noises in mean square. It shows that the conventional consensus protocol is efficient and robust to the additive and multiplicative measurement noises in mean square. For the additive measurement noises which are independent of the relative‐states, it shows that the multi‐agent systems can achieve synchronization in practical mean square. For the multiplicative measurement noises which are dependent of the relative‐states, it shows that the multi‐agent systems can achieve synchronization in (strict) mean square. Furthermore, the new consensus protocol is better than the conventional one at some specific situations, i.e., the multi‐agent systems with additive measurement noises can also achieve synchronization in (strict) mean square. Numerical simulations are also provided and the results show highly consistent with the theoretical results. 相似文献
14.
J. Raisch 《Asian journal of control》2014,16(1):30-39
This paper studies the convergence properties of consensus algorithms for agents with double integrator dynamics communicating over networks modelled by undirected graphs. The positions and velocities of the agents are shared along heterogeneous, i.e. different, undirected communication networks. The main result is that consensus can be achieved, even though the networks along which position and velocity information are shared are different, and not even connected. Insights on the consensus rate are given based only on the topological properties of the network. 相似文献
15.
This paper investigates the problem of finite‐time consensus (FTC) for second‐order nonlinear multi‐agent systems when the velocity information is unavailable. Based on the global finite‐time stability theory and homogeneity with dilation, a class of novel finite‐time consensus protocols are proposed for the multi‐agent systems. The protocol design is divided into two parts. First, when all the state information of the agents are measurable, a new continuous state feedback is designed to achieve FTC. Then, when the velocity information is unmeasurable, two finite‐time convergent discontinuous observers are presented to estimate the velocities of the followers and the leader, respectively, which further ensure the final FTC for the multi‐agent systems. Finally, one example is given to demonstrate the efficiency of the proposed method. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
16.
This study considers the formation problem for multi‐agent systems, which are described by the second‐order dynamics on nonlinear manifolds SE(2) and SE(3). In particular, the model of each agent contains information about its attitude. Using a consensus strategy, a control law is developed to guarantee that any desired formation can be achieved asymptotically under the conditions of complete or tree‐shaped communication topologies. Numerical simulations are presented to verify the theoretical results. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
17.
This paper studies bipartite consensus problems for continuous‐time multi‐agent system over signed directed graphs. We consider general linear agents and design both state feedback and dynamic output feedback control laws for the agents to achieve bipartite consensus. Via establishing an equivalence between bipartite consensus problems and the conventional consensus problems under both state feedback and output feedback control approaches, we make direct application of existing state feedback and output feedback consensus algorithms to solve bipartite consensus problems. Moreover, we propose a systematical approach to design bipartite consensus control laws. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
18.
This paper considers the average consensus problems of a class of multi‐agent systems (MAS) with binary‐valued communication. Each agent can only obtain its neighbor's binary‐valued information under measurement noise because of limited bandwidth in communication channels. To seek consensus, we propose a two‐scale multi‐agent consensus algorithm with distributed strategy by combining state estimation and control design alternately. An exponential step size is chosen in the state estimation process and the estimation method can be proved to be asymptotically efficient. Additionally, by utilizing a distributed control law designed based on the estimates of the neighbors' states with a constant gain, we further prove that the proposed average consensus algorithm is convergent. Furthermore, the proposed average consensus algorithm is given and proved. Finally, some simulation results, which illustrate the effectiveness of the obtained results, are also given in the paper. 相似文献
19.
This paper considers a problem of finding distributed controllers for the multi‐agent mass games, that is, to let agents organize themselves into a formation displaying a given grayscale image. As a solution to this problem, we propose distributed hybrid controllers. The key idea is to combine a coverage control method and halftone image processing, i.e., to combine techniques from the control theory and the image processing. The performance of the proposed controllers is demonstrated by numerical experiments with standard images.© 2014 Chinese Automatic Control Society and Wiley Publishing Asia Pty Ltd 相似文献
20.
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. 相似文献