22,314 research outputs found
A Survey on Multisensor Fusion and Consensus Filtering for Sensor Networks
Multisensor fusion and consensus filtering are two fascinating subjects in the research of sensor networks. In this survey, we will cover both classic results and recent advances developed in these two topics. First, we recall some important results in the development ofmultisensor fusion technology. Particularly, we pay great attention to the fusion with unknown correlations, which ubiquitously exist in most of distributed filtering problems. Next, we give a systematic review on several widely used consensus filtering approaches. Furthermore, some latest progress on multisensor fusion and consensus filtering is also presented. Finally,
conclusions are drawn and several potential future research directions are outlined.the Royal Society of the UK, the National Natural Science Foundation of China under Grants 61329301, 61374039, 61304010, 11301118, and 61573246, the Hujiang Foundation of China under Grants C14002
and D15009, the Alexander von Humboldt Foundation of Germany, and the Innovation Fund Project for Graduate Student of Shanghai under Grant JWCXSL140
Cooperative localization for mobile agents: a recursive decentralized algorithm based on Kalman filter decoupling
We consider cooperative localization technique for mobile agents with
communication and computation capabilities. We start by provide and overview of
different decentralization strategies in the literature, with special focus on
how these algorithms maintain an account of intrinsic correlations between
state estimate of team members. Then, we present a novel decentralized
cooperative localization algorithm that is a decentralized implementation of a
centralized Extended Kalman Filter for cooperative localization. In this
algorithm, instead of propagating cross-covariance terms, each agent propagates
new intermediate local variables that can be used in an update stage to create
the required propagated cross-covariance terms. Whenever there is a relative
measurement in the network, the algorithm declares the agent making this
measurement as the interim master. By acquiring information from the interim
landmark, the agent the relative measurement is taken from, the interim master
can calculate and broadcast a set of intermediate variables which each robot
can then use to update its estimates to match that of a centralized Extended
Kalman Filter for cooperative localization. Once an update is done, no further
communication is needed until the next relative measurement
Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications
Wireless sensor networks monitor dynamic environments that change rapidly
over time. This dynamic behavior is either caused by external factors or
initiated by the system designers themselves. To adapt to such conditions,
sensor networks often adopt machine learning techniques to eliminate the need
for unnecessary redesign. Machine learning also inspires many practical
solutions that maximize resource utilization and prolong the lifespan of the
network. In this paper, we present an extensive literature review over the
period 2002-2013 of machine learning methods that were used to address common
issues in wireless sensor networks (WSNs). The advantages and disadvantages of
each proposed algorithm are evaluated against the corresponding problem. We
also provide a comparative guide to aid WSN designers in developing suitable
machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial
Robust Distributed Fusion with Labeled Random Finite Sets
This paper considers the problem of the distributed fusion of multi-object
posteriors in the labeled random finite set filtering framework, using
Generalized Covariance Intersection (GCI) method. Our analysis shows that GCI
fusion with labeled multi-object densities strongly relies on label
consistencies between local multi-object posteriors at different sensor nodes,
and hence suffers from a severe performance degradation when perfect label
consistencies are violated. Moreover, we mathematically analyze this phenomenon
from the perspective of Principle of Minimum Discrimination Information and the
so called yes-object probability. Inspired by the analysis, we propose a novel
and general solution for the distributed fusion with labeled multi-object
densities that is robust to label inconsistencies between sensors.
Specifically, the labeled multi-object posteriors are firstly marginalized to
their unlabeled posteriors which are then fused using GCI method. We also
introduce a principled method to construct the labeled fused density and
produce tracks formally. Based on the developed theoretical framework, we
present tractable algorithms for the family of generalized labeled
multi-Bernoulli (GLMB) filters including -GLMB, marginalized
-GLMB and labeled multi-Bernoulli filters. The robustness and
efficiency of the proposed distributed fusion algorithm are demonstrated in
challenging tracking scenarios via numerical experiments.Comment: 17pages, 23 figure
- …