Consensus of Discrete-Time Second-Order Multi-Agent Systems with Partial Information Transmission

2013 ◽  
Vol 457-458 ◽  
pp. 1069-1073
Author(s):  
Lei Ding
Keyword(s):  
Information Transmission ◽  
Partial Information ◽  
Necessary Condition ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Position Information ◽  
Agent Systems ◽  
Multi Agent ◽  
Sufficient And Necessary Condition

This paper investigates the consensus problem of multi-agent systems with partial information transmission under an undirected topology. A distributed consensus protocol is proposed with local velocity feedback and the position information from neighbors. The consensus problem is converted to the stabilization problem by transforming the original systems into a reduced order state system. Then, by using graph theory and Jurys stability test, a sufficient and necessary condition for consensus of multi-agent systems is derived. An example is given to illustrate the effectiveness of the presented results.

scholarly journals Consensus Analysis for High-Order Multi-Agent Systems without or with Delays

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Zhengxin Wang ◽  
Yang Cao
Keyword(s):  
Partial Information ◽  
Sufficient Conditions ◽  
High Order ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Consensus Analysis ◽  
Agent Systems ◽  
Multi Agent ◽  
Necessary And Sufficient

This paper studies the consensus problem for a high-order multi-agent systems without or with delays. Consensus protocols, which only depend on the own partial information of agents and partial relative information with its neighbors, are proposed for consensus and quasi-consensus, respectively. Firstly, some lemmas are presented, and then a necessary and sufficient condition for guaranteeing the consensus is established under the consensus protocol without delays. Furthermore, communication delays are considered. Some necessary and sufficient conditions for solving quasi-consensus problem with delays are obtained. Finally, some simulations are given to verify the theoretical results.

Consensus Problem of Singular Multi-Agent Systems with Continuous-Time and Fixed Topology

2013 ◽  
Vol 278-280 ◽  
pp. 1687-1691
Author(s):  
Tong Qiang Jiang ◽  
Jia Wei He ◽  
Yan Ping Gao
Keyword(s):  
Continuous Time ◽  
Spanning Tree ◽  
Undirected Graph ◽  
Necessary Condition ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Fixed Topology ◽  
The Stability ◽  
Sufficient And Necessary Condition

The consensus problems of two situations for singular multi-agent systems with fixed topology are discussed: directed graph without spanning tree and the disconnected undirected graph. A sufficient and necessary condition is obtained by applying the stability theory and the system is reachable asymptotically. But for normal systems, this can’t occur in upper two situations. Finally a simulation example is provided to verify the effectiveness of our theoretical result.

Leader-following consensus of heterogeneous linear multi-agent systems: New results based on linear transformation method

2021 ◽  
pp. 014233122110582
Author(s):  
Yangzhou Chen ◽  
Guangyue Xu ◽  
Jingyuan Zhan
Keyword(s):  
Linear Transformation ◽  
Design Method ◽  
Transformation Method ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Agent Systems ◽  
Hurwitz Stability ◽  
Leader Following ◽  
Multi Agent

This paper studies the leader-following state consensus problem for heterogeneous linear multi-agent systems under fixed directed communication topologies. First, we propose a consensus protocol consisting of four parts for high-order multi-agent systems, in which different agents are allowed to have different gain matrices so as to increase the degree of design freedom. Then, we adopt a state linear transformation, which is constructed based on the incidence matrix of a directed spanning tree of the communication topology, to equivalently transform the state consensus problem into a partial variable stability problem. Meanwhile, the results of the partial variable stability theory are used to derive a sufficient and necessary consensus criterion, expressed as the Hurwitz stability of a real matrix. Then, this criterion is further expressed as a bilinear matrix inequality condition, and, based on this condition, an iterative algorithm is proposed to find the gain matrices of the protocol. Finally, numerical examples are provided to verify the effectiveness of the proposed protocol design method.

scholarly journals Nonlinear Consensus Protocol Modified from Doubly Stochastic Quadratic Operators in Networks of Dynamic Agents

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1519 ◽  
Author(s):  
Rawad Abdulghafor ◽  
Sultan Almotairi ◽  
Hamad Almohamedh ◽  
Sherzod Turaev ◽  
Badr Almutairi
Keyword(s):  
Theoretical Analysis ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Agent Systems ◽  
Doubly Stochastic ◽  
Average Consensus ◽  
Multi Agent ◽  
Mathematical Equations ◽  
Simulation Results

This article explores nonlinear convergence to limit the effects of the consensus problem that usually occurs in multi-agent systems. Most of the existing research essentially considers the outline of linear protocols, using complex mathematical equations in various orders. In this work, however, we designed and developed an alternative nonlinear protocol based on simple and effective mathematical approaches. The designed protocol in this sense was modified from the Doubly Stochastic Quadratic Operators (DSQO) and was aimed at resolving consensus problems. Therefore, we called it Modified Doubly Stochastic Quadratic Operators (MDSQO). The protocol was derived in the context of coordinated systems to overcome the consensus issue related to multi-agent systems. In the process, we proved that by using the proposed nonlinear protocol, the consensus could be reached via a common agreement among the agents (average consensus) in a fast and easy fashion without losing any initial status. Moreover, the investigated nonlinear protocol of MDSQO realized the reaching consensus always as well as DSQO in some cases, which could not reach consensus. Finally, simulation results were given to prove the validity of the theoretical analysis.

Consensus Analysis for a Class of Heterogeneous Multi-Agent Systems in Directed Graph

2014 ◽  
Vol 599-601 ◽  
pp. 1930-1933
Author(s):  
Yi Jie Sun ◽  
Guo Liang Zhang ◽  
Jing Zeng
Keyword(s):  
Directed Graph ◽  
Matrix Theory ◽  
Sufficient Condition ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Consensus Analysis ◽  
Agent Systems ◽  
First Order ◽  
Multi Agent

This paper investigates the consensus problem for heterogeneous multi-agent systems in directed graph. The system includes first-order and second-order agents. A linear consensus protocol is proposed for solving such a consensus problem. A sufficient condition for the consensus problem is established by applying graph theory and matrix theory. Finally, a numerical simulation is provided to illustrate the effectiveness of the theoretical result.

Distributed consensus of multi-agent systems with increased convergence rate

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Ke-cai Cao ◽  
Yun Chai ◽  
Chenglin Liu
Keyword(s):  
Convergence Rate ◽  
Finite Time ◽  
Nearest Neighbor ◽  
Laplacian Matrix ◽  
Consensus Problem ◽  
Multi Agent System ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Agent Systems ◽  
Multi Agent

AbstractConsensus problem with faster convergence rate of consensus problem has been considered in this paper. Adding more edges such as that connecting each agent and its second-nearest neighbor or changing the consensus protocol such as mixing asymptotic terms and terms of finite-time has been proved to be possible ways in increasing the convergence rate of multi-agent system in this paper. Based on analysis of Laplacian matrix, increasing of the convergence rate has been proved using the second-smallest eigenvalue for the first method. Concerning the second method, advantages of asymptotic consensus protocol and finite-time consensus protocol have been mixed together with the help of homogeneity function and theory of Lyapunov. Simulation results using matlab are also presented to illustrate the newly designed consensus protocols in increasing the convergence rate.

scholarly journals Fault Tolerant Consensus of Multi-Agent Systems with Linear Dynamics

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Jianzhen Li
Keyword(s):  
Convergence Analysis ◽  
Fault Tolerant ◽  
Consensus Problem ◽  
Actuator Faults ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Linear Dynamics ◽  
Agent Systems ◽  
Small Set ◽  
Multi Agent

This paper deals with the consensus problem of linear multi-agent systems with actuator faults. A fault estimator based consensus protocol is provided, together with a convergence analysis. It is shown that the consensus errors of all agents will converge to a small set around the origin, if parameters in the consensus protocol are properly chosen. A numerical example is given to illustrate the effectiveness of the proposed protocol.

Sign in / Sign up

Export Citation Format

Share Document