Back to search

Cal Poly

Optimization of Repeat Ground Track Constellation Design for Complex Discontinuous Regional Coverage

Abstract

dc:description.abstract

The continued growth of low Earth orbit (LEO) satellite constellations motivates efficient constellation design methods to reduce cost and complexity. Although brute-force methods are commonly employed in the preliminary design of satellite constellations, pairing analytic methods with optimization algorithms provides a more efficient means of searching the design space. Constellation design for continuous global and regional coverage is well-established; however, strategies for discontinuous regional coverage remain underdeveloped. This thesis focuses on an analytic geometry-based method for computing satellite coverage and revisit metrics, coupled with genetic algorithm optimization to efficiently explore the design space. The viability of this method is shown through four unique case studies, applied to varying regional coverage problems. Each case study examines a relevant subset of constellation design metrics, including coverage time, guaranteed coverage area, possible coverage area, maximum revisit gap, and number of satellites. Both continuous and discontinuous coverage regions are examined across the case studies, one of which includes a subregion of increased viewing interest. A novel geometry-based approach computes a lower bound on the achievable and guaranteed coverage area for a repeat ground track satellite constellation. These approaches eliminate the computational overhead inherent to numerical propagation and the discrete-time-step evaluation of coverage and revisit metrics. The geometry-based coverage approach accounts for the spacecraft orbit, sensor characteristics, and region of interest using propagation-free repeat ground track geometry with first-order secular J2 corrections. The presented methods apply to complex continuous and discontinuous regions. The case studies in this thesis utilize Walker-Delta and Walker-Delta type constellations which permit variable interplane spacing. The key application of this work lies in preliminary mission design, where the improvement of computational speed to accelerate search space exploration is paramount.

Degree

thesis:*
Name thesis:degree_name
MS in Aerospace Engineering
Discipline thesis:degree_discipline
Aerospace Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Jewell, Paige
Contributors dc:contributor
  • Madhusudan Vijayakumar
  • Aerospace Engineering
  • College of Engineering

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.calpoly.edu/theses/3281

Chain of custody

source
Harvested from
Cal Poly
Base URL
digitalcommons.calpoly.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Jewell, Paige. Optimization of Repeat Ground Track Constellation Design for Complex Discontinuous Regional Coverage. https://digitalcommons.calpoly.edu/theses/3281