Concurrent Space-Based Observer Placement and Scheduling for Cislunar Space Domain Awareness
Abstract
As interest in cislunar space grows, so does the need for space domain awareness (SDA) capabilities to safely support missions. To enhance cislunar SDA capabilities, the use of space-based observers has been proposed. Prior research has explored optimizing observer placement but has not considered scheduling limitations. We propose a mixed-integer linear programming formulation that concurrently optimizes the placement and scheduling of space-based observers for cislunar SDA. Our work considers three aspects of observer scheduling: sensor tasking, communication, and charging. We utilize a scenario-based approach that generalizes observer placement for unknown targets while applying scheduling constraints to each scenario. However, this problem quickly becomes difficult for commercial solvers to handle as the number of scenarios grows. As an alternative, a column generation approach is employed to introduce well-performing schedules into the problem for each orbital slot. A comparative analysis is performed across multiple instances to evaluate the performance of column generation against that of a commercial solver. A case study is then conducted in which the performance of the observers' placement from the concurrent formulation is tested against a set of validation target sets and compared with the performance of two baselines in which placement and scheduling are performed sequentially.
Related
- Exact Pole Placement for a ZOH-Discretized Extended State Observer: Noise Analysis and a JONSWAP Case Study
- Information-Based Trajectory Planning for Spacecraft-to-Spacecraft Tracking and Navigation in Cislunar Space
- Transformer-Informed Trajectory Optimization for Relative Motion in Cislunar Orbits
- Cislunar navigation is an observability problem: arc-length thresholds, Gramian conditioning, and the Doppler lever
- Same stimuli, different spaces: how task, observer and amount of data influence geometry and reliability of mental representations
BibTeX
@misc{amato2026concurrent,
title = {{Concurrent Space-Based Observer Placement and Scheduling for Cislunar Space Domain Awareness}},
author = {Dominic K. Amato and Hang Woon Lee},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.33313},
eprint = {2610.33313},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.33313},
}
RIS
TY - UNPB
TI - Concurrent Space-Based Observer Placement and Scheduling for Cislunar Space Domain Awareness
AU - Dominic K. Amato
AU - Hang Woon Lee
PY - 2026
DA - 2026/10/23
PB - arXiv
DO - 10.48550/arxiv.2610.33313
UR - https://arxiv.org/abs/2610.33313
AB - As interest in cislunar space grows, so does the need for space domain awareness (SDA) capabilities to safely support missions. To enhance cislunar SDA capabilities, the use of space-based observers has been proposed. Prior research has explored optimizing observer placement but has not considered scheduling limitations. We propose a mixed-integer linear programming formulation that concurrently optimizes the placement and scheduling of space-based observers for cislunar SDA. Our work considers three aspects of observer scheduling: sensor tasking, communication, and charging. We utilize a scenario-based approach that generalizes observer placement for unknown targets while applying scheduling constraints to each scenario. However, this problem quickly becomes difficult for commercial solvers to handle as the number of scenarios grows. As an alternative, a column generation approach is employed to introduce well-performing schedules into the problem for each orbital slot. A comparative analysis is performed across multiple instances to evaluate the performance of column generation against that of a commercial solver. A case study is then conducted in which the performance of the observers' placement from the concurrent formulation is tested against a set of validation target sets and compared with the performance of two baselines in which placement and scheduling are performed sequentially.
ER -