Estimation of Relative Kinematic Parameters of an Anchorless Network

Estimation of the relative positions of N static nodes in D-dimensional space given the pairwise distances between them is a well-studied problem in literature. However, for a network of mobile nodes, the existing solutions proposed in literature rely either on the knowledge of absolute positions of some nodes or enforce constraints on the motion of individual nodes to achieve a unique solution. In this work, we consider an anchorless environment and propose a time-varying Grammianbased data model which relates the relative positions of the mobile nodes to the pairwise distances between them. Given the Euclidean model, we propose algorithms to estimate the relative positions, velocity and other higher order derivatives, referred to as relative kinematics, associated with the network of mobile nodes. We further consider a scenario where accelerometers are on-board on all the mobile nodes, and investigate the inclusion the accelerometer measurements in the proposed model. The Cramer-Rao lower bound for the proposed data models are ´ derived and compared with the performance of the estimators using Monte-Carlo simulations. We further compare and analyse the performance of the proposed estimators against the state-ofthe-art methods, and present research directions for future work to further improve the proposed approach.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Signal and Information Processing over Networks
Published
2025-01-01
DOI
https://doi.org/10.1109/tsipn.2025.3557585
Citations
1
Primary Topic
Gear and Bearing Dynamics Analysis
Type
article
Field-Weighted Citation Impact
0.71
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Estimation of Relative Kinematic Parameters of an Anchorless Network

Anurodh Mishra, Raj Thilak Rajan
1 citations
IEEE Transactions on Signal and Information Processing over Networks
Gear and Bearing Dynamics Analysis
0.71
article

Estimation of Relative Kinematic Parameters of an Anchorless Network

Anurodh Mishra, Raj Thilak Rajan
article en
1 citations

Abstract

Estimation of the relative positions of N static nodes in D-dimensional space given the pairwise distances between them is a well-studied problem in literature. However, for a network of mobile nodes, the existing solutions proposed in literature rely either on the knowledge of absolute positions of some nodes or enforce constraints on the motion of individual nodes to achieve a unique solution. In this work, we consider an anchorless environment and propose a time-varying Grammianbased data model which relates the relative positions of the mobile nodes to the pairwise distances between them. Given the Euclidean model, we propose algorithms to estimate the relative positions, velocity and other higher order derivatives, referred to as relative kinematics, associated with the network of mobile nodes. We further consider a scenario where accelerometers are on-board on all the mobile nodes, and investigate the inclusion the accelerometer measurements in the proposed model. The Cramer-Rao lower bound for the proposed data models are ´ derived and compared with the performance of the estimators using Monte-Carlo simulations. We further compare and analyse the performance of the proposed estimators against the state-ofthe-art methods, and present research directions for future work to further improve the proposed approach.

IEEE Transactions on Signal and Information Processing over NetworksVol. 11
Delft University of Technology (NL)
Openalex Percentile: Top 34%
Gear and Bearing Dynamics Analysis
0.71
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.