pith. sign in

arxiv: 2509.10585 · v3 · pith:6I7XJ3TBnew · submitted 2025-09-12 · 📡 eess.SY · cs.SY

Analysis and Design of Spare Strategy for Large-Scale Satellite Constellation Using Direct Insertion under (r,q) Policy

Seungyeop Han , Zachary Grieser , Shoji Yoshikawa , Takumi Noro , Takumi Suda , Koki Ho This is my paper

Pith reviewed 2026-05-21 22:03 UTC · model grok-4.3

classification 📡 eess.SY cs.SY
keywords satellite constellationspare strategyMarkov chainreorder policydirect insertioncost minimizationmega-constellationfailure modeling
0
0 comments X

The pith

Markov chain models of failures and replenishments optimize spare policies to minimize costs in large satellite constellations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper develops a Markov chain-based method for analyzing and optimizing spare replenishment in large-scale satellite constellations. It focuses on a direct insertion strategy where spares are ordered under a periodic-review reorder-point and order-quantity policy. Stochastic elements like satellite failures and launch lead times are modeled using Markov chains for both failure and replenishment processes. The framework is used to solve an optimization problem for minimal operational costs and is tested on a real mega-constellation. Sympathetic readers would care because such strategies can help manage the high costs and reliability demands of maintaining extensive satellite networks in orbit.

Core claim

The authors establish that Markov chain representations of failure and replenishment dynamics provide an efficient and accurate framework for optimizing the (r,q) spare replenishment policy to minimize operational costs in large-scale satellite constellations, as demonstrated by a real-world mega-constellation case study.

What carries the argument

Markov chain models of the failure dynamics and replenishment dynamics that support analysis of the periodic-review (r,q) policy for direct spare insertion.

If this is right

  • Optimal values for the reorder point r and order quantity q can be computed by minimizing the expected operational costs using the Markov model.
  • The optimized policy reduces the total costs associated with spare satellite management in the constellation.
  • The approach accurately captures the stochastic behavior without requiring extensive simulations.
  • Direct insertion into constellation planes is incorporated into the replenishment dynamics.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar modeling could apply to other replenishment problems in space logistics such as propellant resupply.
  • Accounting for correlations between failures across planes might refine the policy further.
  • Real-time monitoring could update the Markov states dynamically for adaptive ordering.

Load-bearing premise

Satellite failures and launch vehicle lead times follow Markovian dynamics that adequately represent reality without needing more detailed time-dependent or history-dependent models.

What would settle it

A direct comparison showing that the costs or availability predicted by the optimized policy differ substantially from observed performance in the actual mega-constellation would disprove the framework's accuracy.

read the original abstract

This paper introduces a Markov chain-based approach for the analysis and optimization of spare-management policies in large-scale satellite constellations. Focusing on the direct strategy, we model spare replenishment as a periodic-review reorder-point/order-quantity policy, where spares are deployed directly to constellation planes. The stochastic behavior of satellite failures and launch vehicle lead times is captured through Markov representations of both failure and replenishment dynamics. Based on this efficient and accurate framework, we construct and solve an optimization problem aimed at minimizing operational costs. The effectiveness of the proposed method is demonstrated through a case study using a real-world mega-constellation.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper introduces a continuous-time Markov chain framework to model satellite failure processes and launch vehicle lead times under a periodic-review (r,q) spare replenishment policy with direct insertion into constellation planes. Steady-state balance equations are solved to evaluate long-run costs, an optimization problem is formulated to select reorder point r and order quantity q that minimize operational costs, and the approach is illustrated with numerical results from a real-world mega-constellation case study.

Significance. If the Markovian modeling assumptions prove sufficiently accurate, the work supplies an analytical alternative to simulation for spare-stock optimization in large constellations, which could support cost-efficient operations at scale. The explicit use of the standard (r,q) policy and direct-insertion strategy aligns with practical satellite logistics constraints.

major comments (2)
  1. [Modeling section (failure and replenishment dynamics) and Case-study section] The load-bearing modeling assumption is that satellite failures and replenishment lead times admit Markovian (memoryless, stationary-rate) representations. The manuscript constructs CTMCs for these processes and solves the resulting balance equations, but provides no validation or sensitivity analysis against non-exponential distributions (e.g., Weibull or non-homogeneous Poisson processes for failures) or deterministic/batch lead times. This directly affects the reliability of the optimized (r,q) values and claimed cost reductions.
  2. [Case study section] The case-study results report numerical outcomes for a mega-constellation but do not include discrete-event simulation benchmarks or cross-validation with alternative failure distributions to quantify the approximation error introduced by the Markov assumption. Without such checks, it is unclear whether the efficiency and accuracy claims hold beyond the exponential case.
minor comments (2)
  1. [Policy description] Define the periodic-review interval explicitly and clarify how it interacts with the continuous-time Markov chain formulation.
  2. [Optimization formulation] Add a table or figure summarizing the steady-state probability expressions or cost function components for the (r,q) policy.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback on our manuscript. We address each major comment below and describe the revisions we plan to incorporate.

read point-by-point responses

  1. Referee: [Modeling section (failure and replenishment dynamics) and Case-study section] The load-bearing modeling assumption is that satellite failures and replenishment lead times admit Markovian (memoryless, stationary-rate) representations. The manuscript constructs CTMCs for these processes and solves the resulting balance equations, but provides no validation or sensitivity analysis against non-exponential distributions (e.g., Weibull or non-homogeneous Poisson processes for failures) or deterministic/batch lead times. This directly affects the reliability of the optimized (r,q) values and claimed cost reductions.

    Authors: We agree that the Markovian assumption is central and that explicit validation would strengthen the claims. The continuous-time Markov chain framework was selected to enable closed-form steady-state analysis and efficient optimization of the (r,q) policy for constellations with thousands of satellites, where full simulation may become computationally burdensome. In the revised manuscript we will add a dedicated sensitivity subsection that compares optimal (r,q) values and costs under the exponential assumption versus Weibull failure times and deterministic lead times, using the same mega-constellation parameters to quantify differences. revision: yes

  2. Referee: [Case study section] The case-study results report numerical outcomes for a mega-constellation but do not include discrete-event simulation benchmarks or cross-validation with alternative failure distributions to quantify the approximation error introduced by the Markov assumption. Without such checks, it is unclear whether the efficiency and accuracy claims hold beyond the exponential case.

    Authors: We acknowledge that the current case study presents only the analytical results. To address this, the revised version will include discrete-event simulation benchmarks run on the same constellation parameters. These simulations will be used both to validate the Markov-chain predictions under exponential assumptions and to provide cross-comparisons with non-exponential scenarios, thereby quantifying the approximation error and supporting the efficiency claims. revision: yes

Circularity Check

0 steps flagged

No significant circularity in Markov chain modeling or optimization

full rationale

The paper's derivation relies on standard continuous-time Markov chain representations of satellite failures and replenishment lead times under the (r,q) policy, followed by solution of the steady-state balance equations and formulation of a cost-minimization optimization problem. These steps draw from external probability theory and operations research methods rather than defining quantities in terms of themselves or renaming fitted results as predictions. The real-world mega-constellation case study applies the framework for demonstration; no evidence appears that parameters are chosen such that the claimed efficiency gains reduce tautologically to the inputs by construction. The framework remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

2 free parameters · 1 axioms · 0 invented entities

The approach rests on standard stochastic assumptions drawn from operations research. Specific numerical values for r and q are outputs of the optimization and therefore fitted to the case-study data.

free parameters (2)
  • reorder point r
    Decision variable chosen by the optimization routine on the basis of modeled costs and service levels.
  • order quantity q
    Decision variable chosen by the optimization routine on the basis of modeled costs and service levels.
axioms (1)
  • domain assumption Satellite failures and launch lead times admit Markovian representations
    Explicitly invoked in the abstract as the basis for the stochastic model.

pith-pipeline@v0.9.0 · 5650 in / 1428 out tokens · 57649 ms · 2026-05-21T22:03:48.357066+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Spare Strategy Analysis and Design for Mega Satellite Constellations Using Markov Chain

    math.OC 2025-09 unverdicted novelty 6.0

    Markov chain analysis with fixed-point iteration and genetic algorithm optimization for multi-echelon spare strategies in mega satellite constellations.

  2. Spare Strategy for Large-Scale Satellite Constellations Under Dual Resupply Channels Using Markov Chain

    math.OC 2026-05 unverdicted novelty 5.0

    A Markov-chain framework with periodic-review and standard (s,Q) policies models coupled indirect and direct resupply channels for satellite constellations, yielding stationary cost and resilience metrics via fixed-po...

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages · cited by 2 Pith papers · 1 internal anchor

  1. [1]

    Han, S., Noro, T., and Ho, K., Analysis and Design of Satellite Constellation Spare Strategy Using Markov Chain, arXiv preprint arXiv:2408.09250, 2024

    work page arXiv 2024

  2. [2]

    Han, S., Grieser, Z., Yoshikawa, S., Noro, T., Suda, T., and Ho, K., Spare Strategy Analysis and Design for Large-Scale Satellite Constellation Using Markov Chain, arXiv preprint arXiv:2509.09957, 2025

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  3. [3]

    Jakob, P., Shimizu, S., Yoshikawa, S., and Ho, K., Optimal satellite constellation spare strategy using multi-echelon inventory control, Journal of Spacecraft and Rockets, Vol. 56, No. 5, 2019, pp. 1449--1461

    work page 2019

  4. [4]

    Department of Defense , Fact Sheet: Resilience of Space Capabilities, , 2011

    U.S. Department of Defense , Fact Sheet: Resilience of Space Capabilities, , 2011

    work page 2011

  5. [5]

    1002--1007

    Burch, R., A Method for Calculation of the Resilience of a Space System, MILCOM 2013 - 2013 IEEE Military Communications Conference, 2013, pp. 1002--1007. doi:10.1109/MILCOM.2013.174

    work page doi:10.1109/milcom.2013.174 2013

  6. [6]

    ://spaceinsider.tech/2023/08/16/how-much-does-it-cost-to-launch-a-rocket/, accessed: 2025-07-11

    SpaceInsider , How Much Does It Cost to Launch a Rocket? [By Type & Size], , 2025. ://spaceinsider.tech/2023/08/16/how-much-does-it-cost-to-launch-a-rocket/, accessed: 2025-07-11

    work page 2025

  7. [7]

    ://www.ainvest.com/news/rocket-lab-48-hour-launch-turnaround-strategic-play-dominance-smallsat-launch-market-2506/, accessed: 2025-07-11

    Ainvest , Rocket Lab's 48-Hour Launch Turnaround: A Strategic Play for Dominance in the SmallSat Launch Market, , 2025. ://www.ainvest.com/news/rocket-lab-48-hour-launch-turnaround-strategic-play-dominance-smallsat-launch-market-2506/, accessed: 2025-07-11

    work page 2025

  8. [8]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter doi edition editor eid howpublished institution journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1 'mid.sent...

    work page

  9. [9]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in "" FUNCTION format.date year ...

    work page