scholarly journals Output Consensus Regulation for State-Unmeasurable Discrete-Time Multiagent Systems with External Disturbances

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
He Jiang ◽  
Dongsheng Yang
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Matrix Theory ◽  
Consensus Protocol ◽  
External Disturbances ◽  
State Observers ◽  
Network Topologies ◽  
Dynamic Compensator ◽  
Design Protocol ◽  
The Mathematical Model

This paper deals with the output consensus regulation problem for discrete-time multiagent systems with state-unmeasurable agents and external disturbances under directed communication network topologies. Firstly, the mathematical model for the output consensus problem of discrete-time multiagent systems is deduced and formulated via making matrix transformation. Then, based on state observers, a novel output consensus protocol with dynamic compensator which is used as observer for the exosystem is proposed to solve this problem. Some knowledge of matrix theory and graph theory is introduced to design protocol parameters and the convergence of output consensus errors is proved. Finally, a numerical simulation example is shown to verify the effectiveness of the proposed protocol design.

scholarly journals Asynchronous Communication under Reliable and Unreliable Network Topologies in Distributed Multiagent Systems: A Robust Technique for Computing Average Consensus

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Ali Mustafa ◽  
Muhammad Najam ul Islam ◽  
Salman Ahmed ◽  
Muhammad Ahsan Tufail
Keyword(s):  
Multiagent Systems ◽  
Time Synchronization ◽  
Matrix Theory ◽  
Asynchronous Communication ◽  
Consensus Protocol ◽  
Basic Principles ◽  
Consensus Algorithms ◽  
Multiagent Networks ◽  
Asynchronous Communications ◽  
Network Topologies

Nearly all applications in multiagent systems demand precision, robustness, consistency, and rapid convergence in designing of distributed consensus algorithms. Keeping this thing in our sight, this research suggests a robust consensus protocol for distributed multiagent networks, continuing asynchronous communications, where agent’s states values are updated at diverse interval of time. This paper presents an asynchronous communication for both reliable and unreliable network topologies. The primary goal is to delineate local control inputs to attain time synchronization by processing the update information received by the agents associated in a communication topology. Additionally in order to accomplish the robust convergence, modelling of convergence analysis is conceded by commissioning the basic principles of graph and matrix theory alongside the suitable lemmas. Moreover, statistical examples presenting four diverse scenarios are provided in the end; produced results are the recognisable indicator to authenticate the robust effectiveness of the proposed algorithm. Likewise, a simulation comparison of the projected algorithm with the other existing approaches is conducted, considering different performance parameters are being carried out to support our claim.

scholarly journals Partial Component Consensus of Discrete-Time Multiagent Systems

2019 ◽  
Vol 2019 ◽  
pp. 1-5
Author(s):  
Wenjun Hu ◽  
Gang Zhang ◽  
Zhongjun Ma ◽  
Binbin Wu
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Matrix Theory ◽  
Pinning Control ◽  
Directed Network ◽  
Strong Function ◽  
Partial Stability ◽  
Partial Component ◽  
The Matrix ◽  
Error System

The multiagent system has the advantages of simple structure, strong function, and cost saving, which has received wide attention from different fields. Consensus is the most basic problem in multiagent systems. In this paper, firstly, the problem of partial component consensus in the first-order linear discrete-time multiagent systems with the directed network topology is discussed. Via designing an appropriate pinning control protocol, the corresponding error system is analyzed by using the matrix theory and the partial stability theory. Secondly, a sufficient condition is given to realize partial component consensus in multiagent systems. Finally, the numerical simulations are given to illustrate the theoretical results.

scholarly journals Group Consensus for Discrete-Time Heterogeneous Multiagent Systems with Input and Communication Delays

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Yiliu Jiang ◽  
Lianghao Ji ◽  
Xingcheng Pu ◽  
Qun Liu
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Time Delays ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Frequency Domain Analysis ◽  
Communication Delays ◽  
Group Consensus ◽  
Cooperative Relationships ◽  
Input Time

Group consensus seeking is investigated for a class of discrete-time heterogeneous multiagent systems composed of first-order and second-order agents with both communication and input time delays. Considering two types of system topologies, novel protocols based on the competitive and cooperative relationships among the agents are presented, respectively. By matrix theory and frequency domain analysis method, the sufficient conditions solving consensus problem are obtained. The results show that the achievement of group consensus is bound up with the input time delays, coupling weights between the agents and the system’s control parameters, but it is irrelevant to the communication delays. Finally, numerical simulations are presented to illustrate the correctness of the theoretical results.

scholarly journals Distributed Node-to-Node Consensus of Multiagent Systems with Delayed Nonlinear Dynamics and Intermittent Communications

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Kexin Jia ◽  
Hongjie Li ◽  
Wenqiang Zheng ◽  
Qinyou Mou ◽  
Jiajun Shao
Keyword(s):  
Nonlinear Dynamics ◽  
Multiagent Systems ◽  
Matrix Theory ◽  
Lyapunov Stability Theory ◽  
Threshold Value ◽  
Consensus Protocol ◽  
Time Duration ◽  
Communication Time ◽  
Intermittent Measurements ◽  
Intermittent Communications

The paper is concerned with the problem of distributed node-to-node consensus of multiagent systems with delayed nonlinear dynamics and communication constraints. A new kind of consensus protocol based only on the intermittent measurements of neighboring agents is proposed to make each follower track the corresponding leader asymptotically. Based on the Lyapunov stability theory andM-matrix theory, some novel and simple criteria are derived for node-to-node consensus of multiagent systems. It is shown that consensus can be reached if the communication time duration is larger than the corresponding threshold value. Finally, a numerical example is provided to demonstrate the effectiveness of the obtained theoretical results.

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 Dynamic Average Consensus and Consensusability of General Linear Multiagent Systems with Random Packet Dropout

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Wen-Min Zhou ◽  
Jiang-Wen Xiao
Keyword(s):  
Multiagent Systems ◽  
Information Exchange ◽  
Matrix Theory ◽  
Weighted Graph ◽  
General Linear ◽  
Packet Dropout ◽  
Consensus Problem ◽  
Mean Square ◽  
Consensus Protocol ◽  
Random Packet Dropout

This paper is concerned with the consensus problem of general linear discrete-time multiagent systems (MASs) with random packet dropout that happens during information exchange between agents. The packet dropout phenomenon is characterized as being a Bernoulli random process. A distributed consensus protocol with weighted graph is proposed to address the packet dropout phenomenon. Through introducing a new disagreement vector, a new framework is established to solve the consensus problem. Based on the control theory, the perturbation argument, and the matrix theory, the necessary and sufficient condition for MASs to reach mean-square consensus is derived in terms of stability of an array of low-dimensional matrices. Moreover, mean-square consensusable conditions with regard to network topology and agent dynamic structure are also provided. Finally, the effectiveness of the theoretical results is demonstrated through an illustrative example.

scholarly journals Robust Consensus for Nonlinear Multiagent Systems with Uncertainty and Disturbance

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Zhiqiang Li ◽  
Chengjie Xu ◽  
Chen Liu ◽  
Haichuan Xu
Keyword(s):  
Numerical Simulation ◽  
Multiagent Systems ◽  
Lyapunov Stability ◽  
Matrix Theory ◽  
Lyapunov Stability Theory ◽  
Consensus Protocol ◽  
Evolution Behavior ◽  
Robust Consensus ◽  
Theoretical Results ◽  
Relative States

This paper investigates robust consensus for nonlinear multiagent systems with uncertainty and disturbance. The consensus evolution behavior is studied under general consensus protocol when each node is disturbed by the relative states between the node and its neighbors. At first, the robust consensus condition is obtained and the convergency analysis is given by using Lyapunov stability theory and matrix theory. Then, the practical consensus is investigated and the bound of the error states is presented. Finally, two numerical simulation examples are given to illustrate the proposed theoretical results.

scholarly journals Leader-Following Consensus Stability of Discrete-Time Linear Multiagent Systems with Observer-Based Protocols

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Bingbing Xu ◽  
Lixin Gao ◽  
Yan Zhang ◽  
Xiaole Xu
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Matrix Theory ◽  
Algebraic Riccati Equation ◽  
State Variables ◽  
Reduced Order ◽  
Communication Topology ◽  
Reduced Order Observer ◽  
Leader Following ◽  
Time Linear

We consider the leader-following consensus problem of discrete-time multiagent systems on a directed communication topology. Two types of distributed observer-based consensus protocols are considered to solve such a problem. The observers involved in the proposed protocols include full-order observer and reduced-order observer, which are used to reconstruct the state variables. Two algorithms are provided to construct the consensus protocols, which are based on the modified discrete-time algebraic Riccati equation and Sylvester equation. In light of graph and matrix theory, some consensus conditions are established. Finally, a numerical example is provided to illustrate the obtained result.

Distributed event-triggered consensus protocols for discrete-time multiagent systems

2021 ◽  
Author(s):  
Bilal J Karaki ◽  
Magdi S Mahmoud
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Sufficient Conditions ◽  
Control Law ◽  
Theory Approach ◽  
Consensus Protocol ◽  
Leader Following ◽  
And Control ◽  
Time Linear ◽  
Event Triggered

Abstract This paper focuses on leader-following and leaderless consensus problems of discrete-time multiagent systems. A distributed observer-based consensus protocol is proposed to investigate the consensus problem for multiagent systems of general discrete-time linear dynamics. By means of the observer, the distributed control law of each agent is designed using local information to guarantee consensus, and the corresponding sufficient conditions are obtained by exploiting graph and control theory approach. A modified distributed event-triggered consensus protocol is designed to reduce communication congestion. Detailed analysis of the leaderless and the leader-following consensus is presented for both observer-based and full-information protocols. Finally, two simulation examples are provided to demonstrate the effectiveness and capabilities of the established theories.

Sign in / Sign up

Export Citation Format

Share Document