GDOP-Based Low-Complexity LEO Satellite Subset Selection for Positioning

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Kyeongjun Ko;M. Humayun Kabir;Jungtai Kim;Wonjae Shin
{"title":"GDOP-Based Low-Complexity LEO Satellite Subset Selection for Positioning","authors":"Kyeongjun Ko;M. Humayun Kabir;Jungtai Kim;Wonjae Shin","doi":"10.1109/JSYST.2024.3383092","DOIUrl":null,"url":null,"abstract":"Low Earth orbit (LEO) satellites have recently received considerable attention because they can provide stronger signal power and better bandwidth availability than medium Earth orbit or geosynchronous orbit satellites. However, due to the limited processing capability of a receiver, it is difficult to utilize all the measurements of the available satellites in view when the number of satellites is large. With this motivation, selecting a subset of satellites that are in a good geometry relative to the receiver for precise positioning among a large number of available LEO constellations represents a challenging yet significant problem. Geometric dilution of precision (GDOP) is a metric that provides useful information about the relative geometry between satellites and a receiver. In this study, we put forth a novel GDOP-based satellite selection algorithm that uses efficient matrix decomposition and update rule. Simulation results show that the proposed algorithm achieves a GDOP performance close to the optimal exhaustive search-based schemes while greatly reducing the computational complexity. In particular, the computational complexity is verified in terms of flop counts as well as numerical evaluations.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"989-996"},"PeriodicalIF":4.0000,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10498076/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Low Earth orbit (LEO) satellites have recently received considerable attention because they can provide stronger signal power and better bandwidth availability than medium Earth orbit or geosynchronous orbit satellites. However, due to the limited processing capability of a receiver, it is difficult to utilize all the measurements of the available satellites in view when the number of satellites is large. With this motivation, selecting a subset of satellites that are in a good geometry relative to the receiver for precise positioning among a large number of available LEO constellations represents a challenging yet significant problem. Geometric dilution of precision (GDOP) is a metric that provides useful information about the relative geometry between satellites and a receiver. In this study, we put forth a novel GDOP-based satellite selection algorithm that uses efficient matrix decomposition and update rule. Simulation results show that the proposed algorithm achieves a GDOP performance close to the optimal exhaustive search-based schemes while greatly reducing the computational complexity. In particular, the computational complexity is verified in terms of flop counts as well as numerical evaluations.
基于 GDOP 的低复杂度低地轨道卫星定位子集选择
与中地球轨道或地球同步轨道卫星相比,低地球轨道(LEO)卫星能够提供更强的信号功率和更好的带宽可用性,因此最近受到了广泛关注。然而,由于接收器的处理能力有限,当卫星数量较多时,很难利用视野中所有可用卫星的测量数据。因此,在大量可用的低地轨道卫星群中,选择相对于接收器具有良好几何形状的卫星子集进行精确定位是一个具有挑战性的重大问题。精度的几何稀释(GDOP)是一个度量指标,可提供卫星与接收器之间相对几何形状的有用信息。在本研究中,我们提出了一种基于 GDOP 的新型卫星选择算法,该算法使用高效的矩阵分解和更新规则。仿真结果表明,所提算法的 GDOP 性能接近基于穷举搜索的最优方案,同时大大降低了计算复杂度。特别是,计算复杂度在翻转次数和数值评估方面都得到了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Systems Journal
IEEE Systems Journal 工程技术-电信学
CiteScore
9.80
自引率
6.80%
发文量
572
审稿时长
4.9 months
期刊介绍: This publication provides a systems-level, focused forum for application-oriented manuscripts that address complex systems and system-of-systems of national and global significance. It intends to encourage and facilitate cooperation and interaction among IEEE Societies with systems-level and systems engineering interest, and to attract non-IEEE contributors and readers from around the globe. Our IEEE Systems Council job is to address issues in new ways that are not solvable in the domains of the existing IEEE or other societies or global organizations. These problems do not fit within traditional hierarchical boundaries. For example, disaster response such as that triggered by Hurricane Katrina, tsunamis, or current volcanic eruptions is not solvable by pure engineering solutions. We need to think about changing and enlarging the paradigm to include systems issues.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信