arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.00895eess.SP
收藏

GNSS快照定位问题的混合最小二乘模型

A Mixed Integer Least-Squares Formulation of the GNSS Snapshot Positioning Problem

Eyal Waserman, Sivan Toledo

摘要:

本文提出了一个公式的快照定位作为一个混合整数最小二乘问题。在快照定位中,人们根据全球导航卫星系统(GNSS)的码相位和可能的多普勒观测来估计位置,而不知道码的出发时间(时间戳)。解决该问题允许接收器根据缺少嵌入在GNSS数据流中的时间戳信息的短射频快照来确定定位。这用于减少某些接收器的首次定位时间,并用于某些野生动物跟踪器。本文提出了两个新的配方的问题和算法,解决了由此产生的混合整数最小二乘问题。我们还表明,新的配方可以产生修复,即使有巨大的初始误差,远远大于允许范Diggelen的广泛引用的粗时间导航方法。

英文摘要:

This paper presents a formulation of Snapshot Positioning as a mixed-integer least-squares problem. In snapshot positioning one estimates a position from code-phase and possibly Doppler observations of a Global Navigation Satellite Systems (GNSS) without knowing the time of departure (timestamp) of the codes. Solving the problem allows a receiver to determine a fix from short radio-frequency snapshots missing the time-stamp information embedded in the GNSS data stream. This is used to reduced the time to first fix in some receivers, and it is used in certain wildlife trackers. This paper presents two new formulations of the problem and an algorithm that solves the resulting mixed-integer least-squares problems. We also show that the new formulations can produce fixes even with huge initial errors, much larger than permitted in Van Diggelen's widely-cited coarse-time navigation method.

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

↑