1,524 research outputs found
Cooperative Simultaneous Localization and Synchronization in Mobile Agent Networks
Cooperative localization in agent networks based on interagent time-of-flight
measurements is closely related to synchronization. To leverage this relation,
we propose a Bayesian factor graph framework for cooperative simultaneous
localization and synchronization (CoSLAS). This framework is suited to mobile
agents and time-varying local clock parameters. Building on the CoSLAS factor
graph, we develop a distributed (decentralized) belief propagation algorithm
for CoSLAS in the practically important case of an affine clock model and
asymmetric time stamping. Our algorithm allows for real-time operation and is
suitable for a time-varying network connectivity. To achieve high accuracy at
reduced complexity and communication cost, the algorithm combines particle
implementations with parametric message representations and takes advantage of
a conditional independence property. Simulation results demonstrate the good
performance of the proposed algorithm in a challenging scenario with
time-varying network connectivity.Comment: 13 pages, 6 figures, 3 tables; manuscript submitted to IEEE
Transaction on Signal Processin
Cooperative Synchronization in Wireless Networks
Synchronization is a key functionality in wireless network, enabling a wide
variety of services. We consider a Bayesian inference framework whereby network
nodes can achieve phase and skew synchronization in a fully distributed way. In
particular, under the assumption of Gaussian measurement noise, we derive two
message passing methods (belief propagation and mean field), analyze their
convergence behavior, and perform a qualitative and quantitative comparison
with a number of competing algorithms. We also show that both methods can be
applied in networks with and without master nodes. Our performance results are
complemented by, and compared with, the relevant Bayesian Cram\'er-Rao bounds
Distributed Estimation with Information-Seeking Control in Agent Network
We introduce a distributed, cooperative framework and method for Bayesian
estimation and control in decentralized agent networks. Our framework combines
joint estimation of time-varying global and local states with
information-seeking control optimizing the behavior of the agents. It is suited
to nonlinear and non-Gaussian problems and, in particular, to location-aware
networks. For cooperative estimation, a combination of belief propagation
message passing and consensus is used. For cooperative control, the negative
posterior joint entropy of all states is maximized via a gradient ascent. The
estimation layer provides the control layer with probabilistic information in
the form of sample representations of probability distributions. Simulation
results demonstrate intelligent behavior of the agents and excellent estimation
performance for a simultaneous self-localization and target tracking problem.
In a cooperative localization scenario with only one anchor, mobile agents can
localize themselves after a short time with an accuracy that is higher than the
accuracy of the performed distance measurements.Comment: 17 pages, 10 figure
Probabilistic Graphical Models: an Application in Synchronization and Localization
Die Lokalisierung von mobilen Nutzern (MU) in sehr dichten Netzen erfordert hĂ€ufig die Synchronisierung der Access Points (APs) untereinander. Erstens konzentriert sich diese Arbeit auf die Lösung des Problems der Zeitsynchronisation in 5G-Netzwerken, indem ein hybrider Bayesischer Ansatz fĂŒr die SchĂ€tzung des Taktversatzes und des Versatzes verwendet wird. Wir untersuchen und demonstrieren den betrĂ€chtlichen Nutzen der Belief Propagation (BP), die auf factor graphs lĂ€uft, um eine prĂ€zise netzwerkweite Synchronisation zu erreichen. DarĂŒber hinaus nutzen wir die Vorteile der Bayesischen Rekursiven Filterung (BRF), um den Zeitstempel-Fehler bei der paarweisen Synchronisierung zu verringern. SchlieĂlich zeigen wir die VorzĂŒge der hybriden Synchronisation auf, indem wir ein groĂes Netzwerk in gemeinsame und lokale SynchronisationsdomĂ€nen unterteilen und so den am besten geeigneten Synchronisationsalgorithmus (BP- oder BRF-basiert) auf jede DomĂ€ne anwenden können.
Zweitens schlagen wir einen Deep Neural Network (DNN)-gestĂŒtzten Particle Filter-basierten (DePF)-Ansatz vor, um das gemeinsame MU-Sync&loc-Problem zu lösen. Insbesondere setzt DePF einen asymmetrischen Zeitstempel-Austauschmechanismus zwischen den MUs und den APs ein, der Informationen ĂŒber den Taktversatz, die Zeitverschiebung der MUs, und die AP-MU Abstand liefert. Zur SchĂ€tzung des Ankunftswinkels des empfangenen Synchronisierungspakets nutzt DePF den multiple signal classification Algorithmus, der durch die Channel Impulse Response (CIR) der Synchronisierungspakete gespeist wird. Die CIR wird auch genutzt, um den Verbindungszustand zu bestimmen, d. h. Line-of-Sight (LoS) oder Non-LoS (NLoS). SchlieĂlich nutzt DePF particle Gaussian mixtures, die eine hybride partikelbasierte und parametrische BRF-Fusion der vorgenannten Informationen ermöglichen und die Position und die Taktparameter der MUs gemeinsam schĂ€tzen.Mobile User (MU) localization in ultra dense networks often requires, on one hand, the Access Points (APs) to be synchronized among each other, and, on the other hand, the MU-AP synchronization. In this work, we firstly address the former, which eventually provides a basis for the latter, i.e., for the joint MU synchronization and localization (sync&loc). In particular, firstly, this work focuses on tackling the time synchronization problem in 5G networks by adopting a hybrid Bayesian approach for clock offset and skew estimation. Specifically, we investigate and demonstrate the substantial benefit of Belief Propagation (BP) running on Factor Graphs (FGs) in achieving precise network-wide synchronization. Moreover, we take advantage of Bayesian Recursive Filtering (BRF) to mitigate the time-stamping error in pairwise synchronization. Finally, we reveal the merit of hybrid synchronization by dividing a large-scale network into common and local synchronization domains, thereby being able to apply the most suitable synchronization algorithm (BP- or BRF-based) on each domain.
Secondly, we propose a Deep Neural Network (DNN)-assisted Particle Filter-based (DePF) approach to address the MU joint sync&loc problem. In particular, DePF deploys an asymmetric time-stamp exchange mechanism between the MUs and the APs, which provides information about the MUs' clock offset, skew, and AP-MU distance. In addition, to estimate the Angle of Arrival (AoA) of the received synchronization packet, DePF draws on the Multiple Signal Classification (MUSIC) algorithm that is fed by the Channel Impulse Response (CIR) experienced by the sync packets. The CIR is also leveraged on to determine the link condition, i.e. Line-of-Sight (LoS) or Non-LoS (NLoS). Finally DePF capitalizes on particle Gaussian mixtures which allow for a hybrid particle-based and parametric BRF fusion of the aforementioned pieces of information and jointly estimate the position and clock parameters of the MUs
Multisensor Poisson Multi-Bernoulli Filter for Joint Target-Sensor State Tracking
In a typical multitarget tracking (MTT) scenario, the sensor state is either
assumed known, or tracking is performed in the sensor's (relative) coordinate
frame. This assumption does not hold when the sensor, e.g., an automotive
radar, is mounted on a vehicle, and the target state should be represented in a
global (absolute) coordinate frame. Then it is important to consider the
uncertain location of the vehicle on which the sensor is mounted for MTT. In
this paper, we present a multisensor low complexity Poisson multi-Bernoulli MTT
filter, which jointly tracks the uncertain vehicle state and target states.
Measurements collected by different sensors mounted on multiple vehicles with
varying location uncertainty are incorporated sequentially based on the arrival
of new sensor measurements. In doing so, targets observed from a sensor mounted
on a well-localized vehicle reduce the state uncertainty of other poorly
localized vehicles, provided that a common non-empty subset of targets is
observed. A low complexity filter is obtained by approximations of the joint
sensor-feature state density minimizing the Kullback-Leibler divergence (KLD).
Results from synthetic as well as experimental measurement data, collected in a
vehicle driving scenario, demonstrate the performance benefits of joint
vehicle-target state tracking.Comment: 13 pages, 7 figure
- âŠ