Approximate distributed Kalman filtering in sensor networks with quantifiable performance
暂无分享,去创建一个
[1] Wendi B. Heinzelman,et al. Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.
[2] R. Merris. Laplacian matrices of graphs: a survey , 1994 .
[3] Satish Kumar,et al. Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.
[4] Alireza Tahbaz-Salehi,et al. On consensus over random networks , 2006 .
[5] Ian F. Akyildiz,et al. Sensor Networks , 2002, Encyclopedia of GIS.
[6] Stephen P. Boyd,et al. A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..
[7] Richard M. Murray,et al. DYNAMIC CONSENSUS FOR MOBILE NETWORKS , 2005 .
[8] Stephen P. Boyd,et al. Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).
[9] Feng Zhao,et al. Information-driven dynamic sensor collaboration , 2002, IEEE Signal Process. Mag..
[10] R. Olfati-Saber. Ultrafast consensus in small-world networks , 2005, Proceedings of the 2005, American Control Conference, 2005..
[11] Jie Lin,et al. Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..
[12] Richard M. Murray,et al. DISTRIBUTED SENSOR FUSION USING DYNAMIC CONSENSUS , 2005 .
[13] Richard M. Murray,et al. Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.
[14] H. F. Durrant-Whyte,et al. Fully decentralised algorithm for multisensor Kalman filtering , 1991 .