Distributed Kalman filter with fuzzy noises over multiagent systems under switching topology

2021 ◽  
pp. 103326
Author(s):  
Xiaobo Zhang ◽  
Haoshen Lin ◽  
Gang Liu ◽  
Bingqi Liu
Keyword(s):  
Kalman Filter ◽  
Multiagent Systems ◽  
Switching Topology

Consensus Seeking in Multiagent Systems With Markovian Switching Topology Under Aperiodic Sampled Data

2020 ◽  
Vol 50 (12) ◽  
pp. 5189-5200 ◽  
Author(s):  
Xin Wang ◽  
Hui Wang ◽  
Chuandong Li ◽  
Tingwen Huang ◽  
Jurgen Kurths
Keyword(s):  
Multiagent Systems ◽  
Markovian Switching ◽  
Switching Topology ◽  
Sampled Data

scholarly journals Sampled-Data Consensus for High-Order Multiagent Systems under Fixed and Randomly Switching Topology

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Niu Jie ◽  
Li Zhong
Keyword(s):  
Multiagent Systems ◽  
Linear Time ◽  
Sampling Period ◽  
Switching Topology ◽  
Sampled Data ◽  
System Matrix ◽  
Packet Losses ◽  
Linear Time Invariant ◽  
Switching Topologies ◽  
Necessary And Sufficient

This paper studies the sampled-data based consensus of multiagent system with general linear time-invariant dynamics. It focuses on looking for a maximum allowable sampling period bound such that as long as the sampling period is less than this bound, there always exist linear consensus protocols solving the consensus problem. Both fixed and randomly switching topologies are considered. For systems under fixed topology, a necessary and sufficient sampling period bound is obtained for single-input multiagent systems, and a sufficient allowable bound is proposed for multi-input systems by solving theH∞optimal control problem of certain system with uncertainty. For systems under randomly switching topologies, tree-type and complete broadcasting network with Bernoulli packet losses are discussed, and explicit allowable sampling period bounds are, respectively, given based on the unstable eigenvalues of agent’s system matrix and packet loss probability. Numerical examples are given to illustrate the results.

scholarly journals Distributed Leader-Following Finite-Time Consensus Control for Linear Multiagent Systems under Switching Topology

2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Xiaole Xu ◽  
Shengyong Chen ◽  
Lixin Gao
Keyword(s):  
Multiagent Systems ◽  
Finite Time ◽  
Switching Topology ◽  
Linear Matrix ◽  
Sufficient Condition ◽  
Dynamical Models ◽  
Consensus Protocol ◽  
Consensus Control ◽  
Leader Following ◽  
Discrete Time Case

This paper investigates the finite-time consensus problem of leader-following multiagent systems. The dynamical models for all following agents and the leader are assumed the same general form of linear system, and the interconnection topology among the agents is assumed to be switching and undirected. We mostly consider the continuous-time case. By assuming that the states of neighbouring agents are known to each agent, a sufficient condition is established for finite-time consensus via a neighbor-based state feedback protocol. While the states of neighbouring agents cannot be available and only the outputs of neighbouring agents can be accessed, the distributed observer-based consensus protocol is proposed for each following agent. A sufficient condition is provided in terms of linear matrix inequalities to design the observer-based consensus protocol, which makes the multiagent systems achieve finite-time consensus under switching topologies. Then, we discuss the counterparts for discrete-time case. Finally, we provide an illustrative example to show the effectiveness of the design approach.

Sign in / Sign up

Export Citation Format

Share Document