http://iet.metastore.ingenta.com
1887

Dynamic consensus of linear multi-agent systems

Dynamic consensus of linear multi-agent systems

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
Other:
 
IET Control Theory & Applications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

This study concerns the consensus of a network of agents with general linear or linearised dynamics, whose communication topology contains a directed spanning tree. An observer-type consensus protocol based on the relative outputs of the neighbouring agents is adopted. The notion of consensus region is introduced, as a measure for the robustness of the protocol and as a basis for the protocol design. For neutrally stable agents, it is shown that there exists a protocol achieving consensus together with a consensus region that is the entire open right-half plane if and only if each agent is stabilisable and detectable. An algorithm is further presented for constructing such a protocol. For consensus with a prescribed convergence speed, a multi-step protocol design procedure is given, which yields an unbounded consensus region and at the same time maintains a favourable decoupling property. Finally, the consensus algorithms are extended to solve the formation control problems.

References

    1. 1)
      • 1 onward link is available for this reference.
      • CrossRef
    2. 2)
      • 1 onward link is available for this reference.
      • CrossRef
    3. 3)
      • 1 onward link is available for this reference.
      • CrossRef
    4. 4)
      • 1 onward link is available for this reference.
      • CrossRef
    5. 5)
      • 1 onward link is available for this reference.
      • CrossRef
    6. 6)
      • 1 onward link is available for this reference.
      • CrossRef
    7. 7)
      • 1 onward link is available for this reference.
      • CrossRef
    8. 8)
      • 1 onward link is available for this reference.
      • CrossRef
    9. 9)
      • 1 onward link is available for this reference.
      • CrossRef
    10. 10)
      • 1 onward link is available for this reference.
      • CrossRef
    11. 11)
      • 1 onward link is available for this reference.
      • CrossRef
    12. 12)
      • 1 onward link is available for this reference.
      • CrossRef
    13. 13)
      • 1 onward link is available for this reference.
      • CrossRef
    14. 14)
      • 1 onward link is available for this reference.
      • CrossRef
    15. 15)
      • 1 onward link is available for this reference.
      • CrossRef
    16. 16)
      • 1 onward link is available for this reference.
      • CrossRef
    17. 17)
      • 1 onward link is available for this reference.
      • CrossRef
    18. 18)
      • 1 onward link is available for this reference.
      • CrossRef
    19. 19)
      • 1 onward link is available for this reference.
      • CrossRef
    20. 20)
      • 1 onward link is available for this reference.
      • CrossRef
    21. 21)
      • 1 onward link is available for this reference.
      • CrossRef
    22. 22)
      • 1 onward link is available for this reference.
      • CrossRef
    23. 23)
      • 1 onward link is available for this reference.
      • CrossRef
    24. 24)
      • 1 onward link is available for this reference.
      • CrossRef
    25. 25)
      • 1 onward link is available for this reference.
      • CrossRef
    26. 26)
      • 1 onward link is available for this reference.
      • CrossRef
    27. 27)
      • 1 onward link is available for this reference.
      • CrossRef
    28. 28)
      • 1 onward link is available for this reference.
      • CrossRef
    29. 29)
      • C.Q. Ma , J.F. Zhang . On formability of linear continous-time multi-agent systems.
    30. 30)
      • 1 onward link is available for this reference.
      • CrossRef
    31. 31)
      • Ren, W.: `Consensus based formation control strategies for multi-vehicle systems', Proc. Am. Control Conf., June 2006, Minneapolis, MN, USA, p. 4237–4242.
    32. 32)
      • K. Ogata . (1997) Modern control engineering.
    33. 33)
      • R. Horn , C. Johnson . (1985) Matrix analysis.
    34. 34)
      • S. Boyd , L. El Ghaoui , E. Feron , V. Balakrishnan . (1994) Linear matrix inequalities in systems and control theory.
    35. 35)
      • 1 onward link is available for this reference.
      • CrossRef
    36. 36)
      • 1 onward link is available for this reference.
      • CrossRef

Related content

content/journals/10.1049/iet-cta.2009.0466
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address