Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Coding scheme based on boundary function for consensus control of multi-agent system with time-varying topology

Coding scheme based on boundary function for consensus control of multi-agent system with time-varying topology

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 relationship between control and communication is becoming more and more important in multi-agent system. Besides consensus protocol, the coding scheme is also a part of the system design. In this study, the boundary function method is proposed for the coding scheme design to solve quantised consensus problem of multi-agent system under channels with time-varying connected topology. Two cases of channels with time-varying topology are considered: (i) channels connecting agents (controllers) and actuators and (ii) channels connecting neighbouring agents. To obtain convergence conditions for consensus problems, a relation between incidence matrices of any two connected graphs is used for the first case and an expression of the boundary function is developed for the second case. Since the quantiser is parameterised by the boundary function and the channel data rate, constraint expressions that include the channel data rate and the system convergence rate are obtained to show the tradeoff between control and communication performances.

Inspec keywords: actuators; multi-agent systems; time-varying systems; graph theory

Other keywords: multiagent system; time-varying topology; channel data rate; boundary function method; incidence matrices; consensus protocol; coding scheme design; consensus problems; actuators; consensus control; quantiser; constraint expressions; time-varying connected topology; channels connecting neighbouring agents; system convergence rate

Subjects: Artificial intelligence (theory); Combinatorial mathematics; Time-varying control systems

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
      • Tsitsiklis, J.: `Problems in decentralized decision making and computation', 1984, PhD, MIT, Department of EECs.
    7. 7)
    8. 8)
      • R. Olfati-Saber , J.A. Fax , R.M. Murray . Consensus and cooperation in networked multi-agent systems. Proc. IEEE , 215 - 233
    9. 9)
      • Fagnani, F., Zampieri, S.: `Average consensus with packet drop communication', Proc. 45th IEEE Conf. on Decision Control, December 2006, San Diego, CA, p. 1007–1012.
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
      • Aysal, T.C., Coates, M.J., Rabbat, M.G.: `Rates of convergence of distributed average consensus using probabilistic quantization', Proc. 45th Allerton Conf. on Communication, Contribution, Computation Allerton, September 2007, IL, p. 26–28.
    15. 15)
      • Ren, W., Beard, R.W., Atkins, E.M.: `A survey of consensus problems in multi-agent coordination', Proc. American Control Conf., June 2005, Portland, OR, p. 1859–1864.
    16. 16)
    17. 17)
    18. 18)
    19. 19)
    20. 20)
      • Ruan, Y., Mostofi, Y.: `Binary consensus with soft information processing in cooperative networks', Proc. 47th IEEE Conf. on Decision Contribution, 2008, p. 3613–3619.
    21. 21)
      • Kingston, D.B., Beard, R.W.: `Discrete-time average-consensus under switching network topologies', Proc. American Control Conf., June 2006, Minneapolis, MN, p. 3551–3556.
    22. 22)
      • Kar, S., Moura, J.M.F.: `Distributed average consensus in sensor networks with quantized inter-sensor communication', IEEE Int. Conf. on Acoustic, Speech, Signal Processing (ICASSP), 2008, LasVegas, NV, p. 2281–2284.
    23. 23)
    24. 24)
    25. 25)
    26. 26)
    27. 27)
    28. 28)
      • Gaid M.M. Ben , A. Cela . Trading quantization precision for update rates for systems with limited communication in the uplink channel. Automatica , 6 , 1210 - 1214
    29. 29)
    30. 30)
      • Nedic, A., Olshevsky, A., Ozdaglar, A., Tsitsiklis, J.: `On distributed averaging algorithms and quantization effects', Tech. Rep. 2778, 2007.
    31. 31)
    32. 32)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cta.2011.0482
Loading

Related content

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