Consensus Algorithm for Swarm Robotics Cooperative Control

Article Preview

Abstract:

A critical problem for swarm robotics cooperative control is to determine appropriate consensus algorithms so that a group of robots can reach consensus on the values of coordination data. In this paper, we defined the Information Interactive Graph ( IIG ) and the Information Interactive Matrix ( IIM ) to represent the information interaction relationship between each robot based on algebra graph theroy. Proofed the necessary and/or sufficient conditions for consensus and presented some consensus algorithms under static topology. Finally, simulation results showed that our algorithm can make a swarm of robots reach a consensus on the shared coordination data.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 201-203)

Pages:

1854-1857

Citation:

Online since:

February 2011

Export:

Price:

[1] M. Dorigo and E. Sahin: Autonomous Robots. Vol. 17 ( 2004), p.111.

Google Scholar

[2] L. Bayindir and E. Sahin: Turkish J. of E. E. and Comp. Sci. Vol. 15 (2007), p.115.

Google Scholar

[3] Hauert, S., Zufferey, J.C. and D. Floreano: Autonomous Robots. Vol. 26 (2009), p.21.

Google Scholar

[4] R. Olfati-Saber and R. M. Murray: IEEE Trans. on Automatic Control. Vol. 49 (2004), p.1520.

Google Scholar

[5] A. Jadbabaie, J. Lin, and A. S. Morse: IEEE Trans. on Automatic Control. Vol. 48 (2003), p.988.

Google Scholar

[6] A. Muhammad and M. Egerstedt: LNCIS. Vol. 309 (2003), p.455.

Google Scholar

[7] J. A. Fax and R. M. Murray: IEEE Transactions on Automatic Control. Vol. 49 (2004), p.1465.

Google Scholar

[8] H. G. Tanner, A. Jadbabaie, and G. J. Pappas: IEEE Trans. on Auto. Ctrl. Vol. 52 (2007), p.863.

Google Scholar

[9] C. Godsil and G. Royle, Algebraic Graph Theory, Springer-Verlag, New York (2001).

Google Scholar

[10] R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge (1985).

Google Scholar