Single agent control for multi-agent dynamical consensus systems

Access Full Text

Single agent control for multi-agent dynamical consensus systems

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

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

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 Title Publication 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:
 
 
 
 
 
IET Control Theory & Applications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

The problem of controlling a single agent in a multi-agent consensus system is studied in order to make states of all agents in the system follow a common reference signal. It is shown that if every two agents in a given system are connected and a reference signal is a step function, then every controller locally stabilising one single agent gives rise to a successful tracking of all agents. When a proportional control is employed, the relations between overall tracking performance, interconnection topology and the choice of a controlled agent are analytically investigated. A numerical study is also performed to substantiate theoretical findings.

Inspec keywords: numerical analysis; multi-agent systems

Other keywords: numerical study; single agent control; tracking performance; common reference signal; interconnection topology; proportional control; step function; multi-agent consensus system

Subjects: Other numerical methods; Artificial intelligence (theory)

References

    1. 1)
    2. 2)
      • Y. Alavi , G. Chartrand , O.R. Oellermann , A.J. Schwenk . (1991) The Laplacian spectrum of graphs.
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
      • D. Cvetković , P. Rowlinson , S. Simić . (1997) Eigenspaces of graphs.
    12. 12)
    13. 13)
      • Ren, W., Beard, R.W., Atkins, E.M.: `A survey of consensus problems in multi-agent coordination', Proc. American Control Conf., 8–10 June 2005, Portland, OR, p. 1859–1864.
    14. 14)
    15. 15)
      • Tsumura, K.: `Signal complexity in cyclic consensus systems', American Control Conf., 30 June–2 July 2010, Baltimore, p. 4468–4473.
    16. 16)
      • Tanner, H.G.: `On the controllability of nearest neighbor interconnections', Proc. 43rd Conf. on Decision Control, December 2004, Atlantis, Bahamas, p. 2467–2472.
    17. 17)
      • Tsumura, K.: `Transfer functions and signal complexity in cyclic consensus systems', SICE 9th Annual Conf. on Control Systems, 3–6 March 2009, Alghero, Italy.
    18. 18)
      • Olfati-Saber, R., Fax, J.A., Murray, R.M.: `Consensus and cooperation in networked multi-agent systems', Proc. IEEE, 2007, p. 215–233.
    19. 19)
    20. 20)
    21. 21)
    22. 22)
    23. 23)
    24. 24)
      • Ji, M., Muhammad, A., Egerstedt, M.: `Leader-based multi-agent coordination: controllability and optimal control', American Control Conf., 14–16 June 2006, Minneapolis.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cta.2011.0236
Loading

Related content

content/journals/10.1049/iet-cta.2011.0236
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading