scholarly journals Distributed Consensus of Semi-Markovian Jumping Multiagent Systems with Mode-Dependent Topologies

2018 ◽  
Vol 2018 ◽  
pp. 1-7
Author(s):  
Yidao Ji
Keyword(s):  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Consensus Problem ◽  
Mean Square ◽  
Sampled Data ◽  
Distributed Consensus ◽  
Consensus Protocol ◽  
Markov Jump ◽  
Markovian Jumping ◽  
Mean Square Stability

This paper investigates the distributed consensus problem of multiagent systems with semi-Markovian jumping dynamics in the mean-square sense. Moreover, the mode-dependent communication topologies and sampled-data consensus protocol over the networks are considered. By semi-Markov jump theory, the consensus problem is first transformed into a mean-square stability problem. Then, sufficient conditions are established with the designed mode-dependent consensus protocol. Finally, a numerical example is provided for verifying the effectiveness of our theoretical results.

scholarly journals Bipartite Consensus of Heterogeneous Multiagent Systems Based on Distributed Event-Triggered Control

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-14 ◽  
Author(s):  
Xiaoyu Wang ◽  
Kaien Liu ◽  
Zhijian Ji ◽  
Shitao Han
Keyword(s):  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Input Delay ◽  
Consensus Problem ◽  
Consensus Protocol ◽  
Control Scheme ◽  
Event Triggering ◽  
Bipartite Consensus ◽  
Theoretical Results ◽  
Event Triggered

In this paper, the bipartite consensus problem of heterogeneous multiagent systems composed of first-order and second-order agents is considered by utilizing the event-triggered control scheme. Under structurally balanced directed topology, event-triggered bipartite consensus protocol is put forward, and event-triggering functions consisting of measurement error and threshold are designed. To exclude Zeno behavior, an exponential function is introduced in the threshold. The bipartite consensus problem is transformed into the corresponding stability problem by means of gauge transformation and model transformation. By virtue of Lyapunov method, sufficient conditions for systems without input delay are obtained to guarantee bipartite consensus. Furthermore, for the case with input delay, sufficient conditions which include an admissible upper bound of the delay are obtained to guarantee bipartite consensus. Finally, numerical simulations are provided to illustrate the effectiveness of the obtained theoretical results.

scholarly journals Leader-Following Consensus of Multiagent Systems with Time-Varying Delays via Impulsive Control

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Zhiyong Ye ◽  
Yungen Chen ◽  
Hua Zhang
Keyword(s):  
Multiagent Systems ◽  
Control Method ◽  
Impulsive Control ◽  
Sufficient Conditions ◽  
Time Varying ◽  
Distributed Consensus ◽  
Consensus Protocol ◽  
Sample Data ◽  
Leader Following ◽  
Discrete Moments

The leader-following consensus problem for delayed multiagent systems is investigated over stochastic switching topologies via impulsive control method. A distributed consensus protocol is proposed based on sample data information. The convergence analysis for such algorithm over undirected and directed networks is provided, and some sufficient conditions to guarantee the consensus are also established. It is shown that delayed networks can achieve consensus even information is exchanged among followers just at some discrete moments. At last, some numerical examples are given to illustrate the effectiveness of the proposed protocols.

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 Distributed Consensus for Discrete-Time Directed Networks of Multiagents with Time-Delays and Random Communication Links

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Yurong Liu ◽  
Hamid Reza Karimi ◽  
Xiaohui Liu
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Time Delays ◽  
Sufficient Conditions ◽  
Analytical Techniques ◽  
Time Varying ◽  
Mean Square ◽  
Distributed Consensus ◽  
Communication Links ◽  
Leader Following

This paper is concerned with the leader-following consensus problem in mean-square for a class of discrete-time multiagent systems. The multiagent systems under consideration are the directed and contain arbitrary discrete time-delays. The communication links are assumed to be time-varying and stochastic. It is also assumed that some agents in the network are well informed and act as leaders, and the others are followers. By introducing novel Lyapunov functionals and employing some new analytical techniques, sufficient conditions are derived to guarantee the leader-following consensus in mean-square for the concerned multiagent systems, so that all the agents are steered to an anticipated state target. A numerical example is presented to illustrate the main results.

scholarly journals Event-Triggered Bipartite Consensus of Single-Integrator Multi-Agent Systems with Measurement Noise

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Cui-Qin Ma ◽  
Yun-Bo Zhao ◽  
Wei-Guo Sun
Keyword(s):  
Sufficient Conditions ◽  
Measurement Noise ◽  
Mean Square ◽  
Multi Agent Systems ◽  
Negative Effects ◽  
Consensus Protocol ◽  
Agent Systems ◽  
Multi Agent ◽  
Bipartite Consensus ◽  
Event Triggered

Event-triggered bipartite consensus of single-integrator multi-agent systems is investigated in the presence of measurement noise. A time-varying gain function is proposed in the event-triggered bipartite consensus protocol to reduce the negative effects of the noise corrupted information processed by the agents. Using the state transition matrix, Ito^ formula, and the algebraic graph theory, necessary and sufficient conditions are given for the proposed protocol to yield mean square bipartite consensus. We find that the weakest communication requirement to ensure the mean square bipartite consensus under event-triggered protocol is that the signed digraph is structurally balanced and contains a spanning tree. Numerical examples validated the theoretical findings where the system shows no Zeno behavior.

scholarly journals Adaptive Guaranteed-Performance Consensus Control for Multi-Agent Systems with an Adjustable Convergence Speed

2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Haiying Ma ◽  
Xiao Jia ◽  
Ning Cai ◽  
Jianxiang Xi
Keyword(s):  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Convergence Speed ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Consensus Control ◽  
Control Gain ◽  
Multi Agent ◽  
The Stability ◽  
Theoretical Results

In this paper, adaptive guaranteed-performance consensus control problems for multiagent systems with an adjustable convergence speed are investigated. A novel adaptive guaranteed-performance consensus protocol is proposed, where the communication weights can be adaptively regulated. By the state space decomposition method and the stability theory, sufficient conditions for guaranteed-performance consensus are obtained and the guaranteed-performance cost is determined. Moreover, the lower bound of the convergence coefficient for multiagent systems is deduced, which is linearly adjustable approximately by changing the adaptive control gain. Finally, simulation examples are introduced to demonstrate theoretical results.

Multiconsensus of first-order multiagent systems with directed topologies

2020 ◽  
Vol 34 (23) ◽  
pp. 2050240
Author(s):  
Xiao-Wen Zhao ◽  
Guangsong Han ◽  
Qiang Lai ◽  
Dandan Yue
Keyword(s):  
Multiagent Systems ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Consensus Problem ◽  
Multiple Agents ◽  
First Order ◽  
The Matrix ◽  
Directed Topologies ◽  
Necessary And Sufficient ◽  
Theoretical Results

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.

scholarly journals Distributed Consensus Tracking for Second-Order Nonlinear Multiagent Systems with a Specified Reference State

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Guoguang Wen ◽  
Yongguang Yu ◽  
Zhaoxia Peng ◽  
Ahmed Rahmani
Keyword(s):  
Multiagent Systems ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Second Order ◽  
Lyapunov Theory ◽  
Reference Trajectory ◽  
Distributed Consensus ◽  
Consensus Tracking ◽  
Velocity Information ◽  
Virtual Leader

This paper mainly addresses the distributed consensus tracking problem for second-order nonlinear multiagent systems with a specified reference trajectory. The dynamics of each follower consists of two terms: nonlinear inherent dynamics and a simple communication protocol relying only on the position and velocity information of its neighbors. The consensus reference is taken as a virtual leader, whose output is only its position and velocity information that is available to only a subset of a group of followers. To achieve consensus tracking, a class of nonsmooth control protocols is proposed which reply on the relative information among the neighboring agents. Then some corresponding sufficient conditions are derived. It is shown that if the communication graph associated with the virtual leader and followers is connected at each time instant, the consensus can be achieved at least globally exponentially with the proposed protocol. Rigorous proofs are given by using graph theory, matrix theory, and Lyapunov theory. Finally, numerical examples are presented to illustrate the theoretical analysis.

Sign in / Sign up

Export Citation Format

Share Document