arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.08762cs.NIeess.SP
收藏

面向凸包外基于 ToA 定位的迭代 RNDOP 最优锚点放置:性能界限与启发式算法

Iterative RNDOP-Optimal Anchor Placement for Beyond Convex Hull ToA-based Localization: Performance Bounds and Heuristic Algorithms

Raghunandan M. Rao, Don-Roberts Emenonye

AI总结:

针对凸包外ToA定位场景,本文提出RNDOP指标并将最坏情况DOP最优锚点放置转化为极小极大问题,设计了三种基于秩1更新的迭代启发式方案,推导了定位误差上下界并构建了鲁棒锚点放置框架。

摘要:

对锚点凸包外的目标进行定位是一个研究较少但在车辆中心、基于无人机(UAV)和自定位应用中普遍存在的场景。针对此类场景,本文研究了基于到达时间(ToA)定位方案的最优锚点放置问题,以最小化最坏情况下的精度因子(DOP)。基于先前关于凸包外基于 ToA 定位的 DOP 缩放定律的研究结果,我们提出了一种称为归一化距离 DOP(RNDOP)的新指标。我们证明了最坏情况下的 DOP 最优锚点放置问题可简化为极小极大 RNDOP 最优锚点放置问题。然而,在现实约束下,该公式化导致了一个非凸且难以处理的问题。为克服此问题,我们提出了迭代锚点添加方案,从而产生了一个易于处理但仍非凸的问题。通过利用由秩1更新产生的结构,我们设计了三种具有不同性能与复杂度折中的启发式方案。此外,我们还推导了在放置锚点以优化最坏情况下(a)3D定位误差和(b)2D定位误差场景的上下界。基于这些结果,我们设计了一个用于鲁棒锚点放置的紧凑迭代算法框架,表征了锚点位置不确定性的影响,并讨论了所提方案的计算复杂度。利用数值结果,我们验证了理论结果的准确性。我们还提供了全面的蒙特卡洛仿真结果,以比较每种迭代方案的定位误差和执行时间性能,讨论了相关折中,并为凸包外定位场景提供了有价值的系统设计见解。

英文摘要:

Localizing targets outside the anchors' convex hull is an understudied but prevalent scenario in vehicle-centric, UAV-based, and self-localization applications. Considering such scenarios, this paper studies the optimal anchor placement problem for Time-of-Arrival (ToA)-based localization schemes such that the worst-case Dilution of Precision (DOP) is minimized. Building on prior results on DOP scaling laws for beyond convex hull ToA-based localization, we propose a novel metric termed the Range-Normalized DOP (RNDOP). We show that the worst-case DOP-optimal anchor placement problem simplifies to a min-max RNDOP-optimal anchor placement problem. Unfortunately, this formulation results in a non-convex and intractable problem under realistic constraints. To overcome this, we propose iterative anchor addition schemes, which result in a tractable albeit non-convex problem. By exploiting the structure arising from the resultant rank-1 update, we devise three heuristic schemes with varying performance-complexity tradeoffs. In addition, we also derive the upper and lower bounds for scenarios where we are placing anchors to optimize the worst-case (a) 3D positioning error and (b) 2D positioning error. We build on these results to design a cohesive iterative algorithmic framework for robust anchor placement, characterize the impact of anchor position uncertainty, and then discuss the computational complexity of the proposed schemes. Using numerical results, we validate the accuracy of our theoretical results. We also present comprehensive Monte-Carlo simulation results to compare the positioning error and execution time performance of each iterative scheme, discuss the tradeoffs, and provide valuable system design insights for beyond convex hull localization scenarios.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑