scholarly journals Event-Triggered Average Consensus of Multiagent Systems with Switching Topologies

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Gaosen Dong ◽  
Chunde Yang ◽  
Wei Zhu
Keyword(s):  
Multiagent Systems ◽  
Switching Time ◽  
Sufficient Condition ◽  
Total Period ◽  
Switching Topologies ◽  
Average Consensus ◽  
Inequality Technique ◽  
Theoretical Results ◽  
Event Triggered ◽  
Time Sequences

Event-triggered average consensus of multiagent systems with switching topologies is studied in this paper. A distributed protocol based on event-triggered time sequences and switching time sequences is designed. Based on the inequality technique and stability theory of differential equations, a sufficient condition for achieving average consensus is obtained under the assumption that switching signal is ergodic and the total period over which connected topologies is sufficiently large. A numerical simulation is presented to show the effectiveness of the theoretical results.

scholarly journals Event-TriggeredH∞Filtering for Multiagent Systems with Markovian Switching Topologies

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Jiahao Li ◽  
Tingting Zhang ◽  
Jinfeng Gao ◽  
Ping Wu
Keyword(s):  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Markovian Switching ◽  
Linear Matrix ◽  
Switching Topologies ◽  
Communication Links ◽  
Inequality Technique ◽  
Error System ◽  
Linear Matrix Inequality Technique ◽  
Event Triggered

This paper is concerned with the problem of event-triggeredH∞filtering for multiagent systems with Markovian switching topologies and network-induced delay. An event-triggered mechanism is given to ease the information transmission. Consider that the network topology is directed in this paper, which represents the communication links among agents. Due to the existence of network-induced delay, the time-delay approach is adopted, which can effectively deal with filtering error system. By constructing a Lyapunov-Krasovskii functional and employing linear matrix inequality technique, sufficient conditions are established to ensure the filtering error system to achieve asymptotically stable withH∞performance index. A simulation example is given to illustrate the effectiveness of the proposed method.

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 Robust Leaderless Consensus of Uncertain Multiagent Systems with Fast Switching Topologies

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Wei Liu ◽  
Shaolei Zhou ◽  
Shi Yan ◽  
Gaoyang Yin
Keyword(s):  
Multiagent Systems ◽  
Special Property ◽  
Laplacian Matrix ◽  
Graph Laplacian ◽  
Consensus Problem ◽  
Time Intervals ◽  
Fast Switching ◽  
Switching Topologies ◽  
Directed Spanning Tree ◽  
Theoretical Results

This paper investigates the robust leaderless consensus problem of uncertain multiagent systems with directed fast switching topologies. The topologies are assumed to jointly contain a directed spanning tree. Based on a special property of the graph Laplacian matrix, the consensus problem is converted into a stabilization problem by performing a proper variable transformation. Averaging method is employed for analysis. It is proved that if the topologies switch sufficiently fast and the controllers are properly designed, the robust leaderless consensus can still be achieved even when all the possible topologies are unconnected in the switching time intervals. Finally, a numerical simulation is provided to illustrate the effectiveness of the theoretical results.

scholarly journals Average Consensus in Networks of Neutral Dynamical Agents with Fixed and Switching Topologies

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Yingying Wu ◽  
Yuangong Sun
Keyword(s):  
Sufficient Conditions ◽  
Laplacian Matrix ◽  
Switching Topology ◽  
Linear Matrix ◽  
Switching Topologies ◽  
Average Consensus ◽  
Eigenvalues Of The Laplacian ◽  
Fixed Topology ◽  
Necessary And Sufficient ◽  
Theoretical Results

This paper addresses the average consensus problem of neutral multiagent systems in undirected networks with fixed and switching topologies. For the case of fixed topology, necessary and sufficient conditions to average consensus are established by decoupling the neutral multiagent system in terms of the eigenvalues of the Laplacian matrix. For the case of switching topology, sufficient conditions to average consensus are given in terms of linear matrix inequalities to determine the allowable upper bound of the time-varying communication delay. Finally, two examples are worked out to explain the effectiveness of the theoretical results.

scholarly journals Consensus of Fractional-Order Multiagent Systems with Double Integrator under Switching Topologies

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Shiyun Shen ◽  
Wenjing Li ◽  
Wei Zhu
Keyword(s):  
Numerical Simulation ◽  
Laplace Transform ◽  
Theoretical Result ◽  
Multiagent Systems ◽  
Fractional Order ◽  
Dwell Time ◽  
Sufficient Condition ◽  
Switching Topologies ◽  
Double Integrator

Due to the complexity of the practical environments, many systems can only be described with the fractional-order dynamics. In this paper, the consensus of fractional-order multiagent systems with double integrator under switching topologies is investigated. By applying Mittag-Leffler function, Laplace transform, and dwell time technique, a sufficient condition on consensus is obtained. Finally, a numerical simulation is presented to illustrate the effectiveness of the theoretical result.

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 Event-Triggered Average Consensus for Multiagent Systems with Time-Varying Delay

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Zhaoxia Wang ◽  
Minrui Fei ◽  
Dajun Du ◽  
Lili Shang
Keyword(s):  
Multiagent Systems ◽  
Undirected Graph ◽  
Sufficient Conditions ◽  
Time Varying ◽  
Time Varying Delay ◽  
Systems Model ◽  
Average Consensus ◽  
Network Load ◽  
Varying Delay ◽  
Event Triggered

The paper investigates average consensus for multiagent systems with time-varying delay. A reducing dimension multiagent systems model is presented firstly. Using event-triggered mechanism to reduce network load, a comprehensive model is then proposed, which considers communication delay and triggered issue. Furthermore, the event-triggered average consensus stability of multiagent systems with fixed directed/undirected graph is analyzed, and sufficient conditions are provided. Moreover, the upper bound of time-varying delay can be obtained conveniently. Finally, simulation results confirm the feasibility and effectiveness of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document