Average Consensus of Sensor Networks with Uncertain Markov Topologies

Article Preview

Abstract:

Average consensus is studied in mean square sense of distributed inference in a sensor network under Markov communication topology of uncertain transition probability. A sufficient condition is presented for average consensus. Based on linear matrix inequalities and numerical optimization, a design method is provided of faster distributed inference systems.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

746-749

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] R.O. Saber and R.M. Murray, Consensus problem in networks of agents with switching topology and time-delays, IEEE Trans. Automatic Control, vol. 49, no. 9, 2004, pp.1520-1533.

DOI: 10.1109/tac.2004.834113

Google Scholar

[2] W. Ren and R.W. Beard, Consensus seeking in multi-agent systems under dynamically changing interaction topologies, IEEE Trans. Automatic Control, 2005, pp.655-661.

DOI: 10.1109/tac.2005.846556

Google Scholar

[3] L. Xiao, S. Boyd, and S. Lall, A scheme for robust distributed sensor fusion based on average consensus, " in IPSN , 05: Proceedings of the 4th international symposium on Information processing in sensor networks, IEEE Press, (2005).

DOI: 10.1109/ipsn.2005.1440896

Google Scholar

[4] L. Zhang, E.K. Bokus, control for discrete-time Markovian jump linear systems with partly unknown transition probabilities, Robust nonlinear control, vol. 19, 2009, pp.868-883.

DOI: 10.1002/rnc.1355

Google Scholar

[5] J. Nocedal, S. J. Wright, Numerical optimization, New York: springer, (1999).

Google Scholar

[6] S. Boyd, L. El Ghaoui, E. Feron and V. Balakrishan, Linear Matrix Inequalities in Systems and Control Theory, Philadelphia, PA: SIAM, (1994).

DOI: 10.1137/1.9781611970777

Google Scholar