AstroLibrary:用于实时会合评估和优化避免碰撞的图书馆

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY Accounts of Chemical Research Pub Date : 2024-09-01 DOI:10.1016/j.jsse.2024.07.003
Shawn SH Choi , Peter JH Ryu , Kyuil Sim , Jaedong Seong , Jae Wook Song , Misoon Mah , Douglas DS Kim
{"title":"AstroLibrary:用于实时会合评估和优化避免碰撞的图书馆","authors":"Shawn SH Choi ,&nbsp;Peter JH Ryu ,&nbsp;Kyuil Sim ,&nbsp;Jaedong Seong ,&nbsp;Jae Wook Song ,&nbsp;Misoon Mah ,&nbsp;Douglas DS Kim","doi":"10.1016/j.jsse.2024.07.003","DOIUrl":null,"url":null,"abstract":"<div><div>Geospace is crowded due to the proliferation of satellites and space debris and will become more crowded with the increasing deployment of new space missions. This trend is rapidly increasing the probability of collisions between space objects. Space objects fly at extreme speeds; hence, the consequences of collisions are catastrophic. However, accurate and efficient conjunction assessment (CA) and collision avoidance (COLA) have long been challenging, even with the current space catalogues of O(10<sup>4</sup>) size. As the space catalogue size increases owing to the increased number of new satellites, improved sensor capabilities, and Kessler syndrome, the situation will worsen unless a paradigm-transforming computational method is devised. Here, we present the SpaceMap method, which can perform real-time CA and near-real-time COLA for O(10<sup>6</sup>) or more objects, provided that the spatiotemporal proximity amongst satellites is represented in a Voronoi diagram. As the most concise and efficient data structure for spatiotemporal reasoning amongst moving objects, Voronoi diagrams play a key role in the mathematical and computational basis for a new genre of artificial intelligence (AI) called space–time AI, which can find the best solutions to CA/COLA and other space decision-making problems in longer timeline windows. The algorithms are implemented in C++ and are available on GitHub as AstroLibrary, which has RESTful APIs and Python packages that can be called from application programs. Using this library, anyone with elementary programming skills can easily develop efficient applications for challenging spatiotemporal problems.</div></div>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"AstroLibrary: A library for real-time conjunction assessment and optimal collision avoidance\",\"authors\":\"Shawn SH Choi ,&nbsp;Peter JH Ryu ,&nbsp;Kyuil Sim ,&nbsp;Jaedong Seong ,&nbsp;Jae Wook Song ,&nbsp;Misoon Mah ,&nbsp;Douglas DS Kim\",\"doi\":\"10.1016/j.jsse.2024.07.003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Geospace is crowded due to the proliferation of satellites and space debris and will become more crowded with the increasing deployment of new space missions. This trend is rapidly increasing the probability of collisions between space objects. Space objects fly at extreme speeds; hence, the consequences of collisions are catastrophic. However, accurate and efficient conjunction assessment (CA) and collision avoidance (COLA) have long been challenging, even with the current space catalogues of O(10<sup>4</sup>) size. As the space catalogue size increases owing to the increased number of new satellites, improved sensor capabilities, and Kessler syndrome, the situation will worsen unless a paradigm-transforming computational method is devised. Here, we present the SpaceMap method, which can perform real-time CA and near-real-time COLA for O(10<sup>6</sup>) or more objects, provided that the spatiotemporal proximity amongst satellites is represented in a Voronoi diagram. As the most concise and efficient data structure for spatiotemporal reasoning amongst moving objects, Voronoi diagrams play a key role in the mathematical and computational basis for a new genre of artificial intelligence (AI) called space–time AI, which can find the best solutions to CA/COLA and other space decision-making problems in longer timeline windows. The algorithms are implemented in C++ and are available on GitHub as AstroLibrary, which has RESTful APIs and Python packages that can be called from application programs. Using this library, anyone with elementary programming skills can easily develop efficient applications for challenging spatiotemporal problems.</div></div>\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2024-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S246889672400106X\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S246889672400106X","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

由于卫星和空间碎片的激增,地球空间变得十分拥挤,而且随着新的空间飞行任务的不断部署,地球空间将变得更加拥挤。这一趋势正在迅速增加空间物体之间发生碰撞的概率。空间物体的飞行速度极快,因此碰撞的后果是灾难性的。然而,长期以来,精确高效的会合评估(CA)和碰撞避免(COLA)一直是一项挑战,即使是在当前 O(104)大小的空间目录中也是如此。随着新卫星数量的增加、传感器能力的提高以及凯斯勒综合征(Kessler Syndrome)的出现,空间目录的规模也在不断扩大,除非设计出一种能改变模式的计算方法,否则情况将会恶化。在此,我们提出了 SpaceMap 方法,该方法可以对 O(106) 或更多的对象执行实时 CA 和近实时 COLA,前提是卫星之间的时空接近性用 Voronoi 图表示。作为移动物体间时空推理最简洁、最高效的数据结构,Voronoi 图在被称为时空人工智能(space-time AI)的人工智能(AI)新流派的数学和计算基础中发挥着关键作用,它能在更长的时间窗口内找到 CA/COLA 和其他空间决策问题的最佳解决方案。这些算法是用 C++ 实现的,并以 AstroLibrary 的形式发布在 GitHub 上,它有 RESTful API 和 Python 包,可以从应用程序中调用。利用这个库,任何具备初级编程技巧的人都能轻松开发出高效的应用程序,解决具有挑战性的时空问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
AstroLibrary: A library for real-time conjunction assessment and optimal collision avoidance
Geospace is crowded due to the proliferation of satellites and space debris and will become more crowded with the increasing deployment of new space missions. This trend is rapidly increasing the probability of collisions between space objects. Space objects fly at extreme speeds; hence, the consequences of collisions are catastrophic. However, accurate and efficient conjunction assessment (CA) and collision avoidance (COLA) have long been challenging, even with the current space catalogues of O(104) size. As the space catalogue size increases owing to the increased number of new satellites, improved sensor capabilities, and Kessler syndrome, the situation will worsen unless a paradigm-transforming computational method is devised. Here, we present the SpaceMap method, which can perform real-time CA and near-real-time COLA for O(106) or more objects, provided that the spatiotemporal proximity amongst satellites is represented in a Voronoi diagram. As the most concise and efficient data structure for spatiotemporal reasoning amongst moving objects, Voronoi diagrams play a key role in the mathematical and computational basis for a new genre of artificial intelligence (AI) called space–time AI, which can find the best solutions to CA/COLA and other space decision-making problems in longer timeline windows. The algorithms are implemented in C++ and are available on GitHub as AstroLibrary, which has RESTful APIs and Python packages that can be called from application programs. Using this library, anyone with elementary programming skills can easily develop efficient applications for challenging spatiotemporal problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
期刊最新文献
Intentions to move abroad among medical students: a cross-sectional study to investigate determinants and opinions. The change process questionnaire (CPQ): A psychometric validation. Prevalence and predictors of hand hygiene compliance in clinical, surgical and intensive care unit wards: results of a second cross-sectional study at the Umberto I teaching hospital of Rome. The prevention of medication errors in the home care setting: a scoping review. Differential Costs of Raising Grandchildren on Older Mother-Adult Child Relations in Black and White Families.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1