Content area
This paper proposes a distance estimation error reduction framework to improve ground node localization accuracy in urban environments using an unmanned aerial vehicle (UAV) and path loss measurements. The primary goal of the framework is to bound distance estimation errors arising from inherent inaccuracies in path loss measurements. A k-means clustering algorithm is first applied to identify the region in which the ground node is located. Then, an analytical approach is used to select UAV waypoints. Moreover, a mean-based exponential smoothing approach is employed to refine the path loss measurements of the selected waypoints to mitigate the effects of multipath components that introduce significant errors in distance estimation. Finally, two estimators, maximum likelihood (ML)-based and semidefinite programming (SDP)-based relaxation, are employed to estimate the ground node’s location, validating the effectiveness of the proposed framework. Evaluations using ray tracing simulation data demonstrate a notable improvement in localization accuracy. The proposed framework effectively bounds the distance estimation errors and significantly reduces overall localization errors compared to conventional unbounded methods. Moreover, both estimators with the proposed framework achieve comparable localization accuracy, highlighting the framework’s capability to address key challenges in ML-based localization.
Details
Global positioning systems--GPS;
Accuracy;
Semidefinite programming;
Urban environments;
Cluster analysis;
Radio frequency;
Communication;
Unmanned aerial vehicles;
Clustering;
Optimization techniques;
Nodes;
Waypoints;
Error reduction;
Estimators;
Algorithms;
Localization;
Performance evaluation;
Vector quantization
; Hilman Muhammad 2 1 Faculty of Engineering and Technology, Multimedia University, Jalan Ayer Keroh Lama, Melaka 75450, Malaysia; [email protected] (Y.B.); [email protected] (Y.K.C.)
2 Faculty of Computer Science, Universitas Indonesia, Kampus Baru UI Depok, Jawa Barat 16425, Indonesia; [email protected]