Scholarlink

<p>Sensor-tasking to collect observation measurements of resident space objects constitutes a central problem for Space Situational Awareness (SSA). One specific type of sensor-tasking problem aims at rapidly producing an optimal or near-optimal schedule spanning over an observation horizon of a few hours up to a few nights. We derive tractable binary linear program formulations for solving the scheduling problem for both single and multiple telescopes. Observations are modeled by assuming the telescopes must track orbit passes for a user-defined exposure time. The proposed programs are efficiently solvable by branch-and-bound algorithms for instance sizes of practical applicability.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Multi-Sensor Tasking for Ground-Based Space Situational Awareness via Job-Shop Scheduling Problem

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年11月20日

查看全文
  • Yuri Shimane,
  • Koki Ho

摘要

Sensor-tasking to collect observation measurements of resident space objects constitutes a central problem for Space Situational Awareness (SSA). One specific type of sensor-tasking problem aims at rapidly producing an optimal or near-optimal schedule spanning over an observation horizon of a few hours up to a few nights. We derive tractable binary linear program formulations for solving the scheduling problem for both single and multiple telescopes. Observations are modeled by assuming the telescopes must track orbit passes for a user-defined exposure time. The proposed programs are efficiently solvable by branch-and-bound algorithms for instance sizes of practical applicability.