1,810 research outputs found
Landmark-based Localization using Stereo Vision and Deep Learning in GPS-Denied Battlefield Environment
Localization in a battlefield environment is increasingly challenging as GPS
connectivity is often denied or unreliable, and physical deployment of anchor
nodes across wireless networks for localization can be difficult in hostile
battlefield terrain. Existing range-free localization methods rely on
radio-based anchors and their average hop distance which suffers from accuracy
and stability in dynamic and sparse wireless network topology. Vision-based
methods like SLAM and Visual Odometry use expensive sensor fusion techniques
for map generation and pose estimation. This paper proposes a novel framework
for localization in non-GPS battlefield environments using only the passive
camera sensors and considering naturally existing or artificial landmarks as
anchors. The proposed method utilizes a customcalibrated stereo vision camera
for distance estimation and the YOLOv8s model, which is trained and fine-tuned
with our real-world dataset for landmark recognition. The depth images are
generated using an efficient stereomatching algorithm, and distances to
landmarks are determined by extracting the landmark depth feature utilizing a
bounding box predicted by the landmark recognition model. The position of the
unknown node is then obtained using the efficient least square algorithm and
then optimized using the L-BFGS-B (limited-memory quasi-Newton code for
bound-constrained optimization) method. Experimental results demonstrate that
our proposed framework performs better than existing anchorbased DV-Hop
algorithms and competes with the most efficient vision-based algorithms in
terms of localization error (RMSE).Comment: arXiv admin note: text overlap with arXiv:2402.1232
Eigenvector Synchronization, Graph Rigidity and the Molecule Problem
The graph realization problem has received a great deal of attention in
recent years, due to its importance in applications such as wireless sensor
networks and structural biology. In this paper, we extend on previous work and
propose the 3D-ASAP algorithm, for the graph realization problem in
, given a sparse and noisy set of distance measurements. 3D-ASAP
is a divide and conquer, non-incremental and non-iterative algorithm, which
integrates local distance information into a global structure determination.
Our approach starts with identifying, for every node, a subgraph of its 1-hop
neighborhood graph, which can be accurately embedded in its own coordinate
system. In the noise-free case, the computed coordinates of the sensors in each
patch must agree with their global positioning up to some unknown rigid motion,
that is, up to translation, rotation and possibly reflection. In other words,
to every patch there corresponds an element of the Euclidean group Euc(3) of
rigid transformations in , and the goal is to estimate the group
elements that will properly align all the patches in a globally consistent way.
Furthermore, 3D-ASAP successfully incorporates information specific to the
molecule problem in structural biology, in particular information on known
substructures and their orientation. In addition, we also propose 3D-SP-ASAP, a
faster version of 3D-ASAP, which uses a spectral partitioning algorithm as a
preprocessing step for dividing the initial graph into smaller subgraphs. Our
extensive numerical simulations show that 3D-ASAP and 3D-SP-ASAP are very
robust to high levels of noise in the measured distances and to sparse
connectivity in the measurement graph, and compare favorably to similar
state-of-the art localization algorithms.Comment: 49 pages, 8 figure
Graph Optimization Approach to Range-based Localization
In this paper, we propose a general graph optimization based framework for
localization, which can accommodate different types of measurements with
varying measurement time intervals. Special emphasis will be on range-based
localization. Range and trajectory smoothness constraints are constructed in a
position graph, then the robot trajectory over a sliding window is estimated by
a graph based optimization algorithm. Moreover, convergence analysis of the
algorithm is provided, and the effects of the number of iterations and window
size in the optimization on the localization accuracy are analyzed. Extensive
experiments on quadcopter under a variety of scenarios verify the effectiveness
of the proposed algorithm and demonstrate a much higher localization accuracy
than the existing range-based localization methods, especially in the altitude
direction
Robust Localization from Incomplete Local Information
We consider the problem of localizing wireless devices in an ad-hoc network
embedded in a d-dimensional Euclidean space. Obtaining a good estimation of
where wireless devices are located is crucial in wireless network applications
including environment monitoring, geographic routing and topology control. When
the positions of the devices are unknown and only local distance information is
given, we need to infer the positions from these local distance measurements.
This problem is particularly challenging when we only have access to
measurements that have limited accuracy and are incomplete. We consider the
extreme case of this limitation on the available information, namely only the
connectivity information is available, i.e., we only know whether a pair of
nodes is within a fixed detection range of each other or not, and no
information is known about how far apart they are. Further, to account for
detection failures, we assume that even if a pair of devices is within the
detection range, it fails to detect the presence of one another with some
probability and this probability of failure depends on how far apart those
devices are. Given this limited information, we investigate the performance of
a centralized positioning algorithm MDS-MAP introduced by Shang et al., and a
distributed positioning algorithm, introduced by Savarese et al., called
HOP-TERRAIN. In particular, for a network consisting of n devices positioned
randomly, we provide a bound on the resulting error for both algorithms. We
show that the error is bounded, decreasing at a rate that is proportional to
R/Rc, where Rc is the critical detection range when the resulting random
network starts to be connected, and R is the detection range of each device.Comment: 40 pages, 13 figure
Distributed on-line multidimensional scaling for self-localization in wireless sensor networks
The present work considers the localization problem in wireless sensor
networks formed by fixed nodes. Each node seeks to estimate its own position
based on noisy measurements of the relative distance to other nodes. In a
centralized batch mode, positions can be retrieved (up to a rigid
transformation) by applying Principal Component Analysis (PCA) on a so-called
similarity matrix built from the relative distances. In this paper, we propose
a distributed on-line algorithm allowing each node to estimate its own position
based on limited exchange of information in the network. Our framework
encompasses the case of sporadic measurements and random link failures. We
prove the consistency of our algorithm in the case of fixed sensors. Finally,
we provide numerical and experimental results from both simulated and real
data. Simulations issued to real data are conducted on a wireless sensor
network testbed.Comment: 32 pages, 5 figures, 1 tabl
- …