This paper studies the distributed estimation problem for a moving discrete-time target under switching topologies and stochastic noises. For this problem, we propose a recursive distributed estimation algorithm based...
详细信息
ISBN:
(纸本)9781467318723;9781467318716
This paper studies the distributed estimation problem for a moving discrete-time target under switching topologies and stochastic noises. For this problem, we propose a recursive distributed estimation algorithm based on state-consensus strategy. Under well-known observability and connectivity assumptions, an upper bound and lower bound for the total mean square estimation error (TMSEE) are established, respectively, by using common Lyapunov method and Kalman filtering theory.
We consider the problem of distributed estimation of a deterministic vector parameters using in clustered wireless sensor networks (WSNs). The paper using the method of multipliers in conjunction with a block coordina...
详细信息
ISBN:
(纸本)9783037850411
We consider the problem of distributed estimation of a deterministic vector parameters using in clustered wireless sensor networks (WSNs). The paper using the method of multipliers in conjunction with a block coordinate descent approach, we demonstrate how the resultant algorithm can be decomposed into a set of simpler tasks suitable for distributed implementation based on maximum likelihood estimators (MLE) in nonlinear and non-Gaussian data models, the iterative algorithms based on the communication between nodes and the head node that generate a local estimation, and the head nodes can be seen as the neighbor node of all the other nodes in the cluster, it can broadcast its estimation in the cluster, and the local iterates converge to the global MLE, We prove that these algorithms have guaranteed convergence to the desired estimator when the sensor links are assumed ideal. Furthermore, corroborating simulations demonstrate the merits of the novel distributed estimation algorithms.
This paper studies the continuous-time distributed estimation problem for time-varying target under switching topologies and stochastic noises. There are three main features in this problem: only a portion of sensors ...
详细信息
ISBN:
(纸本)9781467313988
This paper studies the continuous-time distributed estimation problem for time-varying target under switching topologies and stochastic noises. There are three main features in this problem: only a portion of sensors have a access to the target;three kinds of stochastic noises arising in dynamic process, measurement and communication are considered;and the topological structure between sensors and target is switching. For this problem we propose a continuous-time distributed estimation algorithm. Under observability and connectivity, one upper and lower bound for the total mean square estimation error is established by using common Lyapunov method and Kalman-Bucy filtering theory, respectively. The numerical simulation also verifies the effictiveness of the proposed algorithm.
We consider distributed estimation for a geographically dispersed sensor network, where sensors collect observations that are linearly pre-processed and transmitted over dimensionality-constrained channels. A central ...
详细信息
ISBN:
(纸本)9781424422463
We consider distributed estimation for a geographically dispersed sensor network, where sensors collect observations that are linearly pre-processed and transmitted over dimensionality-constrained channels. A central processor utilizes the received sensor data to obtain a linear estimate of the desired signal. In this scenario, we consider the optimal preprocessing at the sensors under a mean squared error (MSE) metric. In the single-sensor case, applying a modification of Sakrison's separation principle we show that the optimal preprocessing can be decomposed into two steps: a LMMSE estimate followed by a (linear) MSE optimal dimensionality reduction of the estimate. The latter is readily obtained as the well-known Karhunen-Loeve transform (KLT). Under the multi-sensor scenario, we extend this result to show that given the pre-processing at other nodes, each node's optimal linear pre-processing again reduces to a side-informed linear estimation followed by a side-informed version of the KLT. The separation perspective thus provides a simple and intuitive derivation of the optimal linear pre-processing under reduced dimensionality channels.
In this paper, we propose a distributed localization algorithm for the networked multi-agent system on the sphere domain. Each agent only measures the relative position of neighbors with respect to its own local refer...
详细信息
ISBN:
(纸本)9781538636640
In this paper, we propose a distributed localization algorithm for the networked multi-agent system on the sphere domain. Each agent only measures the relative position of neighbors with respect to its own local reference frame. The proposed algorithm exploits kinematic relationships between relative position and relative orientation;relative orientation of neighboring agents is calculated by the relative positions. We show that the relative orientation is sufficient to estimate both orientation and position for the networked system on the sphere. The result implies that localization problem of networked system can be solved by using only relative position measurement in the case of misaligned local frames.
The diffusion cooperative scheme is conventionally used in wireless sensor networks for distributed parameter estimation. Each sensor node has the local computing ability and share information with the predefined one ...
详细信息
ISBN:
(纸本)9781467369817
The diffusion cooperative scheme is conventionally used in wireless sensor networks for distributed parameter estimation. Each sensor node has the local computing ability and share information with the predefined one hop neighbors for local diffusion. The performance of the diffusion method depends on the degree of the sensor nodes and which is less for a sparse sensor network, especially for the sensor nodes lying on the edge of the network. Therefore, multi-hop diffusion cooperation is proposed here to improve the estimation accuracy and convergent speed. Here, a sensor node receives information from multi-hop (used two-hop) sensor nodes unlike aggregating from immediate neighbors in the conventional diffusion algorithm. The simulation results show the performance improvement of the proposed scheme over the existing diffusion method.
A technique is presented for combining arbitrary empirical probability density estimates whose interdependencies are unspecified. The underlying estimates may be, for example, the particle approximations of a pair of ...
详细信息
ISBN:
(纸本)9780996452762
A technique is presented for combining arbitrary empirical probability density estimates whose interdependencies are unspecified. The underlying estimates may be, for example, the particle approximations of a pair of particle filters. In this respect, our approach, named hereafter particles intersection, provides a way to obtain a new particle approximation, which is better in a precise information-theoretic sense than that of any of the particle filters alone. Particles intersection is applicable in networks with potentially many particle filters. We demonstrate both theoretically and through numerical simulations that depending on the communication topology this technique leads to consensus in the underlying network where all particle filters agree on their estimates. The viability of the proposed approach is demonstrated through examples in which it is applied for multiple object tracking and distributed estimation in networks.
This paper addresses the problem of multi-agent distributed state estimation in switching networks over directed graphs. Specifically, we consider a novel estimation setting fora linear continuous-time system that is ...
详细信息
This paper addresses the problem of multi-agent distributed state estimation in switching networks over directed graphs. Specifically, we consider a novel estimation setting fora linear continuous-time system that is broken down into subsystems, each of which is locally estimated by the corresponding agent. This task is undertaken despite the complexities due to interdependencies on both cyber and physical levels, and due to the fact that the system is switching, i.e., the different subsystems/agents can activate (e.g., to accomplish some specific task) or deactivate (e.g., due to a fault) during a transient that ends with a cutoff time, unknown to the agents, after which the topology becomes fixed. In particular, by exploiting the negativizability property - the pair ( A, C) is negativizable if there is a feedback gain K such that A- KC is negative definite - each agent is able to locally perform the calculation of its own estimation gain matrix. The paper is complemented by the convergence analysis of the estimation error executed by leveraging on nonsmooth analysis and simulations to prove the effectiveness of the proposed results.
The contribution deals with sequential distributed estimation of global parameters of normal mixture models, namely mixing probabilities and component means and covariances. The network of cooperating agents is repres...
详细信息
ISBN:
(纸本)9783319162386;9783319162379
The contribution deals with sequential distributed estimation of global parameters of normal mixture models, namely mixing probabilities and component means and covariances. The network of cooperating agents is represented by a directed or undirected graph, consisting of vertices taking observations, incorporating them into own statistical knowledge about the inferred parameters and sharing the observations and the posterior knowledge with other vertices. The aim to propose a computationally cheap online estimation algorithm naturally disqualifies the popular (sequential) Monte Carlo methods for the associated high computational burden, as well as the expectation-maximization (EM) algorithms for their difficulties with online settings requiring data batching or stochastic approximations. Instead, we proceed with the quasi-Bayesian approach, allowing sequential analytical incorporation of the (shared) observations into the normal inverse-Wishart conjugate priors. The posterior distributions are subsequently merged using the Kullback-Leibler optimal procedure.
For large-scale mobile communication networks, their graph eigenspectra directly affect the performance of congestion control, flow control, quality of service and so on. At present, a distributed estimation is consid...
详细信息
ISBN:
(数字)9781728198156
ISBN:
(纸本)9781728198156
For large-scale mobile communication networks, their graph eigenspectra directly affect the performance of congestion control, flow control, quality of service and so on. At present, a distributed estimation is considered to be the most suitable way for signal processing as for infrastructure-free networks. However, due to the structural dynamics of mobile communication networks, it is hard for the nodes to perceive the current state parameters of an entire network, especially at the stage of nonsteady-state of network dynamic systems. This paper accordingly proposes a distributed method to estimate the graph eigenspectra of mobile communication networks on the basis of the singular value decomposition theory. Second, authors establish a Kalman Filtering model for real-time tracking the estimation of graph eigenspectra. Finally, through the theoretical analysis and numerical simulations, it is shown that our proposed estimation method can satisfy the accuracy requirements for the network reconstruction.
暂无评论