Date of Award:

5-2026

Document Type:

Thesis

Degree Name:

Master of Science (MS)

Department:

Electrical and Computer Engineering

Committee Chair(s)

Greg Droge

Committee

Greg Droge

Committee

Jackson Kulik

Committee

Tianyi He

Abstract

Satellite constellations, groups of satellites working together, are increasingly used for applications such as global internet coverage, weather and climate monitoring, and disaster response. As these constellations grow larger and more capable, deciding which satellites should observe which locations and when becomes a complex task that can no longer be done by hand. This problem, known as the Satellite Orienteering Problem, involves finding the best possible schedule for all satellites so that they accomplish the most valuable work within limited time and resource constraints.

This research develops a new computer-based planning system that improves how satellites are scheduled. The system combines several optimization techniques into an Integrated Planning Framework that makes the scheduling process faster and more effective. It introduces four main innovations: a scoring method that gives preference to high-priority and time-sensitive tasks, an improved search method that balances exploration and refinement, a way to ensure that hard-to-reach targets are not missed, and a method to fairly distribute work among satellites.

Together, these innovations allow the planner to create more efficient and reliable schedules compared to traditional approaches. The results show significant improvements in overall mission performance and a stronger ability to adapt to real-world operational demands.

Download

Available for download on Thursday, May 01, 2031

Share

COinS

Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .