The research, led by Beomjin Gwon and Jaemyung Ahn, tackles a subtle but consequential problem in how multi-satellite launches work. When a single rocket carries many satellites, it injects them into a shared parking orbit rather than directly into their final operational positions. From there, the satellites spread into their target orbital planes by exploiting a natural phenomenon: the J2 perturbation, caused by the oblateness of the Earth, makes orbital planes precess, or slowly rotate, at rates that depend on altitude. Two orbits at different altitudes precess at slightly different speeds, so a satellite that lingers in a parking orbit gradually drifts away from its injection plane. By waiting the right amount of time before firing its thrusters, a satellite can arrive at a target plane without expensive propulsive maneuvers.

The catch is that this drift is slow and the waiting time is finite. The achievable separation in right ascension of the ascending node, or RAAN, the angle that defines where an orbital plane sits around the Earth, is limited by the difference in precession rates between the parking and target orbits multiplied by the available dwell time. Different launchers inject at different epochs and carry different dwell time allowances, so the set of orbital planes each rocket can actually reach is restricted. As the authors point out, not every coverage-attractive constellation pattern is physically reachable within a given deployment window, which means deployment constraints can reshape the feasible design space before the final pattern is ever selected.

To capture this effect mathematically, the framework begins with a repeating ground track seed orbit, an orbital configuration in which the satellite retraces the same path over the Earth’s surface after a fixed cycle. From this seed, the researchers generate a discretized common ground track constellation: a finite family of candidate satellites that share the same ground track and differ only in their coupled RAAN and mean anomaly phasing. This structure yields a powerful computational shortcut. Because all candidates are phase-shifted copies of one another along the same repeat cycle, the temporal access profile of every candidate, a binary record of when it can see a ground target within field-of-view and minimum elevation constraints, can be obtained simply by circularly shifting the seed satellite’s profile.

The deployment physics then enters through what the authors call admissible satellite sets. For each launcher and each discretized injection RAAN option, the reachable RAAN range is approximated as the difference between the parking and target orbit precession rates multiplied by that launcher’s maximum dwell time. Only candidate satellites whose target RAANs fall within this range are deemed deployable by that launcher-injection combination. Aggregating the access contributions of all reachable satellites produces a launcher-level admissible access profile, effectively transforming RAAN reachability into a design-space filter that excludes infeasible patterns during optimization rather than after the fact. The team validated this first-order J2 approximation against full numerical propagation using the EGM2008 gravity model, finding relative errors below 0.66 percent across the tested dwell times, ample accuracy for early design screening.

The optimization itself proceeds in two stages. Stage 1 is an integer linear program that selects the injection RAAN for each launcher, maximizing the worst-case temporal access performance across the simulation horizon while using dwell time margin as a secondary tie-breaking criterion. This screening step identifies injection conditions with favorable coverage potential and deployment slack before any satellite is committed. Stage 2 is a mixed-integer linear program that selects the actual satellites from the admissible pool, assigns them to launchers, and enforces coverage requirements, launcher capacity limits, and the finite deployment window, all while minimizing two conflicting objectives: total deployment cost, comprising satellite and launch costs, and deployment completion time.

Because cost and completion time conflict, the researchers enumerate a Pareto front using an epsilon-constraint strategy with weighted-sum tie breaking. The procedure first finds the minimum-cost and minimum-time extreme points, then iteratively tightens the completion time bound, forcing the solver to move to the next distinct step on the trade-off curve rather than repeatedly returning the same solution. Both stages belong to the class of mixed-integer problems with NP-hard worst-case complexity, and the case studies were run in MATLAB with the Gurobi solver on a high-performance workstation, with each subproblem capped at three hours of wall clock time.

Two case studies demonstrate the framework’s reach. The first designs a Sun-synchronous constellation at roughly 1,257 kilometers altitude to observe Jeju Island, using ten candidate launchers with dwell times ranging from 125 to 356 days and up to eleven satellites per launch. The resulting Pareto front clusters into four-launch and five-launch solutions, with completion times spanning 196.08 to 363.46 days and costs from about 735 million to 843 million dollars under the KSLV-II launcher. Switching to the cheaper Vega C vehicle leaves completion times unchanged but shifts the entire trade-off curve downward in cost, since the orbital mechanics and dwell time constraints are identical. The second case, a lower-inclination LEO constellation at about 826 kilometers targeting New York City with a narrower sensor geometry, requires ten to eleven launches and 76 to 83 satellites, achieving completion times between 86.63 and 132.44 days at costs from roughly 2.32 to 2.54 billion dollars under KSLV-II, or 1.95 to 2.13 billion under Vega C.

The ablation and comparison studies reveal why the integrated approach matters. When the dwell time margin term was stripped from Stage 1, every resulting trade-off solution was dominated by at least one solution from the full framework, and the fast-deployment region of the Pareto front disappeared entirely, with the fastest ablated solution taking 104.38 days versus 86.63 days for the proposed method. Against a conventional coverage-first baseline, which fixed a 36-satellite constellation and then optimized its deployment, the new framework did not uniformly win, but it exposed a far richer set of alternatives: the baseline was marginally faster but 132.70 million dollars more expensive than the fastest proposed solution, while the lowest-cost proposed solution cut total cost by 25.7 percent at the price of 111.83 additional days of deployment time.

The authors position the framework as particularly suited to small and medium near-Earth constellations deployed through multi-satellite launches that exploit J2-driven differential nodal precession, a category that covers much of the modern Earth observation and regional monitoring market. Future work will incorporate orbit-dependent launcher performance, rideshare deployment, explicit transfer maneuver modeling potentially coupled with orbital transfer vehicles, and heterogeneous launch vehicle fleets. For an industry racing to field constellations under tight budgets and tighter schedules, the message is clear: the rocket is not just the delivery service for a constellation, it is a co-designer of it, and treating deployment physics as a first-class citizen of the design space can expose cheaper, faster, and more realistic architectures than coverage optimization alone would ever reveal.

Subject of Research: Deployment-aware optimization of satellite constellation pattern design using J2-driven RAAN reachability and two-stage mixed-integer programming

Article Title: Two-Stage Framework for Deployment-Aware Optimization of Satellite Constellation Pattern Design

Article References: Gwon, B., & Ahn, J. (2026). Two-Stage Framework for Deployment-Aware Optimization of Satellite Constellation Pattern Design. International Journal of Aeronautical and Space Sciences. https://doi.org/10.1007/s42405-026-01298-1

Image Credits: AI Generated

DOI: 10.1007/s42405-026-01298-1

Keywords: satellite constellations, deployment optimization, J2 perturbation, RAAN drift, mixed-integer programming, Pareto front, Sun-synchronous orbit, low Earth orbit, launch vehicles, Earth observation, KAIST, revisit time

The traditional approach to guaranteeing that a satellite passes over the same point on Earth at regular intervals relies on what orbital dynamicists call a repeat ground track. Because the Earth rotates beneath an orbiting spacecraft, the satellite’s path traced on the ground, its ground track, shifts westward on each successive revolution. By carefully choosing the orbital period so that the ratio of orbital revolutions to Earth rotations is a whole number fraction, engineers can force the ground track to retrace itself exactly after a fixed number of orbits. This elegant trick has underpinned decades of Earth observation mission design, from reconnaissance satellites to radar imaging constellations. The catch is that the repeat period is rigidly tied to the orbital period, so designers who need frequent revisits are often forced into low altitudes or constellations of many spacecraft, both of which carry significant cost and complexity.

The Yonsei team’s insight is that a repeat ground track is not the only way to bring a satellite back over a target. In inclined orbits, the ground track is a wavy curve that oscillates between northern and southern latitudes, and on successive days these curves cross one another at well-defined points known as ground track intersection points. If a target happens to sit at or near such an intersection, the satellite can pass over it from two different directions on different passes, effectively doubling the opportunities for observation without requiring the ground track to repeat at all. By deliberately shaping the orbit so that a ground track intersection point coincides with the desired target, the designers can harvest these extra revisits as a bonus on top of whatever the repeat cycle provides. The concept builds on earlier work presented at the 35th International Symposium on Space Technology and Science in Tokushima, Japan, in June 2025, which laid out a fast-access revisit design for reusable unmanned space vehicles.

Turning this geometric intuition into a workable orbit requires more than a lucky coincidence of curves. The researchers formulated the problem as a nonlinear optimization: they derived three equality conditions from spherical geometry and from the dynamics of an orbit perturbed by the J2 effect, the dominant non-spherical component of Earth’s gravity field caused by the planet’s equatorial bulge. The J2 perturbation steadily rotates both the orbital plane and the line of apsides, so a design that ignored it would drift away from its target within days. Each of the three conditions was expressed as a residual, and, in a move that makes the results intuitively interpretable, each residual was converted into a surface distance error measured on the ground. Minimizing these distance errors means the resulting orbit places its ground track intersection as close as possible to the target while satisfying the timing conditions imposed by the fast-access requirement.

The optimization framework also had to respect the defining feature of the mission concept: fast initial access. A reusable space vehicle launched on short notice must reach its surveillance target quickly, which constrains the orbital elements available to the designer. Rather than relaxing these mission constraints to buy better revisit performance, the team held them fixed and let the ground track intersection mechanism do the heavy lifting. This is what distinguishes the new approach from earlier responsive-orbit studies, which often traded access speed against coverage, or relied on multi-objective evolutionary algorithms to search for compromises across large constellations. Here, a single vehicle in a single inclined orbit achieves both goals simultaneously, because the revisit enhancement comes from geometry that is already present in the trajectory rather than from additional hardware.

The numerical results are striking. A prior study of the same mission scenario reported a revisit interval of 47.3 hours, meaning that a target could wait nearly two full days between successive observation opportunities. The proposed method improves this to a maximum of 20.2 hours and a minimum of 3.3 hours, with an average of 11.7 hours across the cases examined. In practical terms, the worst-case gap between looks at the target shrinks by more than half, while the best cases deliver surveillance imagery within a single working shift. Because the improvement is achieved without altering mission constraints, the designers argue that it comes essentially for free, a consequence of choosing orbital elements that place the ground track intersection where it is most useful. For a reusable vehicle that may fly many short missions over its lifetime, the cumulative gain in observation opportunities could be substantial.

Of course, an optimal set of orbital elements on paper is only the beginning of a real mission. High-fidelity mission planning requires numerical propagation of the trajectory under detailed force models, including atmospheric drag, higher-order gravity harmonics, and third-body effects, and such propagation needs accurate initial conditions. The paper addresses this by presenting a procedure for converting the optimal orbital elements into initial conditions suitable for high-fidelity numerical propagation. This step bridges the gap between the analytic design, which relies on averaged J2-perturbed dynamics, and the operational simulation environment in which mission planners validate coverage, station keeping budgets, and end-of-life disposal. The authors also draw on established conversion techniques, including classical formulations for handling small eccentricities and inclinations in perturbation theory, to ensure the transformation between element sets remains robust across the design space.

The broader context of this research is the rapid maturation of reusable space systems. Reusable launch vehicles and reusable unmanned space vehicles have moved from concept studies to active development programs worldwide, motivated by the promise of lower cost per flight and faster turnaround between missions. South Korea has invested in this direction through the Reusable Unmanned Space Vehicle Research Center, and the new study was supported by the National Research Foundation of Korea, the Korea AeroSpace Administration, and the Korea Research Institute for defense Technology planning and advancement under the Defense Acquisition Program Administration. An orbit design that maximizes the scientific and operational value of each flight is a natural complement to hardware reusability: if the vehicle is going up repeatedly anyway, the trajectory it flies should squeeze the maximum number of target passes out of every mission profile.

The technique also connects to a rich literature on responsive space, a paradigm championed in the mid-2000s that emphasized coverage, responsiveness, and accessibility as key metrics for military and civil satellites. Earlier efforts used genetic algorithms to design surveillance orbits and constellations, and more recent work has optimized constellations for minimum worst-case revisit time or for constant revisit intervals in low Earth orbit reconnaissance. What sets the ground track intersection approach apart is its analytic character: rather than searching a vast combinatorial space of constellation configurations, it exploits a deterministic geometric property of inclined orbits, solved through a small set of nonlinear conditions. That makes the method computationally light and transparent, qualities that matter when designers need to iterate rapidly across candidate mission profiles or adapt to changing target lists.

Looking ahead, the implications extend beyond reusable reconnaissance vehicles. Any mission that values frequent looks at a specific latitude, whether for disaster monitoring, wildfire tracking, or maritime domain awareness, could benefit from orbit designs that place ground track intersections over regions of interest. The framework’s treatment of residuals as surface distance errors gives mission planners a direct, physical measure of how well a candidate orbit serves its target, which eases communication between orbital analysts and operational users. As launch costs continue to fall and mission tempo rises, the bottleneck in Earth observation is shifting from getting to orbit to using orbital geometry intelligently once there. The Yonsei team’s result, turning a 47-hour wait into an average 11.7-hour cadence with a single spacecraft, is a vivid demonstration that clever astrodynamics can still deliver step-change improvements without a single new satellite being built.

Subject of Research: Orbit design for fast-access revisit surveillance missions using ground track intersection points in J2-perturbed inclined orbits

Article Title: Fast Access Revisit Orbit Design Via Ground Track Intersection Point

Article References: Son, S., Lee, J., Kim, K., & Park, C. (2026). Fast Access Revisit Orbit Design Via Ground Track Intersection Point. International Journal of Aeronautical and Space Sciences. https://doi.org/10.1007/s42405-026-01221-8

Image Credits: AI Generated

DOI: 10.1007/s42405-026-01221-8

Keywords: orbit design, ground track intersection, revisit time, reusable space vehicles, J2 perturbation, surveillance satellites, responsive space, astrodynamics, inclined orbits, optimization, Earth observation, Yonsei University