Maximum Independent Set Satellite Scheduling World Cities Data Set

Satellite Scheduling World Cities Data Set The Satellite Scheduling World Cities Data Set is the a set of cities treated as point locations used to simulate a set of image collection tasking requests for AIAA paper "A Maximum Independent Set Method for Scheduling Earth-Observing Satellite Constellations". It provides an open reference and benchmark for the satellite task scheduling problem. This could also be considered as a sparse Maximum Independent Set problem for a generic graph. The requests represent point collects, from which we can compute multiple distinct collection opportunities. The tasking problem is then to select a subset of these collects that it is possible for the spacecraft to feasibly collect in a given time period, subject to constraints on the spacecraft's agility and constraints on only collecting a single collect per request (no duplication of effort).The data set is hosted on both Github and Zenodo. The Github repository contains the original source data, the associated requests generated from the source data, and scripts to reproduce the scenario files. Zenodo (DOI 10.5281/zenodo) hosts copies of the output Metis graph files and collect data files. Due to the large size of produced files these are not included in the Github repository. Notes NotesPlease note that while the source data and generation methods are identical to the satellite task planning paper it was created for. The specific generated problems do not exactly reproduce the scenario in the paper. Since the original reproduction, updates in upstream software dependencies have changed the output of the generation process (specifically, Earth orientaiton parameter handling libraries). This can be determined by considering the cardinality of the generated collect set. However, these differences are generally small and since the constriant rate is similar, the results should be comparable. Spacecraft Count Orignial Publication Collect Count Reproduction Collect Count 4 59356 59624 6 90777 91204 12 180008 180939 24 359170 361519 This repository also adds additional scenarios for 1, 2, and 36 satellites. Note, the provided scenarios represent the largest 10,000 request data set. Should a smaller request set be desired, the requests should be filtered to the top `x` request based on city population and any collects not associated with those requests should be discarded. Note the Zenodo repository excludes the collect and graph files for the 1 and 2 satellite scenarios to avoid the file limits. These can still be reproduced from the Github source code. Acknolwedgement If this data set is used in your research, please cite the following paper A Maximum Independent Set Method for Scheduling Earth-Observing Satellite Constellations @article{eddy2021maximum, title={A Maximum Independent Set Method for Scheduling Earth-Observing Satellite Constellations}, author={Eddy, Duncan and Kochenderfer, Mykel J}, journal={Journal of Spacecraft and Rockets}, volume={58}, number={5}, pages={1416--1429}, year={2021}, publisher={American Institute of Aeronautics and Astronautics} } Licensing The source of the world cities data is from the simplemaps.com website,licensed under the Creative Commons Attribution 4.0 International License with the specific license found at `./data/worldcities_license.txt`.卫星调度世界城市数据集 本卫星调度世界城市数据集将若干城市作为点位，用于模拟美国航空航天学会（AIAA）论文《面向对地观测卫星星座调度的最大独立集方法》（A Maximum Independent Set Method for Scheduling Earth-Observing Satellite Constellations）中的图像采集任务请求集。该数据集为卫星任务调度问题提供了开源参考基准与测试集，亦可被视作通用图中的稀疏最大独立集（Maximum Independent Set）问题。 任务请求对应点位采集任务，由此可生成若干不同的采集窗口。该调度任务的目标是从这些采集任务中选取子集，使得航天器可在给定时间段内完成可行采集，同时需满足航天器机动性约束，且每个请求仅能对应一次采集（避免重复工作）。 本数据集同时托管于GitHub与Zenodo平台。GitHub仓库包含原始源数据、由源数据生成的关联任务请求，以及用于复现场景文件的脚本。Zenodo（DOI 10.5281/zenodo）则存储了生成的Metis图文件与采集数据文件副本。由于生成文件体积较大，GitHub仓库未包含这些内容。 ## 注意事项 尽管本数据集的源数据与生成方法与对应卫星任务规划论文一致，但生成的具体问题并未完全复现论文中的场景。自最初复现以来，上游软件依赖项的更新已改变了生成流程的输出结果（具体为地球定向参数处理库），可通过生成的采集任务集的基数判断这一差异。不过此类差异通常较小，且由于约束率相近，实验结果仍具备可比性。 ### 采集任务统计 航天器数量、原论文采集任务数与复现采集任务数如下： | 航天器数量 | 原论文采集任务数 | 复现采集任务数 | |------------|----------------|----------------| | 4 | 59356 | 59624 | | 6 | 90777 | 91204 | | 12 | 180008 | 180939 | | 24 | 359170 | 361519 | 本仓库还新增了1、2及36颗航天器的场景。需注意，提供的场景对应最大的10000条任务请求数据集。若需更小的任务请求集，可基于城市人口筛选前`x`条请求，并丢弃与这些请求无关的所有采集任务。 需注意，Zenodo仓库因受文件大小限制，未包含1颗和2颗航天器场景的采集与图文件，这些文件仍可通过GitHub源代码复现。 ## 致谢 若本数据集用于您的研究，请引用以下论文： 《面向对地观测卫星星座调度的最大独立集方法》 作者：Eddy, Duncan 与 Kochenderfer, Mykel J 期刊：《航天器与火箭杂志》（Journal of Spacecraft and Rockets） 卷58，第5期，页码1416–1429，2021年 出版社：美国航空航天学会（AIAA） 对应的BibTeX引用格式如下： @article{eddy2021maximum, title={A Maximum Independent Set Method for Scheduling Earth-Observing Satellite Constellations}, author={Eddy, Duncan and Kochenderfer, Mykel J}, journal={Journal of Spacecraft and Rockets}, volume={58}, number={5}, pages={1416--1429}, year={2021}, publisher={American Institute of Aeronautics and Astronautics} } ## 许可协议 本世界城市数据源自simplemaps.com网站，采用知识共享署名4.0国际许可协议，具体许可条款详见`./data/worldcities_license.txt`。