Pseudo Two-Hop Distributed Consensus Algorithm with Link Failure

Article Preview

Abstract:

For time-delay, noise and network congestion in the communication among agents, there are often random communication link failures among agents. In this paper, we analyze the pseudo two-hop distributed consensus algorithm with link failures, and research the relation between convergence performance and the probability of link failures. Supposing that the probability of link failures in every link is independent identically distributed, we analyze the convergence performance of the pseudo two-hop distributed consensus algorithm with link failures, and simulation results are provided to verify these analytical results.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 591-593)

Pages:

1575-1578

Citation:

Online since:

November 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R. Olfati-Saber, R. M. Murray: IEEE Trans. Automat. Contr., Vol. 49(2004)No. 9, p.1520.

Google Scholar

[2] R. Olfati-Saber, J. A. Fax, and R. M. Murray: Proc. IEEE, Vol. 95(2007)No. 1, p.215.

Google Scholar

[3] H.X. Peng, G.Q. Qi and A.D. Sheng: Journal of Control Theory and Application, Vol. 29(2012)No. 5, p.12.

Google Scholar

[4] Y. Hatona, M. Meshahi: IEEE Transaction on Automatic Control, Vol. 50(2005)No. 11, p.1867.

Google Scholar

[5] A. Erodos, A. Rényi. On the evolution of random graphs(Publ. Math. Inst. Hung. Acad. Sci, 1960, 5: 17-61).

Google Scholar

[6] C. W. Wu: IEEE Transactions on Automatic Control, Vol. 51(2006)No. 7, p.1207.

Google Scholar

[7] A. Tahhaz-Salehi, A. Jadbabaie: IEEE Transactions on Automatic Control, Vol. 53(2008)No. 3, p.791.

Google Scholar