Cooperative tracking plays a key role in space situation awareness for scenarios with a
limited number of observations or poor performance of a single sensor or both. To use the …

We describe a protocol for the average consensus problem on any fixed undirected graph
whose convergence time scales linearly in the total number nodes n. The protocol relies …

We describe a protocol for the average consensus problem on any fixed undirected graph
whose convergence time scales linearly in the total number nodes $ n $. The protocol is …

Reconfigurable array radiates multiple patterns with only a single array via designing
multiple excitation vectors with common magnitudes for the same element-index excitation …

This article investigates fault-tolerant finite-time consensus (FTC) problems of single/double-
integrator multi-agent systems (MASs) with partial agents subject to asynchronous self …

In this paper, we derive and analyze two algorithms-referred to as decentralized power
method (DPM) and decentralized Lanczos algorithm (DLA)-for distributed computation of …

We describe a protocol for the average consensus problem on any fixed undirected graph
whose convergence time scales linearly in the total number nodes n. More precisely we …

In wireless sensor networks, distributed consensus algorithms can be employed for
distributed detection. Each sensor node can compute its log-likelihood ratio (LLR) from local …

In the distributed sensor net-system with unknown cross-covariance, the design of fusion
coefficients is crucial for the fusion performance. In this paper, a fast covariance intersection …

Averaging consensus algorithms provide an elegant, fully distributed, iterative way to
compute the average of a set of measurements in a wireless sensor network. Unfortunately …