Finite-Time Consensus Problems for Networks of Dynamic Agents

Details Finite-Time Consensus Problems for Networks of Dynamic Agents Finite-Time Consensus Problems for Networks of Dynamic Agents

2007-01-25

arxiv.org/abs/math/0701724v1

Mathematics

Dynamical Systems

Scientific paper

In this paper, finite-time state consensus problems for continuous-time multi-agent systems are discussed, and two distributive protocols, which ensure that the states of agents reach an agreement in a finite time, are presented. By employing the method of finite-time Lyapunov functions, we derive conditions that guarantee the two protocols to solve the finite-time consensus problems respectively. Moreover, one of the two protocols solves the finite-time weighted-average consensus problem and can be successively applied to the systems with switching topology. Upper bounds of convergence times are also established. Simulations are presented to show the effectiveness of our results.

Affiliated with

Also associated with

No associations

Rating

Finite-Time Consensus Problems for Networks of Dynamic Agents 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 Problems for Networks of Dynamic Agents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite-Time Consensus Problems for Networks of Dynamic Agents will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329118