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

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.

2020 ◽  
Vol 34 (23) ◽  
pp. 2050240
Author(s):  
Xiao-Wen Zhao ◽  
Guangsong Han ◽  
Qiang Lai ◽  
Dandan Yue

The multiconsensus problem of first-order multiagent systems with directed topologies is studied. A novel consensus problem is introduced in multiagent systems — multiconsensus. The states of multiple agents in each subnetwork asymptotically converge to an individual consistent value in the presence of information exchanges among subnetworks. Linear multiconsensus protocols are proposed to solve the multiconsensus problem, and the matrix corresponding to the protocol is designed. Necessary and sufficient conditions are derived based on matrix theory, under which the stationary multiconsensus and dynamic multiconsensus can be reached. Simulations are provided to demonstrate the effectiveness of the theoretical results.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Yiliu Jiang ◽  
Lianghao Ji ◽  
Xingcheng Pu ◽  
Qun Liu

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.


2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Bingbing Xu ◽  
Lixin Gao ◽  
Yan Zhang ◽  
Xiaole Xu

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.


2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
He Jiang ◽  
Dongsheng Yang

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.


2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Huiyang Liu ◽  
Xiaoshuang Wang

This paper investigates couple-group consensus problems for multiagent first-order and second-order systems. Several consensus protocols are proposed based on the time-dependent distributed event-triggered control. For the case of no communication delays, the time-dependent event-triggered strategies are applied to couple-group consensus problems. Based on the matrix theory, algebraic conditions for couple-group consensus are established. For the system with communication delays, based on event-triggered strategies, a Lyapunov-Krasovskii functional is constructed to prove the input-to-state stability of the systems. Moreover, Zeno behavior is excluded. Finally, numeral examples are given to illustrate the effectiveness of these results.


1998 ◽  
Vol 13 (34) ◽  
pp. 2731-2742 ◽  
Author(s):  
YUTAKA MATSUO

We give a reinterpretation of the matrix theory discussed by Moore, Nekrasov and Shatashivili (MNS) in terms of the second quantized operators which describes the homology class of the Hilbert scheme of points on surfaces. It naturally relates the contribution from each pole to the inner product of orthogonal basis of free boson Fock space. These bases can be related to the eigenfunctions of Calogero–Sutherland (CS) equation and the deformation parameter of MNS is identified with coupling of CS system. We discuss the structure of Virasoro symmetry in this model.


2017 ◽  
Vol 417 ◽  
pp. 236-246 ◽  
Author(s):  
Huiwei Liu ◽  
Hamid Reza Karimi ◽  
Shengli Du ◽  
Weiguo Xia ◽  
Chongquan Zhong

Sign in / Sign up

Export Citation Format

Share Document