Consensus of multi‐agent systems with nonlinear dynamics and sampled‐data information: a delayed‐input approach

  title={Consensus of multi‐agent systems with nonlinear dynamics and sampled‐data information: a delayed‐input approach},
  author={Guanghui Wen and Zhisheng Duan and Wenwu Yu and Guanrong Chen},
  journal={International Journal of Robust and Nonlinear Control},
This paper is concerned with the problem of consensus in directed networks of multiple agents with intrinsic nonlinear dynamics and sampled‐data information. A new protocol is induced from a class of continuous‐time linear consensus protocols by implementing data‐sampling technique and a zero‐order hold circuit. On the basis of a delayed‐input approach, the sampled‐data multi‐agent system is converted to an equivalent nonlinear system with a time‐varying delay. Theoretical analysis on this time… 
Sampled‐data leader‐following consensus of second‐order nonlinear multiagent systems without velocity measurements
In this paper, the practical leader‐following consensus via the sampled‐data protocol is investigated for second‐order nonlinear multiagent systems with external disturbances, where the velocity
Distributed consensus of multi‐agent systems with general linear node dynamics and intermittent communications
It is theoretically shown that the consensus in multi-agent systems with a periodic intermittent communication and directed topology containing a spanning tree can be cast into the stability of a set of low-dimensional switching systems.
Sampled-data leader-following consensus for nonlinear multi-agent systems with Markovian switching topologies and communication delay
Consensus for nonlinear multi-agent systems with sampled data
This paper deals with the consensus problems of multi-agent systems with nonlinear dynamics and sampled data information. The control input of each agent is based on the information of its neighbors
Further results on finite‐time consensus of second‐order multi‐agent systems without velocity measurements
This paper investigates the problem of finite-time consensus (FTC) for second-order nonlinear multi-agent systems when the velocity information is unavailable and a class of novel finite- time consensus protocols are proposed for the multi- agent systems.
Coordination tracking of multi‐agent dynamical systems with general linear node dynamics
It is proven that containment tracking in the closed-loop multi-leader multi-agent systems will be guaranteed if the coupling strength between neighboring agents and the gain matrices of the information communication protocols are suitably chosen.
Distributed node‐to‐node consensus of multi‐agent systems with stochastic sampling
By employing the input-delay method and discontinuous Lyapunov functional approach, this paper arrives at some sufficient conditions under which the state of each follower can track that of the corresponding leader asymptotically in the mean square sense.
Consensus and its ℒ2-gain performance of multi-agent systems with intermittent information transmissions
By combining tools from switching systems and Lyapunov stability theory, some sufficient conditions are established for consensus of multi-agent systems without any external disturbances under a fixed strongly connected topology.
Node-to-node consensus tracking of multi-agent systems with sampled-data communication
This paper addresses the distributed node-to-node consensus problem of multi-agent systems with nonlinear dynamics and sampled-data communication with a combined tool from Lyapunov stability theory and input-delay approach.


Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
The main contribution of this paper is to provide a valid distributed consensus algorithm that overcomes the difficulties caused by unreliable communication channels, such as intermittent information transmission, switching communication topology, and time-varying communication delays, and therefore has its obvious practical applications.
Consensus of multi-agent systems based on sampled-data control
This article proposes a protocol based on sampled-data control and derives an equivalent characterisation of the solvability of the consensus problem under this protocol, and considers two cases: fixed topology and switching topology.
Consensus of multi‐agent linear dynamic systems
The main result is that if the adjacent topology of the graph is frequently connected then the consensus is achievable via local-information-based decentralized controls, provided that the linear dynamic mode is completely controllable.
Necessary and sufficient conditions for solving consensus problems of double‐integrator dynamics via sampled control
The sampled control protocol is induced from continuous-time linear consensus protocol by using periodic sampling technology and zero-order hold circuit and is equivalently transformed into a linear discrete-time system.
Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics
To describe the system's ability for reaching consensus, a new concept about the generalized algebraic connectivity is defined for strongly connected networks and then extended to the strongly connected components of the directed network containing a spanning tree.
Sampled-Data Based Average Consensus Control for Networks of Continuous-Time Integrator Agents With Measurement Noises
An uncertainty principle of Gaussian networks tells us that in the case of white Gaussian noises, no matter what the sampling size is, the product of the static and transient performance indexes is always equal to or larger than a constant depending on the noise intensity, network topology and the number of network nodes.
Consensus in networked multi-agent systems via sampled control: Fixed topology case
The sampled control protocols are induced from continuous-time linear consensus protocol by using periodic sampling technology and zero-order hold circuit and an algebraic-type necessary and sufficient condition is obtained under which consensus is achieved.
Consensus and Cooperation in Networked Multi-Agent Systems
This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in
Consensus problems in networks of agents with switching topology and time-delays
A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
On consensus in multi-agent systems with linear high-order agents
Abstract Consensus of a group of agents in a multi-agent system is considered. All agents are modeled by identical linear n th order dynamical systems and the interconnection topology between the