7,996 research outputs found
Bibliographic Review on Distributed Kalman Filtering
In recent years, a compelling need has arisen to understand the effects of distributed information structures on estimation and filtering. In this paper, a bibliographical review on distributed Kalman filtering (DKF) is provided.\ud
The paper contains a classification of different approaches and methods involved to DKF. The applications of DKF are also discussed and explained separately. A comparison of different approaches is briefly carried out. Focuses on the contemporary research are also addressed with emphasis on the practical applications of the techniques. An exhaustive list of publications, linked directly or indirectly to DKF in the open literature, is compiled to provide an overall picture of different developing aspects of this area
Recurrent Neural Networks For Accurate RSSI Indoor Localization
This paper proposes recurrent neuron networks (RNNs) for a fingerprinting
indoor localization using WiFi. Instead of locating user's position one at a
time as in the cases of conventional algorithms, our RNN solution aims at
trajectory positioning and takes into account the relation among the received
signal strength indicator (RSSI) measurements in a trajectory. Furthermore, a
weighted average filter is proposed for both input RSSI data and sequential
output locations to enhance the accuracy among the temporal fluctuations of
RSSI. The results using different types of RNN including vanilla RNN, long
short-term memory (LSTM), gated recurrent unit (GRU) and bidirectional LSTM
(BiLSTM) are presented. On-site experiments demonstrate that the proposed
structure achieves an average localization error of m with of the
errors under m, which outperforms the conventional KNN algorithms and
probabilistic algorithms by approximately under the same test
environment.Comment: Received signal strength indicator (RSSI), WiFi indoor localization,
recurrent neuron network (RNN), long shortterm memory (LSTM),
fingerprint-based localizatio
Computation-Communication Trade-offs and Sensor Selection in Real-time Estimation for Processing Networks
Recent advances in electronics are enabling substantial processing to be
performed at each node (robots, sensors) of a networked system. Local
processing enables data compression and may mitigate measurement noise, but it
is still slower compared to a central computer (it entails a larger
computational delay). However, while nodes can process the data in parallel,
the centralized computational is sequential in nature. On the other hand, if a
node sends raw data to a central computer for processing, it incurs
communication delay. This leads to a fundamental communication-computation
trade-off, where each node has to decide on the optimal amount of preprocessing
in order to maximize the network performance. We consider a network in charge
of estimating the state of a dynamical system and provide three contributions.
First, we provide a rigorous problem formulation for optimal real-time
estimation in processing networks in the presence of delays. Second, we show
that, in the case of a homogeneous network (where all sensors have the same
computation) that monitors a continuous-time scalar linear system, the optimal
amount of local preprocessing maximizing the network estimation performance can
be computed analytically. Third, we consider the realistic case of a
heterogeneous network monitoring a discrete-time multi-variate linear system
and provide algorithms to decide on suitable preprocessing at each node, and to
select a sensor subset when computational constraints make using all sensors
suboptimal. Numerical simulations show that selecting the sensors is crucial.
Moreover, we show that if the nodes apply the preprocessing policy suggested by
our algorithms, they can largely improve the network estimation performance.Comment: 15 pages, 16 figures. Accepted journal versio
Enchanced interference cancellation and telemetry reception in multipath environments with a single paraboic dish antenna using a focal plane array
An Advanced Focal Plane Array ("AFPA") for parabolic dish antennas that exploits spatial diversity to achieve better channel equalization performance in the presence of multipath (better than temporal equalization alone), and which is capable of receiving from two or more sources within a field-of-view in the presence of multipath. The AFPA uses a focal plane array of receiving elements plus a spatio-temporal filter that keeps information on the adaptive FIR filter weights, relative amplitudes and phases of the incoming signals, and which employs an Interference Cancelling Constant Modulus Algorithm (IC-CMA) that resolves multiple telemetry streams simultaneously from the respective aero-nautical platforms. This data is sent to an angle estimator to calculate the target's angular position, and then on to Kalman filters FOR smoothing and time series prediction. The resulting velocity and acceleration estimates from the time series data are sent to an antenna control unit (ACU) to be used for pointing control
- …