Computer Science – Information Theory
Scientific paper
2009-09-17
Computer Science
Information Theory
11 pages, 3 figures
Scientific paper
In this paper, we study finite-time state consensus problems for continuous nonlinear multi-agent systems. Building on the theory of finite-time Lyapunov stability, we propose sufficient criteria which guarantee the system to reach a consensus in finite time, provided that the underlying directed network contains a spanning tree. Novel finite-time consensus protocols are introduced as examples for applying the criteria. Simulations are also presented to illustrate our theoretical results.
No associations
LandOfFree
Finite-time Consensus for Nonlinear Multi-agent Systems with Fixed Topologies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finite-time Consensus for Nonlinear Multi-agent Systems with Fixed Topologies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite-time Consensus for Nonlinear Multi-agent Systems with Fixed Topologies will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-390637