SearcharxivSearch

arXiv · 1807.02685

Optimal Satellite Constellation Spare Strategy Using Multi-Echelon Inventory Control

Abstract

The recent growing trend to develop large-scale satellite constellations (i.e., mega-constellation) with low-cost small satellites has brought the need for an efficient and scalable maintenance strategy decision plan. Traditional spare strategies for satellite constellations cannot handle these mega-constellations due to their limited scalability in number of satellites and/or frequency of failures. In this paper, we propose a novel spare strategy using an inventory management approach. We consider a set of parking orbits at a lower altitude than the constellation for spare storage, and model satellite constellation spare strategy problem using a multi-echelon (s,Q)-type inventory policy, viewing Earth's ground as a supplier, parking orbits as warehouses, and in-plane spare stocks as retailers. This inventory model is unique in that the parking orbits (warehouses) drift away from the orbital planes over time due to orbital mechanics' effects, and the in-plane spare stocks (retailers) would receive the resupply from the closest (i.e., minimum waiting time) available warehouse at the time of delivery. The parking orbits (warehouses) are also resupplied from the ground (supplier) with stochastic lead time caused by the order processing and launch opportunities, leveraging the cost saving effects by launching many satellites in one rocket (i.e., batch launch discount). The proposed analytical model is validated against simulations using Latin Hypercube Sampling. Furthermore, based on the proposed model, an optimization formulation is introduced to identify the optimal spare strategy, comprising the parking orbits characteristics and all locations policies, to minimize the maintenance cost of the system given performance requirements. The proposed model and optimization method are applied to a real-world case study of satellite mega-constellation to demonstrate their value.

Explore related subjects

Keep this discovery

BibTeXRIS

Pauline C. M. Jakob, Seiichi Shimizu, Shoji Yoshikawa, Koki Ho. 2018-07-07. Optimal Satellite Constellation Spare Strategy Using Multi-Echelon Inventory Control. https://doi.org/10.2514/1.a34387

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC