scholarly journals Consensus Problem of High-Order Multiagent Systems with Time Delays

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Jianhui Liu ◽  
Bin Zhang
Keyword(s):  
Multiagent Systems ◽  
Time Domain ◽  
Time Delays ◽  
High Order ◽  
The State ◽  
Consensus Problem ◽  
Lyapunov Approach ◽  
Numerical Example ◽  
Riccati Inequality

In this paper, we consider the consensus problem of high-order multiagent systems on both fixed and switching interaction topologies with time delays. A neighbor-based protocol is presented, under which we prove that the state errors converge to zero asymptotically if there is a solution to a given Riccati inequality. The proof of our theorem is shown in time domain based on a Lyapunov approach. A numerical example is introduced to indicate the correctness of our analysis.

scholarly journals Consensus Analysis of High-Order Multiagent Systems with General Topology and Asymmetric Time-Delays

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Fangcui Jiang
Keyword(s):  
Multiagent Systems ◽  
Network Topology ◽  
Time Delays ◽  
Multiagent System ◽  
High Order ◽  
Directed Network ◽  
Time Varying ◽  
Consensus Analysis ◽  
Robust Consensus ◽  
Selection Of

This paper focuses on the consensus problem for high-order multiagent systems (MAS) with directed network and asymmetric time-varying time-delays. It is proved that the high-order multiagent system can reach consensus when the network topology contains a spanning tree and time-delay is bounded. The main contribution of this paper is that a Lyapunov-like design framework for the explicit selection of protocol parameters is provided. The Lyapunov-like design guarantees the robust consensus of the high-order multiagent system with respect to asymmetric time-delays and is independent of the exact knowledge of the topology when the communication linkages among agents are undirected and connected.

scholarly journals Consensus Conditions for High-Order Multiagent Systems with Nonuniform Delays

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Mengji Shi ◽  
Kaiyu Qin ◽  
Ping Li ◽  
Jun Liu
Keyword(s):  
Multiagent Systems ◽  
Time Delays ◽  
Second Order ◽  
High Order ◽  
Sixth Order ◽  
Multiple Time ◽  
State Variables ◽  
Third Order ◽  
First Order ◽  
The Third

Consensus of first-order and second-order multiagent systems has been wildly studied. However, the convergence of high-order (especially the third-order to the sixth-order) state variables is also ubiquitous in various fields. The paper handles consensus problems of high-order multiagent systems in the presence of multiple time delays. Obtained by a novel frequency domain approach which properly resolves the challenges associated with nonuniform time delays, the consensus conditions for the first-order and second-order systems are proven to be nonconservative, and those for the third-order to the sixth-order systems are provided in the form of simple inequalities. The method revealed in this article is applicable to arbitrary-order systems, and the results are less conservative than those based on Lyapunov approaches, because it roots in sufficient and necessary criteria of stabilities. Simulations are carried out to validate the theoretical results.

scholarly journals Consensus of Heterogeneous Multiagent Systems with Arbitrarily Bounded Communication Delay

2017 ◽  
Vol 2017 ◽  
pp. 1-6
Author(s):  
Xue Li ◽  
Huai Wu ◽  
Yikang Yang
Keyword(s):  
Multiagent Systems ◽  
Spanning Trees ◽  
High Order ◽  
Communication Delay ◽  
Consensus Problem ◽  
Nonnegative Matrices ◽  
Communication Delays ◽  
Communication Graphs

This paper focuses on the consensus problem of high-order heterogeneous multiagent systems with arbitrarily bounded communication delays. Through the method of nonnegative matrices, we get a sufficient consensus condition for the systems with dynamically changing topology. The results of this paper show, even when there are arbitrarily bounded communication delays in the systems, all agents can reach a consensus no matter whether there are spanning trees for the corresponding communication graphs at any time.

scholarly journals State Consensus Analysis and Design for High-Order Discrete-Time Linear Multiagent Systems

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Yanrong Ge ◽  
Yangzhou Chen ◽  
Yaxiao Zhang ◽  
Zhonghe He
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
The State ◽  
Feedback Gain ◽  
Consensus Problem ◽  
Consensus Protocol ◽  
Consensus Function ◽  
Consensus Analysis ◽  
Analysis And Design ◽  
Time Linear

The paper deals with the state consensus problem of high-order discrete-time linear multiagent systems (DLMASs) with fixed information topologies. We consider three aspects of the consensus analysis and design problem: (1) the convergence criteria of global state consensus, (2) the calculation of the state consensus function, and (3) the determination of the weighted matrix and the feedback gain matrix in the consensus protocol. We solve the consensus problem by proposing a linear transformation to translate it into a partial stability problem. Based on the approach, we obtain necessary and sufficient criteria in terms of Schur stability of matrices and present an analytical expression of the state consensus function. We also propose a design process to determine the feedback gain matrix in the consensus protocol. Finally, we extend the state consensus to the formation control. The results are explained by several numerical examples.

scholarly journals Consensus of High-Order Linear Multiagent Systems with Multitype Switching Topologies Based on the Dynamic Dwell Time Approach

2016 ◽  
Vol 2016 ◽  
pp. 1-8
Author(s):  
Yaxiao Zhang ◽  
Yangzhou Chen ◽  
Xiaojun Qu
Keyword(s):  
Multiagent Systems ◽  
Dwell Time ◽  
High Order ◽  
Sufficient Condition ◽  
Consensus Problem ◽  
Switching Rule ◽  
Switching Topologies ◽  
The Stability ◽  
Necessary And Sufficient ◽  
The Impact

This paper investigates the consensus problem of high-order continuous-time linear multiagent systems (LMASs) with multitype switching topologies which include both consensusable and unconsensusable communication topologies. A linear transformation is introduced, which equivalently transforms the consensus problem into the stability problem of a corresponding switched system, along with a necessary and sufficient condition to analyze the consensus problem. This paper is aimed at studying the impact of a switching rule on communication topologies for consensus of LMASs. Based on the dynamic dwell time method, a sufficient condition is derived for consensus of LMASs. It is shown that, with switching signals that satisfy this switching rule, LMASs can achieve consensus under directed switching communication topologies. A numerical example is provided to illustrate the effectiveness of the theoretical results.

scholarly journals Fast Consensus of Networked Multiagent Systems with Two-Hop Network

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Jinfeng Gao ◽  
Bin Bu ◽  
Lihui Feng ◽  
Minming Gu
Keyword(s):  
Distributed Control ◽  
Multiagent Systems ◽  
Large Scale ◽  
The State ◽  
Convergence Speed ◽  
Consensus Protocol ◽  
Large Scale Systems ◽  
Numerical Example ◽  
Communication Topology ◽  
Networked Multiagent Systems

This paper studies the consensus convergence speed of multiagent systems (MASs) from two aspects including communication topology and the state of agents. Two-hop network is considered in the communication topology. A novel consensus protocol that includes the information of the states motions and their integrals is introduced. And the protocol has much faster convergence speed by choosing some appropriate weight values. The protocol can be applied to distributed control and large-scale systems. A numerical example is presented to illustrate the effectiveness and superiority of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document