Optimized Design Method for Satellite Constellation Configuration Based on Real-time Coverage Area Evaluation

Jiahao Zhou, Boheng Li, Qingxiang Meng

Abstract

Designing satellite constellations for regional reconnaissance requires balancing high revisit rates with minimized resource costs. This paper presents an optimized design method utilizing an improved Simulated Annealing (SA) algorithm coupled with a novel hexagonal grid discretization for real-time coverage evaluation. By approximating sensor footprints with hexagonal cells, the computational complexity of coverage analysis is significantly reduced. The proposed SA algorithm dynamically adjusts the number of satellites and orbital parameters to converge on an optimal configuration. Experimental results demonstrate that the method achieves rapid convergence, identifying a 54-satellite Walker constellation that provides over 70% coverage for a target region in just 26 iterations.

Introduction

In modern satellite missions, particularly those focused on disaster monitoring and regional reconnaissance, the ability to provide persistent or frequent coverage of specific geographic areas is paramount. However, the high cost of satellite deployment necessitates "Constellation Optimization"—the strategic arrangement of orbital planes, inclinations, and satellite spacing to maximize coverage while minimizing the number of spacecraft. Traditional optimization methods often struggle with the computational burden of calculating coverage over irregular regions, leading to slow design cycles. This research addresses these challenges by introducing a more efficient evaluation framework and a robust optimization heuristic.

Methodology

The proposed methodology integrates advanced geometric discretization with a stochastic optimization algorithm to streamline the constellation design process.

Hexagonal Discretization for Coverage Evaluation

A critical component of this method is the shift from traditional rectangular grids to hexagonal discretization for measuring ground coverage. Satellite sensor footprints are typically circular or elliptical. Mathematically, hexagonal cells provide a more efficient tiling of the plane for such shapes, reducing the overlap and gaps inherent in square-grid approximations.

Hexagonal grid discretization used to evaluate the coverage of satellite swaths (a-b-c-d and A-B-C-D) over a target area.

This discretization allows for rapid "point-in-polygon" checks to determine if a specific region is covered at any given time step. By handling irregular boundaries more gracefully, the hexagonal mesh ensures that the coverage percentage calculated during the optimization loop is both accurate and computationally inexpensive.

Improved Simulated Annealing (SA)

The optimization core utilizes a modified Simulated Annealing algorithm. SA is a probabilistic technique for approximating the global optimum of a given function. The "improvement" in this study lies in the algorithm's ability to dynamically alter the constellation size.

  • Dynamic Scaling: If a candidate configuration meets the target coverage threshold, the algorithm attempts to "cool" the system by reducing the number of satellites, searching for the absolute minimum required.
  • Exploration: If the coverage requirement is not met, the algorithm "heats" up, adding satellites or adjusting orbital inclinations to escape local optima and explore a broader solution space.

Orbital Modeling

To ensure realistic simulations, the system incorporates the J2 perturbation model. This model accounts for the Earth's oblateness (the J2 term in the geopotential expansion), which causes the precession of the orbital plane and the argument of perigee over time. Modeling these effects is essential for predicting long-term constellation performance and revisit stability.

Results and Discussion

The effectiveness of the method was evaluated using a simulated mission scenario targeting a large regional block (approximately $100^\circ$E to $124^\circ$E and $19^\circ$N to $43^\circ$N). The search space was constrained within the Walker Constellation framework, a standard for uniform global or regional coverage.

Global ground tracks of a simulated satellite constellation, illustrating the complex overlap required for regional coverage.

Optimization Performance

The improved SA algorithm demonstrated remarkable efficiency, converging on an optimal solution in only 26 iterations. For a target coverage requirement of 70%, the algorithm identified a Walker 54/9/1 configuration (54 satellites across 9 planes) at an inclination of $38^\circ$.

Coverage Metrics

The resulting constellation achieved an average regional coverage of 72.7%. This configuration ensures a stable revisit rate, providing the necessary temporal resolution for reconnaissance tasks while avoiding the excessive redundancy of larger, unoptimized fleets. By minimizing the satellite count, the design also reduces the downstream data processing load for ground segments.

Conclusion

This research provides a high-efficiency framework for satellite constellation design. The combination of hexagonal grid discretization and a dynamic Simulated Annealing algorithm allows designers to navigate complex trade-offs between coverage performance and mission cost rapidly. Future work will focus on expanding the model to include heterogeneous constellations with varying altitudes and accounting for environmental constraints such as cloud cover and lighting, which are vital for optical remote sensing operations.

Summary updated

BibTeX
@inproceedings{zhou2022optimized,
  author = {Jiahao Zhou and Boheng Li and Qingxiang Meng},
  title = {{Optimized Design Method for Satellite Constellation Configuration Based on Real-time Coverage Area Evaluation}},
  booktitle = {Geoinformatics},
  year = {2022},
  doi = {10.1109/geoinformatics57846.2022.9963835},
}
Figure