Distributed state estimation for discrete-time sensor networks with randomly varying nonlinearities and missing measurements

J Liang, Z Wang, X Liu - IEEE Transactions on Neural …, 2011 - ieeexplore.ieee.org
This paper deals with the distributed state estimation problem for a class of sensor networks
described by discrete-time stochastic systems with randomly varying nonlinearities and …

Hearing the clusters of a graph: A distributed algorithm

T Sahai, A Speranzon, A Banaszuk - Automatica, 2012 - Elsevier
We propose a novel distributed algorithm to cluster graphs. The algorithm recovers the
solution obtained from spectral clustering without the need for expensive eigenvalue …

Distributed state estimation for uncertain Markov‐type sensor networks with mode‐dependent distributed delays

J Liang, Z Wang, X Liu - International Journal of Robust and …, 2012 - Wiley Online Library
In this paper, the distributed state estimation problem is investigated for a class of sensor
networks described by uncertain discrete‐time dynamical systems with Markovian jumping …

Robust distributed state estimation for sensor networks with multiple stochastic communication delays

J Liang, B Shen, H Dong, J Lam - International Journal of Systems …, 2011 - Taylor & Francis
This article is concerned with the robust distributed state estimation problem for a class of
uncertain sensor networks with multiple stochastic communication delays. A sequence of …

Distributed state estimation in sensor networks with randomly occurring nonlinearities subject to time delays

J Liang, Z Wang, B Shen, X Liu - ACM Transactions on Sensor Networks …, 2012 - dl.acm.org
This article is concerned with a new distributed state estimation problem for a class of
dynamical systems in sensor networks. The target plant is described by a set of differential …

Graph weight allocation to meet Laplacian spectral constraints

SY Shafi, M Arcak, L El Ghaoui - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
We adjust the node and edge weightings of graphs using convex optimization to impose
bounds on their Laplacian spectra. First, we derive necessary and sufficient conditions that …

Synthesis of embedded networks for building automation and control

A Pinto, M D'Angelo, C Fischione… - 2008 American …, 2008 - ieeexplore.ieee.org
We present a methodology and a software framework for the automatic design exploration of
the communication network among sensors, actuators and controllers in building automation …

Convergence of the Markov chain distributed particle filter (MCDPF)

SH Lee, M West - IEEE Transactions on Signal Processing, 2012 - ieeexplore.ieee.org
The Markov Chain Distributed Particle Filter (MCDPF) is an algorithm for the nodes in a
sensor network to cooperatively run a particle filter, based on each sensor making updates …

Wave equation based algorithm for distributed eigenvector computation

T Sahai, A Speranzon… - 49th IEEE Conference on …, 2010 - ieeexplore.ieee.org
We propose a novel distributed algorithm to compute eigenvectors and eigenvalues of the
graph Laplacian matrix L. We prove that, by propagating waves through the graph, a local …

Graph weight design for laplacian eigenvalue constraints with multi-agent systems applications

SY Shafi, M Arcak, L El Ghaoui - 2011 50th IEEE Conference …, 2011 - ieeexplore.ieee.org
We adjust the node and edge weightings of graphs using convex optimization to impose
bounds on their Laplacian spectra. We first derive necessary and sufficient conditions that …