betaFeedback

WorksPhysics and Astronomy

Beyond the Cube: Overlapping Grid Methods for Debris Collision Risk Assessment

Abstract

The cube method reduces conjunction screening in orbital debris simulations to O(N)\mathcal{O}(N) cost by evaluating only object pairs sharing the same grid cell at each snapshot, but systematically assigns zero collision probability to pairs separated by a cell boundary at that epoch, a failure known as boundary blindness. This paper introduces the Double Cube (DC) method, which recovers boundary-crossing conjunctions through a spatially shifted secondary grid using bin-index lookup alone, preserving O(N)\mathcal{O}(N) complexity. In an isotropic convergence benchmark at L=50L = 50 km, DC reduces the blindness rate from βCube=7.09%β_{\mathrm{Cube}} = 7.09\% to βDC=0.55%β_{\mathrm{DC}} = 0.55\%, and a synchronized experiment separates the temporal component from the geometric one and leaves DC below 0.01%0.01\% against 0.80%0.80\% for the cube. Recovering these pairs changes which pairs are evaluated and leaves the probability formula untouched, so it does not improve calibration by itself, and both uncorrected methods remain substantially miscalibrated, with a reliability slope of m=1.1314m = 1.1314 for the cube and m=1.0996m = 1.0996 for DC. The formula applies the full cell volume to every evaluated pair irrespective of separation, which is the same bias characterized in the no-time-counter scheme of Direct Simulation Monte Carlo. Two corrections are derived from the geometry of the uniform cell alone: a power-law form referenced to the Robbins mean separation dˉ=0.6617L\bar{d} = 0.6617L and a Gaussian form using both that mean and the analytically derived standard deviation σ=0.2494Lσ= 0.2494L, with no quantity fitted to simulation output. The power-law correction moves the reliability slope to 0.99730.9973 at k=1k = 1 and 0.94290.9429 at k=2k = 2, and the Gaussian correction reaches 0.98060.9806 with an intercept of 0.9750.975, the only configuration within 3%3\% of unity on both. Both corrections have been implemented in MOCAT-MC.

NOMENCLATURE

Latin Symbols

SymbolDefinition
AAintercept of the log-log reliability regression; A=1A = 1: perfect calibration
AijA_{ij}binary collision flag for pair (i,j)(i,j)
aasemi-major axis of an orbit, km
ccGaussian correction constant (= 1.5)
dgapd_{\mathrm{gap}}orbital altitude band gap between two objects, km
dijd_{ij}snapshot center-to-center separation of pair (i,j)(i,j), km
dˉ\bar{d}Robbins mean separation (= 0.6617LL), km
dUdUcell volume denominator in collision probability, km3^3
dUintdU_{\mathrm{int}}ARDC Tier 1 intersection sub-cell volume (= L3/8L^3/8), km3^3

Table 5.

dUstddU_{\mathrm{std}} ARDC Tier 2 standard cell volume (= L3L^3), km3^3

ee orbital eccentricity

F(dij;μ,σ)F(d_{ij};\mu,\sigma) Gaussian CDF of pair-distance distribution

fbf_b empirical collision frequency in reliability bin bb

IiI_i primary bin index of object ii

Ii′I'_i shifted bin index of object ii

kk power-law correction exponent

LL cubic cell side length, km

mm log-log regression slope; m=1m = 1: perfect calibration

NN number of objects in population

NobjN_{\mathrm{obj}} number of objects per Monte Carlo seed

NpairsN_{\mathrm{pairs}} total evaluated pairs across all reliability bins

nbn_b number of pairs in reliability bin bb

PijP_{ij} collision probability for pair (i,j)(i,j) per snapshot

Pˉb\bar{P}_b mean predicted probability in reliability bin bb

PcorrPLP_{\mathrm{corr}}^{\mathrm{PL}} power-law corrected collision probability

PcorrCDFP_{\mathrm{corr}}^{\mathrm{CDF}} Gaussian CDF corrected collision probability

PrawP^{\mathrm{raw}} uncorrected collision probability

R2R^2 coefficient of determination of log-log regression

RiR_i, RjR_j hard-body radii of objects ii and jj, km

rar_a apogee radius = a(1+e)a(1+e), km

rpr_p perigee radius = a(1−e)a(1-e), km

vv object speed, km/s

VrelV_{\mathrm{rel}} relative speed of pair (i,j)(i,j), km/s

Greek Symbols

α(dij)\alpha(d_{ij}) per-pair correction factor, (0,1](0,1]

αRO\alpha_{\mathrm{RO}} radial range overlap gate factor, {0,1}\{0,1\}

β\beta boundary blindness rate

Δ(3)\Delta(3) Robbins constant for three dimensions (= 0.661707)

Δtcube\Delta t_{\mathrm{cube}} grid snapshot interval, s

Δtsim\Delta t_{\mathrm{sim}} physics sub-step interval, s

Δttrav\Delta t_{\mathrm{trav}} mean cell traversal time (= L/VrelL/V_{\mathrm{rel}}), s

η\eta normalized pair separation (= dij/0.6617Ld_{ij}/0.6617L)

μ\mu mean of pair-distance distribution (= 0.6617L0.6617L), km

σ\sigma standard deviation of pair-distance distribution (= 0.2494L0.2494L), km

Subscripts

aa apogee

bb bin index in reliability diagram

corr\mathrm{corr} corrected

int\mathrm{int} ARDC Tier 1 intersection sub-cell

pp perigee

raw\mathrm{raw} uncorrected

RO\mathrm{RO} radial range overlap

std\mathrm{std} ARDC Tier 2 standard full-cell

trav\mathrm{trav} traversal

Abbreviations

ADRActive Debris Removal
ARDCAdaptive Resolution Double Cube
CDFCumulative Distribution Function
Cubegrid-based collision screening method (Liou et al.)
DAMAGEDebris Analysis and Monitoring Architecture to the Geosynchronous Environment
DCDouble Cube
DSMCDirect Simulation Monte Carlo
ECEExpected Calibration Error
KBOKuiper Belt Object
LEOLow Earth Orbit
LEGENDLEO-to-GEO Environment Debris model
MCSMean Collision Separation
MOCAT-MCMIT Monte Carlo Orbital Capacity Assessment Tool
NTCNo-Time-Counter
PDFProbability Density Function
ROIRegion of Interest
SOLEMSpace Objects Long-term Evolution Model

caption:

:::

INTRODUCTION

The growing number of active payloads and derelict objects in Low Earth Orbit (LEO) poses a serious threat to the long-term sustainability of the near-Earth space environment [1, 2]. Annual assessments by the European Space Agency confirm that object densities in several altitude bands already exceed the threshold for self-sustaining collision cascades [3]. Commercial constellation deployments have approximately doubled the active payload count in LEO over the past decade, compounding the hazard posed by existing fragmentation debris [4, 5]. Assessing the long-term consequences of this growth and the effectiveness of remediation strategies, including Active Debris Removal (ADR) and post-mission disposal requirements, requires evolutionary models capable of propagating large object populations over decades [6, 7]. Tools of this class include the MIT Monte Carlo Orbital Capacity Assessment Tool (MOCAT-MC) [8, 9], the NASA LEO-to-GEO Environment Debris (LEGEND) model [10], and the Debris Analysis and Monitoring Architecture to the Geosynchronous Environment (DAMAGE) [11, 12]. MOCAT-MC has been applied to dynamic risk assessment and target prioritization for Active Debris Removal missions [13], demonstrating that accurate long-term collision probability estimates are central to identifying high-risk objects [14, 15].

The central computational bottleneck in these simulations is conjunction screening. Evaluating all pairs in a population of NN objects requires O(N2)O(N^2) distance computations per time step, which is intractable for multi-century Monte Carlo studies involving 10510^5 or more objects [16, 17]. Liou et al. [18] introduced the cube method to reduce this cost, originally for asteroid-Kuiper Belt Object (KBO) conjunction assessment and later adapted to the orbital debris environment [19]. The method discretizes the simulation volume into uniform cubic cells of side length LL and assigns a nonzero collision probability only to pairs sharing the same cell at each snapshot. Under the kinetic theory of gases assumption that objects are uniformly distributed within a cell, the collision probability for pair (i,j)(i,j) at snapshot tt is

Pij=π(Ri+Rj)2VrelΔtdU,(1)P_{ij} = \frac{\pi(R_i + R_j)^2 V_{\mathrm{rel}} \Delta t}{dU}, \tag*{(1)}

where RiR_i and RjR_j are the object radii, VrelV_{\mathrm{rel}} is the relative speed, dU=L3dU = L^3 is the cell volume, and Δt\Delta t is the snapshot interval. Only co-occupant pairs are evaluated, reducing conjunction screening to O(N)O(N) [19].

Despite this efficiency, the cube method has well-documented failure modes. Lewis et al. [20] showed that collision rate estimates are sensitive to cell size and that a cube can produce false conjunctions between objects on non-intersecting orbital planes when their altitude separation is comparable to LL. Diserens et al. [21] compared cube against the Orbit Trace method across several real conjunction scenarios and found poor convergence of pairwise probability estimates and systematic over-prediction of intra-constellation rates, attributing the latter to cube’s random mean anomaly sampling. The most fundamental limitation is spatial boundary blindness: when two objects are proximate but fall in adjacent cells at the snapshot epoch, Equation (1) is never evaluated, and the collision probability is recorded as exactly zero.

Several approaches recover missed conjunctions, each at a high computational cost. The Orbit Trace method evaluates the geometric intersection of orbital paths at O(N2)O(N^2) per time step [21]. The Smart Sieve method [22] reduces the pair list through distance-based filters, but identifying qualifying pairs still requires Euclidean computation, reintroducing pairwise scaling in dense regimes. The Improved-Cube method, used in the Space Objects Long-term Evolution Model (SOLEM) [23, 24], replaces the grid cell with a search sphere of radius 3L\sqrt{3}L and adjusts the denominator to that sphere’s volume, 43πL3≈21.8L3\frac{4}{3}\pi L^3 \approx21.8L^3, which increases the number of evaluated candidates by roughly a factor of twenty-two and requires explicit distance computation against the surrounding population. Figure 1 illustrates the detection geometry of each approach.

Comparison of three grid-based collision screening approaches

Figure 1. Comparison of three grid-based collision screening approaches. (a) Standard cube evaluates pairs sharing the same cell (dU=L3dU=L^3); pairs in adjacent cells receive zero probability. (b) Improved-Cube (I-Cube) searches a sphere of radius 3L\sqrt{3}L, increasing the evaluated candidate count by roughly a factor of twenty-two. (c) Double Cube (DC) uses a shifted secondary grid offset by L/2L/2 to recover the same pairs through bin-index lookup alone, preserving O(N)O(N) complexity. Solid and dashed outlines denote the primary and shifted grids, respectively; shaded regions indicate the active cells that contain at least one object. Marker styles and colors in panel (a) are consistent across all panels.

The cube algorithm makes two decisions for each pair at every snapshot, whether to evaluate the pair at all and what probability to assign it, and the errors at the two levels are independent. At the candidacy level, the co-occupancy rule admits pairs whose orbits cannot intersect and omits pairs that straddle a cell boundary, and no modification of Equation (1) repairs either mode, since in the first case the formula is applied to a pair that should have been excluded and in the second it is never applied at all. At the value level, Equation (1) applies the full cell volume L3L^3 to every evaluated pair irrespective of where within the cell the two objects lie, so a pair at contact and a pair separated by nearly a full cell diagonal receive the same probability. The same expression governs molecular collision events in Direct Simulation Monte Carlo (DSMC) gas dynamics as the No-Time-Counter (NTC) algorithm [25], and Alexander, Garcia, and Alder [26] showed that transport coefficients computed under this scheme are overestimated by a term scaling as the square of the normalized cell size. For two points drawn uniformly from a cube of side LL, the expected center-to-center separation is dˉ=0.6617L\bar{d} = 0.6617L, and any detected pair whose actual separation dijd_{ij} exceeds this value is assigned too high a probability. The DC method addresses the candidacy level, and the corrections derived in the methodology section address the value level.

This paper introduces the Double Cube (DC) method, which recovers boundary-crossing conjunctions through a spatially shifted secondary grid using bin-index lookup alone, preserving O(N)O(N) complexity. The DC method offsets a secondary grid by L/2L/2 in each Cartesian dimension; any pair separated by a primary-grid boundary on a single axis shares a cell in the shifted grid along that axis, requiring only two bin-index lookups per object without calculating the Euclidean distance. The Adaptive Resolution Double Cube (ARDC) is an instrumentation variant that applies a reduced volumetric denominator to pairs confirmed by both grids simultaneously. The resulting overestimation, which grows with the degree of volume reduction, motivates the corrections derived here. The first correction is a power-law function of the ratio of the detected pair’s snapshot separation to the Robbins mean distance dˉ=0.6617L\bar{d}=0.6617L, evaluated at the DSMC-motivated exponents k=1k=1 and k=2k=2. The second is derived entirely from the first and second moments of the pair-distance distribution, both obtained analytically from the uniform cell geometry. Both methods are validated against a deterministic physics engine in an isotropic Rush-In convergence scenario at L=50L=50 km. DC reduces the blindness rate from βCube=7.09%\beta_{\mathrm{Cube}}=7.09\% to βDC=0.55%\beta_{\mathrm{DC}}=0.55\%, and a synchronized experiment isolates the geometric residual to 0.80%0.80\% for the cube against less than 0.01%0.01\% for DC. The power-law correction moves the reliability slope from 1.0996 to 0.9973 at k=1k=1 and 0.9429 at k=2k=2, and the parameter-free Gaussian correction reaches 0.9806 with an intercept of 0.975, the only configuration within 3% of unity on both metrics.

The paper is organized as follows. The methodology section presents the DC and ARDC architectures and derives both correction frameworks and the calibration metrics. The simulation environment section describes the Rush-In scenario, the physics engine, and the Monte Carlo protocol. The results section reports blindness, pair-distance, and calibration findings. The orbital capacity section presents the MOCAT-MC implementation, the radial range overlap gate, and representative 50-year ensemble projections. The conclusion summarizes the findings.

METHODOLOGY: DISCRETIZED COLLISION RISK ASSESSMENT

Baseline Spatial Discretization

The standard cube algorithm maps the continuous three-dimensional position vector of each object, ri=[xi,yi,zi]T\mathbf{r}_i=[x_i,y_i,z_i]^T, to a discrete bin index. For a grid cell of side length LL, the primary bin index Ii\mathbf{I}_i is computed as

Ii=⌊riL⌋(2)\mathbf{I}_i=\left\lfloor\frac{\mathbf{r}_i}{L}\right\rfloor \tag*{(2)}

where ⌊⋅⌋\lfloor\cdot\rfloor denotes the component-wise floor operation. Collision risk is evaluated only for pairs (i,j)(i,j) satisfying Ii=IjI_i = I_j. When this condition holds, PijP_{ij} is computed from Equation (1) with dU=L3dU = L^3. Otherwise, the assigned probability is exactly zero. A pair of objects that are physically proximate but separated by a grid boundary at the snapshot epoch is therefore invisible to the algorithm, regardless of their true center-to-center separation, producing the boundary-blindness failure mode described in the introduction.

The DC Architecture

The DC method recovers boundary-crossing conjunctions by superimposing a secondary grid over the primary one. The secondary grid is offset by L/2L/2 along all three Cartesian axes, so that any pair separated by a primary-grid boundary on a single axis shares a cell in the shifted grid along that axis. The shifted bin index Ii′I'_i is

Ii′=⌊ri−L/2L⌋.(3)I'_i = \left\lfloor\frac{r_i - L/2}{L} \right\rfloor. \tag*{(3)}

A pair (i,j)(i,j) is flagged for probability evaluation if it shares a cell in either grid:

(Ii=Ij)or(Ii′=Ij′).(4)(I_i = I_j) \quad\text{or} \quad(I'_i = I'_j). \tag*{(4)}

When Equation (4) is satisfied, PijP_{ij} is computed from Equation (1) using the standard cell volume dU=L3dU = L^3. Detection costs two bin-index lookups per object, computed from position vectors already available at each snapshot, with no Euclidean distance evaluation. Figure 2 illustrates this geometry for a two-dimensional cross-section of the dual-grid system.

DC, dual-grid geometry

Figure 2. DC, dual-grid geometry. The primary grid (black) and the shifted secondary grid (orange) are offset by L/2L/2. Objects B and C occupy adjacent primary cells and are missed by the cube, but share a cell in the shifted grid and are recovered. Object D satisfies both conditions of Eq. (4) simultaneously and is evaluated once.

The L/2L/2 offset places every primary-grid boundary at the center of a shifted cell, so on any single axis the two grids cannot both separate a pair closer than half a cell. This one-dimensional complementarity does not extend to three dimensions, where detection requires one grid to hold the pair on all three axes simultaneously, and the primary grid may hold two axes and fail the third exactly where the shifted grid holds the third and fails another. The residual is small and is quantified in the results section.

Adaptive Resolution Double Cube (ARDC)

The ARDC variant uses the same dual-grid detection logic as DC but adjusts the volumetric denominator dUdU in Equation (1) based on which detection condition fired. When a pair satisfies both grid conditions simultaneously, that is (Ii=Ij)(I_i = I_j) and (Ii′=Ij′)(I'_i = I'_j), the two objects are geometrically confined to the intersection of their respective primary and shifted cells. For an L/2L/2 offset, this intersection sub-volume has side length L/2L/2, giving a volume of (L/2)3=L3/8(L/2)^3 = L^3/8. The ARDC variant therefore applies a two-tier volumetric rule:

  • Tier 1 (intersection): (Ii=Ij)(I_i = I_j) and (Ii′=Ij′)(I'_i = I'_j). The pair is geometrically confined to the sub-cell of side length L/2L/2 formed by the overlap of the two grids, as illustrated by object D in Figure 2. Applied volume: dUint=(L/2)3=L3/8dU_{\mathrm{int}} = (L/2)^3 = L^3/8.

  • Tier 2 (single-grid): Exactly one of the two grid conditions holds. The pair occupies adjacent primary grid cells and is recovered by one grid alone, as illustrated by objects B and C in Figure 2. Applied volume: dUstd=L3dU_{\mathrm{std}} = L^3.

The Tier 1 volume is eight times smaller than dUstddU_{\mathrm{std}}, increasing the computed PijP_{ij} by the same factor for those pairs relative to the standard cube estimate. A sensitivity analysis with intermediate Tier 1 volumes of L3/2L^{3}/2 and L3/4L^{3}/4 showed monotonic improvement in calibration as the volume increased from L3/8L^{3}/8 to L3L^{3}, confirming that the overestimation worsens as the volumetric reduction becomes more aggressive. Volume reduction alone therefore does not calibrate the estimate, which motivates the first-principles corrections derived in the following two sections.

Mean Collision Separation (MCS) Correction

Reducing boundary blindness through DC does not, by itself, produce a calibrated probability estimate. Equation (1) applies the full cell volume dU=L3dU = L^3 to every detected pair, embedding an assumption about where within the cell the two objects lie, which is the source of the systematic overestimation.

Equation (1) is mathematically identical to the No-Time-Counter (NTC) collision algorithm of the standard DSMC94 method [25], which selects collision partners randomly within each cell and computes the collision probability using the full cell volume as the denominator. Alexander, Garcia, and Alder [26, 27] analyzed the accuracy of DSMC94 and showed that the resulting transport coefficient errors scale quadratically with cell size as (Δx/λ)2(\Delta x/\lambda)^2, establishing the theoretical basis for the overestimation mechanism. Gallis, Torczynski, Rader, and Bird [28] and Bird et al. [29] subsequently identified the Mean Collision Separation (MCS) as the physical diagnostic underlying this error: in DSMC94 with random partner selection within a cell of side LL, the expected center-to-center distance between any two collision candidates is

dˉ=0.6617L.(5)\bar{d} = 0.6617L. \tag*{(5)}

This value is the expected distance between two points drawn uniformly at random from a cube of side LL [28, 29, 30]. Any detected pair whose actual snapshot separation dijd_{ij} exceeds dˉ\bar{d} is therefore assigned too high a collision probability, since Equation (1) applies a cell volume calibrated for the mean separation regardless of the pair’s actual distance [28, 29]. This bias is present in the cube and in DC alike, since the two differ only in which pairs enter the candidate set and share Equation (1) unchanged. The power-law correction derived below addresses this bias, and the Gaussian correction section derives a second, independent correction from the geometry of the pair-distance distribution itself.

The Robbins prediction in Equation (5) is validated against simulation data using an independent diagnostic before it is used as the correction denominator. For each detected pair across all Monte Carlo seeds and snapshot intervals, the Euclidean separation dijd_{ij} is recorded at detection time, and its empirical mean is computed. This measured mean is then compared directly to 0.6617L0.6617L. The agreement between the measured and predicted values, including the physical explanation for any discrepancy arising from the Rush-In initialization geometry, is reported in the results section.

Motivated by the DSMC analysis, the normalized pair separation is defined as

η=dij0.6617 L(6)\eta= \frac{d_{ij}}{0.6617\,L} \tag*{(6)}

and the per-pair correction is applied as

Pcorr=Praw⋅min⁡(1ηk, 1).(7)P_{\mathrm{corr}} = P_{\mathrm{raw}} \cdot\min\left(\frac{1}{\eta^k},\,1\right). \tag*{(7)}

When η>1\eta> 1, the detected pair is more separated than the Robbins mean, and Equation (1) has assigned too high a probability; the factor 1/ηk1/\eta^k reduces PrawP_{\mathrm{raw}} accordingly. When η≤1\eta\le1, the pair is closer than the mean, and the min⁡(⋅,1)\min(\cdot, 1) ceiling preserves PrawP_{\mathrm{raw}} unchanged, preventing inflation of already close-approach estimates. The correction in Equation (7) requires only dijd_{ij}, derived from the same position vectors already used to evaluate VrelV_{\mathrm{rel}} in Equation (1); no additional data collection or auxiliary loops are required, and the per-pair cost remains O(1)O(1).

The exponent kk governs the rate at which the correction attenuates with increasing pair separation. The value k=2k = 2 is motivated by two complementary results from the DSMC literature. First, Alexander, Garcia, and Alder [26, 27] established that transport coefficient errors in DSMC94 NTC scale as the square of the normalized cell size, (Δx/λ)2(\Delta x/\lambda)^2, indicating that a quadratic correction is the physically appropriate form for addressing cell-size-induced overestimation. Second, Gallis et al. [28, 31] and Bird et al. [29] demonstrated through their MCS analysis that reducing the collision-partner separation below the DSMC94 value of 0.6617 L0.6617\,L produces proportional reductions in transport coefficient error, confirming that the normalized separation ratio η=dij/dˉ\eta= d_{ij}/\bar{d} is the correct diagnostic variable and that a second-order dependence on η\eta is physically grounded. The case k=1k = 1 provides the bounding linear correction. Together, the two values span the range of correction strengths, and both are selected on theoretical grounds. The results for k=1k = 1 and k=2k = 2 are presented and compared in the results section.

Gaussian Pair-Distance Correction

The power-law correction of the MCS correction section draws on the DSMC kinetic theory connection and uses two bounding exponents selected on theoretical grounds. A second, independent correction can be constructed from the geometry of the pair-distance distribution itself, using only the analytically derived parameters of that distribution. The derivation proceeds from the first and second moments of the distribution of center-to-center separations between two points drawn uniformly from a cube of side LL.

The mean separation between two such points equals the mean distance between two points drawn uniformly and independently from a unit cube, scaled by LL. This quantity is the Robbins constant for n=3n = 3 dimensions [32], Δ(3)=0.661707\Delta(3) = 0.661707. The DSMC literature expresses it as the six-dimensional integral over the unit cube [31]

μ=L∫01∫01∫01∫01∫01∫01(x1−y1)2+(x2−y2)2+(x3−y3)2 dx1 dx2 dx3 dy1 dy2 dy3.(8)\mu= L \int_0^1 \int_0^1 \int_0^1 \int_0^1 \int_0^1 \int_0^1 \sqrt{(x_1-y_1)^2 + (x_2-y_2)^2 + (x_3-y_3)^2}\, dx_1\,dx_2\,dx_3\,dy_1\,dy_2\,dy_3. \tag*{(8)}

Equation [8] is evaluated numerically in Table 1 of [31], which reports Δ(3)=0.661707\Delta(3) = 0.661707 and confirms that this value is independent of the number of simulators per cell (Table 2 of [31]). The corresponding mean pair separation in a cell of side LL is therefore [28, 29, 30]

ParameterTheoreticalEmpirical (DC)DeviationDerivation
μ=dˉ\mu= \bar{d}33.09 km32.42 km−2.0%Equation (9)
σ\sigma12.47 km12.06 km−3.3%Equation (13)

Table 1. Analytically derived and empirically measured parameters of the pair-distance distribution for the Rush-In scenario at L=50L = 50 km. Empirical values are computed from all detected pairs across 8,000 Monte Carlo seeds.

ParameterSymbolValue
Cell side lengthLL50 km
Region of interest–100×100×100100 \times100 \times100 km
Number of objects per seedNobjN_{\mathrm{obj}}200
Object speed optionsvv2.5, 7.0, 15.0 km/s
Object radius optionsRiR_i, RjR_j0.05, 0.10, 0.20 km
Total simulation timeTmax⁡T_{\max}100 s
Physics sub-stepΔtsim\Delta t_{\mathrm{sim}}0.01 s
Snapshot intervalΔtCube\Delta t_{\mathrm{Cube}}0.5 s
Snapshots per seed–200
Seeds (Cube baseline)–16,000
Seeds (DC main experiment)–8,000
Seeds (sync. experiment)–4,000

Table 2. Rush-In simulation parameters.

μ=dˉ=0.6617L.(9)\mu= \bar{d} = 0.6617L. \tag*{(9)}

This is the Robbins mean separation of Equation [5], now identified as the first moment of the pair-distance distribution under the uniform cell assumption. Figure 3a shows the empirical pair-distance distribution across all 8,000 Monte Carlo seeds alongside both the analytically derived Gaussian and a Gaussian fitted directly to the data.

Pair-distance distribution and absolute CDF deviation

Figure 3. (a) Pair-distance PDF: empirical (grey fill), analytically derived Gaussian with μ=0.6617L\mu=0.6617L, σ=0.2494L\sigma=0.2494L (solid), and fitted Gaussian (dashed). (b) Absolute CDF deviation for derived (solid) and fitted (dashed) parameters; dotted horizontal line marks the 0.02 RMSE acceptance threshold. Figure 3: Pair-distance distribution for DC-detected pairs across 8,000 Rush-In Monte Carlo seeds. The dotted vertical line in both panels marks the Robbins mean dˉ=0.6617L=33.09\bar{d}=0.6617L=33.09 km.

The second moment of the pair-distance distribution gives an exact closed-form result that requires no numerical integration [33]. By linearity of expectation and the independence of the three coordinate differences,

E[d2]=E[(x1−x2)2+(y1−y2)2+(z1−z2)2]=3E[(x1−x2)2].(10)\mathbb{E}[d^2] = \mathbb{E}\left[(x_1-x_2)^2 + (y_1-y_2)^2 + (z_1-z_2)^2\right] = 3\mathbb{E}\left[(x_1-x_2)^2\right]. \tag*{(10)}

For x1,x2∼Uniform⁡[0,L]x_1, x_2 \sim\operatorname{Uniform}[0,L], the coordinate difference Δx=x1−x2\Delta x = x_1-x_2 has zero mean and variance

Var⁡(Δx)=Var⁡(x1)+Var⁡(x2)=L212+L212=L26,(11)\operatorname{Var}(\Delta x) = \operatorname{Var}(x_1) + \operatorname{Var}(x_2) = \frac{L^2}{12} + \frac{L^2}{12} = \frac{L^2}{6}, \tag*{(11)}

so E[(Δx)2]=L2/6\mathbb{E}[(\Delta x)^2] = L^2/6. Substituting into Equation [10],

E[d2]=3×L26=L22.(12)\mathbb{E}[d^2] = 3 \times\frac{L^2}{6} = \frac{L^2}{2}. \tag*{(12)}

The standard deviation of the pair-distance distribution then follows from the variance decomposition Var⁡(d)=E[d2]−μ2\operatorname{Var}(d) = \mathbb{E}[d^2] - \mu^2:

σ=E[d2]−μ2=L22−(0.6617L)2=L12−0.66172=L0.06215≈0.2494L.(13)\sigma= \sqrt{\mathbb{E}[d^2] - \mu^2} = \sqrt{\frac{L^2}{2} - (0.6617L)^2} = L\sqrt{\frac{1}{2} - 0.6617^2} = L\sqrt{0.06215} \approx0.2494L. \tag*{(13)}

Both μ\mu and σ\sigma are derived from the geometry of the uniform cell distribution alone. No simulation data, calibration runs, or free parameters enter either expression.

With both parameters determined analytically, the cumulative distribution function (CDF) of the pair-distance for a detected pair at separation dijd_{ij} is approximated as Gaussian:

F(dij;μ,σ)=12[1+erf⁡(dij−μσ2)].(14)F(d_{ij};\mu,\sigma) = \frac{1}{2}\left[1 + \operatorname{erf}\left(\frac{d_{ij}-\mu}{\sigma\sqrt{2}}\right)\right]. \tag*{(14)}

At dij=μd_{ij}=\mu, Equation (14) evaluates to exactly F(μ)=0.5F(\mu)=0.5 by the symmetry of the Gaussian about its mean. The correction derived below is built on this property. Figure 3b quantifies this agreement: the CDF root-mean-square error of the analytically derived parameters is 0.013, against 0.007 for the fitted Gaussian.

The correction factor α(dij)∈(0,1]\alpha(d_{ij})\in(0,1] is constructed to satisfy two requirements: it must equal unity for pairs at or below the Robbins mean (no suppression for close pairs) and decrease monotonically for dij>μd_{ij}>\mu. Consider the family α=min⁡(c−F(dij;μ,σ),1)\alpha=\min(c-F(d_{ij};\mu,\sigma),1), where cc is a constant. Applying the neutrality requirement at dij=μd_{ij}=\mu gives

α(μ)=1 ⟹ c−F(μ)=1 ⟹ c=1+F(μ)=1+0.5=1.5.(15)\alpha(\mu)=1\ \Longrightarrow\ c-F(\mu)=1\ \Longrightarrow\ c=1+F(\mu)=1+0.5=1.5. \tag*{(15)}

The constant c=1.5c=1.5 is therefore not a free parameter; it is determined uniquely by the requirement that the correction is neutral at the Robbins mean. Substituting into the family gives the Gaussian pair-distance correction:

PcorrCDF=Praw⋅min⁡(1.5−F(dij;μ,σ),1).(16)P_{\mathrm{corr}}^{\mathrm{CDF}}=P_{\mathrm{raw}}\cdot\min(1.5-F(d_{ij};\mu,\sigma),1). \tag*{(16)}

For dij<μd_{ij}<\mu: F<0.5F<0.5, so 1.5−F>11.5-F>1, but the min⁡(⋅,1)\min(\cdot,1) cap holds α=1\alpha=1, and close pairs receive no suppression and no inflation. For dij=μd_{ij}=\mu: F=0.5F=0.5 exactly, so α=1.0\alpha=1.0. For dij>μd_{ij}>\mu: F>0.5F>0.5, so α<1\alpha<1, and the suppression increases monotonically with distance. Figure 4 illustrates the correction factor profiles for Equation (16) alongside the power-law correction of Equation (7) at k=1k=1 and k=2k=2, showing that the Gaussian CDF correction occupies the same correction range but with a distribution-aware shape that suppresses more gradually near μ\mu and more strongly for pairs well beyond it.

Correction factor $\alpha(d_{ij})$ for the three variants

Figure 4. Correction factor α(dij)\alpha(d_{ij}) for the three variants: power-law at k=1k = 1 (solid), power-law at k=2k = 2 (dashed), and Gaussian CDF (dash-dot).

Table 1 compares the analytically derived parameters to those measured directly from the Rush-In simulation data. The empirical mean and standard deviation are computed from the recorded dijd_{ij} values of all detected pairs across all 8,000 Monte Carlo seeds and 200 snapshot intervals. The agreement between theoretical and empirical values confirms that the uniform-cell assumption is a valid engineering approximation for the Rush-In geometry. Objects move toward targets in the interior of cells, producing slightly higher densities on the inward side, which lowers pair separations relative to the uniform-cell value and accounts for the small undershoot in both empirical parameters.

Preservation of O(N)O(N) Complexity

The DC method retains the linear scaling of the original cube algorithm. Computing IiI_i and Ii′I'_i for each object requires only scalar division and a floor operation, each O(1)O(1) per object, so assigning all NN objects to their respective bins scales as O(N)O(N). For a fixed cell size LL, the mean number of objects per cell is small and independent of NN, so the total number of evaluated pairs grows linearly with the population size. Adding a second grid introduces a constant factor of two in the number of bin assignments, which does not alter the asymptotic complexity class. Detection, evaluation, and correction therefore all remain O(N)O(N).

Calibration Metrics

The calibration of each method is assessed using a pairwise reliability diagram. All detected pairs across all Monte Carlo seeds and snapshot intervals are grouped into logarithmically spaced bins by their predicted probability PijP_{ij}. For each bin bb containing nbn_b pairs, the mean predicted probability is

P‾b=1nb∑(i,j)∈bPij,(17)\overline{P}_b = \frac{1}{n_b} \sum_{(i,j)\in b} P_{ij}, \tag*{(17)}

and the empirical collision frequency is

fb=1nb∑(i,j)∈bAij,(18)f_b = \frac{1}{n_b} \sum_{(i,j)\in b} A_{ij}, \tag*{(18)}

where Aij∈{0,1}A_{ij} \in\{0,1\} is the ground-truth binary collision flag for pair (i,j)(i,j) at the corresponding snapshot interval. A perfectly calibrated method satisfies fb=P‾bf_b = \overline{P}_b for all bins, corresponding to the equality line f=P‾f = \overline{P} on the reliability diagram (Figure 6). The Expected Calibration Error (ECE) aggregates the bin-level deviation into a single scalar:

Pairwise reliability diagram for all five evaluated methods

Figure 6. Pairwise reliability diagram for all five evaluated methods.

ECE=∑bnbNpairs∣fb−P‾b∣,(19)\mathrm{ECE} = \sum_b \frac{n_b}{N_{\mathrm{pairs}}} \left| f_b - \overline{P}_b \right|, \tag*{(19)}

where Npairs=∑bnbN_{\mathrm{pairs}} = \sum_b n_b is the total number of evaluated pairs across all bins.

Because predicted probabilities span approximately two orders of magnitude and calibration errors in this setting are multiplicative rather than additive, the calibration slope is estimated by log-log linear regression

log⁡10(P‾b)=m⋅log⁡10(fb)+log⁡10(A),(20)\log_{10}(\overline{P}_b) = m \cdot\log_{10}(f_b) + \log_{10}(A), \tag*{(20)}

where the slope mm and intercept AA are the two regression outputs, with AA representing the multiplicative offset in linear scale. The slope mm characterizes the probability-dependence of the bias: m=1m = 1 indicates that the ratio P‾b/fb\overline{P}_b/f_b is constant across all probability bins, while m>1m > 1 indicates that the overestimation grows with predicted probability magnitude. The intercept AA measures the level of that bias, so that joint calibration requires both m=1m = 1 and A=1A = 1.1 The coefficient of determination R2R^2 of the log-log fit is reported as a check on the regression model rather than as a performance measure, since mm and AA carry no meaning unless the logarithmic relationship is linear. Because pairs assigned Pij=0P_{ij} = 0 cannot enter the log-log regression (log⁡10(0)\log_{10}(0) is undefined), the slope and intercept reflect only non-blind detections; for the cube method, the regression characterizes co-cell pairs exclusively, and boundary-crossing blind pairs are absent from the fit entirely.

The boundary blindness rate β\beta quantifies the fraction of ground-truth collision events for which the algorithm assigns exactly zero predicted risk:

β=∑i,j[Aij=1∧Pij=0]∑i,j[Aij=1].(21)\beta= \frac{\sum_{i,j}[A_{ij}=1 \land P_{ij}=0]}{\sum_{i,j}[A_{ij}=1]}. \tag*{(21)}

A probability computed at snapshot tkt_k describes an interval, and that choice affects every metric above. Forward alignment scores Pij(tk)P_{ij}(t_k) against events in (tk,tk+1](t_k,t_{k+1}], the interval the probability describes, whereas backward alignment scores it against (tk−1,tk](t_{k-1},t_k], a window the prediction never described. Forward alignment also reads the encounter geometry before the event rather than from a snapshot taken after it has resolved; it matches the no-time-counter convention from which Equation (1) derives, and it is the convention used by MOCAT-MC. It is adopted throughout this paper.

SIMULATION ENVIRONMENT

The Rush-In Scenario

The Rush-In scenario is a synthetic convergence benchmark designed to evaluate collision detection performance under controlled geometric conditions. A population of 200 point-mass objects is initialized with positions drawn uniformly at random from a 200×200×200200 \times200 \times200 km outer domain, with the constraint that each initial position lies outside the 100×100×100100 \times100 \times100 km region of interest (ROI) spanning [50,150][50, 150] km in each Cartesian dimension. Each object is assigned a velocity directed toward a randomly chosen target point inside the ROI, so that all objects converge through the central volume within the simulation window. Object speeds are drawn independently and uniformly from the set {2.5,7.0,15.0}\{2.5, 7.0, 15.0\} km/s and object radii from {0.05,0.10,0.20}\{0.05, 0.10, 0.20\} km, making the population heterogeneous in both size and relative speed. A 5% Gaussian noise term is added to each speed magnitude to break exact synchronization of arrivals. Figure 5 illustrates the geometry for a representative subset of the population.

Rush-In scenario geometry and convergence snapshot

Figure 5. (a) Initial configuration: objects distributed uniformly outside the ROI with inward-directed velocity vectors (gray arrows). (b) 50×5050 \times50 km primary cube grid overlaid. (c) Primary cube grid (solid) and DC shifted grid (dashed) overlaid inside the ROI. Rush-In scenario geometry (Nobj=200N_{\mathrm{obj}} = 200, L=50L = 50 km) and convergence snapshot at t=8t = 8 s

The scenario satisfies the two requirements of a calibration benchmark. First, the isotropic uniform initialization is consistent with the kinetic gas assumption underlying Equation (1), so the Robbins mean prediction of Equation (5) can be verified directly against the measured mean pair separation without model mismatch. Second, the controlled-convergence geometry ensures that the encounter event set is dense and reproducible across seeds, yielding both co-cell and boundary-crossing pair detections throughout the simulation window.

Physics Engine and Ground Truth

Each snapshot interval of ΔtCube=0.5\Delta t_{\mathrm{Cube}} = 0.5 s is subdivided into 50 physics sub-steps of Δtsim=0.01\Delta t_{\mathrm{sim}} = 0.01 s each. The grid snapshot is taken at the start of the interval, and the cube and DC assign predicted probabilities to all detected pairs using the positions at that epoch. The 50 sub-steps then follow: objects are propagated deterministically, and any pair (i,j)(i,j) whose center-to-center distance falls at or below the combined hard-body radius Ri+RjR_i + R_j is recorded as a physical collision via an elastic momentum-conserving model. The binary ground-truth label

Aij={1if pair (i,j) collides during the sub-steps following the snapshot,0otherwise,(22)A_{ij} = \begin{cases} 1 & \text{if pair }(i,j)\text{ collides during the sub-steps following the snapshot,}\\ 0 & \text{otherwise,} \end{cases} \tag*{(22)}

is recorded for every pair evaluated at the snapshot, provided both objects lie within the ROI. Because the physics engine operates at the sub-step level and is independent of the grid partitioning, AijA_{ij} provides an unbiased reference for all calibration metrics defined in the calibration metrics section. At the Rush-In velocity scale, the mean cell traversal time Δttrav=L/Vrel\Delta t_{\mathrm{trav}} = L/V_{\mathrm{rel}} ranges from 3 to 20 s, so the condition ΔtCube≪Δttrav\Delta t_{\mathrm{Cube}} \ll\Delta t_{\mathrm{trav}} holds throughout and objects move little relative to the cell between consecutive snapshots.

Monte Carlo Protocol

Each seed draws a fresh set of initial object positions from the uniform outer-domain distribution and runs the full 200-snapshot simulation. All detected pairs across snapshots and seeds are accumulated into the reliability diagram bins described in the calibration metrics section. Two experiments are conducted. The main experiment uses 8,000 seeds for DC and 16,000 for the cube baseline and reports all blindness rates, calibration slopes, and correction results. A second experiment sets ΔtCube=Δtsim=0.01\Delta t_{\mathrm{Cube}} = \Delta t_{\mathrm{sim}} = 0.01 s so that every physical collision coincides with a snapshot epoch, which removes the temporal source of blindness and isolates the residual to geometric gaps in the detection architecture. Table 2 summarizes all simulation parameters.

RESULTS

Boundary Blindness

At L=50L = 50 km, the cube assigns zero probability to 7.09% of ground-truth collisions, compared with 0.55% for DC. Setting ΔtCube=Δtsim=0.01\Delta t_{\mathrm{Cube}} = \Delta t_{\mathrm{sim}} = 0.01 s ensures that every collision occurs at a snapshot epoch, so any event the grids then miss is missed for geometric reasons alone. Under that setting, the cube misses 0.80% of events and DC fewer than 0.01%. This decomposes the cube’s operational rate into 6.29 percentage points of temporal blindness and 0.80 points of spatial blindness, and shows that DC’s residual is almost entirely temporal. Table 3 summarizes the rates for both experiments.

MethodΔtcube\Delta t_{\mathrm{cube}} [s]β\beta
Cube0.507.09%
DC0.500.55%
Cube (synchronized)0.010.80%
DC (synchronized)0.01<0.01%< 0.01\%

Table 3. Boundary blindness rates under forward alignment at L=50L = 50 km (Δtsim=0.01\Delta t_{\mathrm{sim}} = 0.01 s). The synchronized experiment sets Δtcube=Δtsim=0.01\Delta t_{\mathrm{cube}} = \Delta t_{\mathrm{sim}} = 0.01 s to isolate geometric from temporal blindness.

Mean Collision Separation Validation

The Robbins prediction of Equation (5) is validated by computing the empirical mean of dijd_{ij} across all DC-detected pairs from all 8,000 seeds and 200 snapshot intervals. The measured mean is 32.42 km against the predicted dˉ=0.6617×50=33.09\bar{d} = 0.6617 \times50 = 33.09 km, a deviation of −2.0%-2.0\%, and the measured standard deviation is 12.06 km against the predicted 12.47 km, a deviation of −3.3%-3.3\%. Objects move toward targets in the cell interior, producing slightly higher densities on the inward side, which lowers pair separations relative to the uniform-cell value. The agreement confirms that dˉ=0.6617L\bar{d} = 0.6617L and σ=0.2494L\sigma= 0.2494L are valid reference parameters for this geometry.

Calibration and Correction Results

Figure 6 shows the pairwise reliability diagram for all five evaluated methods, and Table 4 reports the corresponding regression statistics from Equation (20) and calibration metrics. A slope m>1m > 1 indicates that the overestimation grows with predicted probability magnitude; m<1m < 1 indicates that the correction has been applied too aggressively, driving predictions below the calibration target; and joint m=1m = 1, A=1A = 1 indicates full calibration in both proportionality and absolute level.

MethodmmAAR2R^2∣1−m∣\lvert1 - m\rvert [%]ECE [×10−7\times10^{-7}]
Cube1.13144.8390.984713.1% over6.21
DC (raw)1.09964.6330.986410.0% over16.45
DC + k=1k = 10.99731.2110.99010.3% under10.66
DC + k=2k = 20.94290.5950.99035.7% under7.73
DC + Gaussian CDF0.98060.9750.99011.9% under9.72

Table 4. Log-log reliability diagram regression statistics from Equation (20) and calibration metrics for each method under forward alignment at L=50L = 50 km.

Both uncorrected methods are substantially miscalibrated: the cube at m=1.1314m = 1.1314 and A=4.839A = 4.839 and the uncorrected DC at m=1.0996m = 1.0996 and A=4.633A = 4.633. Neither intercept can be read as a bias factor at these slopes, so no ordering is claimed between the two. The pair demonstrates that recovering boundary-crossing pairs does not by itself improve calibration, since Equation (4) changes which pairs are evaluated and leaves Equation (1) untouched. The power-law correction at k=1k = 1 gives the closest slope at 0.9973 but retains an intercept of 1.211, while k=2k = 2 carries both further at 0.9429 and 0.595, consistent with the quadratic bound on the no-time-counter bias established by Alexander et al. [26, 27]. The Gaussian CDF correction of Equation (16), derived from the pair-distance geometry without reference to kinetic theory or to any quantity estimated from the data, falls between the two exponents on both metrics at m=0.9806m = 0.9806 and A=0.975A = 0.975.

Judged jointly on mm and AA, the Gaussian CDF correction is the only configuration within 3% of unity on both, and no other configuration is within 20% on both. The power-law correction at k=1k = 1 achieves the better slope in isolation but retains a 21% intercept error, which is why the two metrics must be read together rather than ranked separately.

Equation (19) weights bins by occupancy and measures absolute deviation, which rewards suppression of the low-probability bins that hold most of the pairs. The cube therefore records the lowest value while assigning zero probability to 7.09% of true events, and DC raw records the highest while evaluating the most pairs. ECE is reported as a complementary measure of average absolute deviation in linear space, and the slope and intercept remain the primary calibration metrics.

APPLICATION TO ORBITAL CAPACITY

The pairwise reliability diagram is validated against a deterministic physics engine in the controlled Rush-In geometry, characterizing per-pair calibration under isotropic conditions, but does not establish whether the corrections recover agreement with the absolute collision rate observed under realistic orbital propagation. Facchinetti [34] compared the standard cube method against a deterministic propagation benchmark and found that it does not reproduce the reference collision rate. The journal version of this work addresses whether the corrections derived here recover agreement with an absolute deterministic benchmark in the orbital debris environment.

In the MOCAT-MC 50-year ensemble, the DC method evaluates 541,006 conjunctions per seed against 180,237 for the cube, and the resulting collision rate rises from 23.88 to 55.14 events per seed. The excess arises because the L/2L/2-shifted secondary grid places objects from adjacent altitude shells in the same shifted cell even when their orbital altitude ranges are fully disjoint. Kessler [1, 35] showed that the spatial density of an orbiting object is zero outside the interval [rp,ra][r_p, r_a], where rp=a(1−e)r_p = a(1-e) and ra=a(1+e)r_a = a(1+e) are the perigee and apogee radii; it follows from his integral collision rate that two objects whose altitude bands do not overlap have exactly zero collision rate regardless of their instantaneous separation dijd_{ij}. A radial range overlap gate enforces this condition by computing the band gap dgap=max⁡(0,max⁡(rp,i,rp,j)−min⁡(ra,i,ra,j))d_{\mathrm{gap}} = \max(0,\max(r_{p,i}, r_{p,j}) - \min(r_{a,i}, r_{a,j})) and setting αRO=1\alpha_{\mathrm{RO}} = 1 when dgap≤Ri+Rjd_{\mathrm{gap}} \le R_i + R_j and αRO=0\alpha_{\mathrm{RO}} = 0 otherwise, using only the semi-major axis aa and eccentricity ee already carried in the MOCAT-MC state vector at O(1)O(1) cost per pair. This gate has been implemented in two additional configurations: one applies it to DC raw detections without any per-pair correction, and the other combines it with the Gaussian CDF correction in Equation (16).

The DC method, both per-pair corrections and the radial-range overlap gate, has been implemented in MOCAT-MC and applied to 50-year ensemble simulations at 4,000 Monte Carlo seeds per configuration. Figure 7 shows representative projections for the cube baseline, DC raw, DC + Gate, DC + k=1k = 1, DC + Gaussian CDF, and DC + Gate + Gaussian CDF. The projected population falls in that order, so the gate alone suppresses less than either per-pair correction, and the two act together in the gated Gaussian configuration, which lands the lowest of the five DC variants.

Representative 50-year MOCAT-MC projections for six correction configurations

Figure 7. Representative 50-year MOCAT-MC projections for six correction configurations (4,000 seeds each, L=50L = 50 km).

CONCLUSION

This paper introduced the Double Cube (DC) method, which recovers boundary-crossing conjunctions through a spatially shifted secondary grid using bin-index lookup alone, preserving O(N)O(N) complexity. Validated against a deterministic physics engine in an isotropic Rush-In convergence scenario at L=50L = 50 km, DC reduces the blindness rate from βCube=7.09%\beta_{\mathrm{Cube}} = 7.09\% to βDC=0.55%\beta_{\mathrm{DC}} = 0.55\%, and a synchronized experiment with ΔtCube=Δtsim\Delta t_{\mathrm{Cube}} = \Delta t_{\mathrm{sim}} leaves the cube at 0.80% and DC below 0.01%, showing that DC’s residual is almost entirely temporal in origin.

Recovering those pairs does not improve calibration on its own, because the detection rule and the probability formula fail independently. Both uncorrected methods remain miscalibrated, at m=1.1314m = 1.1314 for the cube and m=1.0996m = 1.0996 for DC. The power-law correction moves the slope to 0.9973 at k=1k = 1 and 0.9429 at k=2k = 2, and the Gaussian CDF correction, derived entirely from the mean dˉ=0.6617L\bar{d} = 0.6617L and standard deviation σ=0.2494L\sigma= 0.2494L of the pair-distance distribution under the uniform cell assumption, reaches m=0.9806m = 0.9806 with an intercept of 0.975 and is the only configuration within 3% of unity on both. Neither moment is fitted to simulation data.

Representative 50-year ensemble projections and the radial range overlap gate implementation are presented in the preceding section. The closed-form detection volume of the dual grid, the population-level comparison against a deterministic twenty-year cascade propagation of the low Earth orbit catalog, and the limits of calibration evidence generated inside a Bernoulli-sampled model are treated in the journal version of this work.

References

  1. [1]D. J. Kessler and B. G. Cour-Palais, “Collision Frequency of Artificial Satellites: The Creation of a Debris Belt,” Journal of Geophysical Research: Space Physics, Vol. 83, No. A6, 1978, pp. 2637–2646. https://doi.org/10.1029/JA083iA06p02637.
  2. [2]D. J. Kessler, N. L. Johnson, J.-C. Liou, and M. Matney, “The Kessler Syndrome: Implications to Future Space Operations,” Advances in the Astronautical Sciences, Proceedings of the 33rd Annual AAS Rocky Mountain Guidance and Control Conference, Vol. 137, San Diego, CA, American Astronautical Society, United Inc., 2010, pp. 47–62. Paper AAS 10-016 https://api.semanticscholar.org/CorpusID:18864631.
  3. [3]European Space Agency, “ESA’s Annual Space Environment Report, 2025 Edition,” tech. rep., ESA Space Debris Office, European Space Operations Centre (ESOC), 2025. https://www.sdo.esa.int/environment_report/Space_Environment_Report_latest.pdf.
  4. [4]J. C. McDowell, “Jonathan’s Space Report,” Jonathan’s Space Report, 2024. https://planet4589.org/space/con/starstats.html.
  5. [5]Federal Communications Commission, “FCC Partially Grants SpaceX Gen2 Broadband Satellite Application,” Public Notice, FCC, 2022. https://www.fcc.gov/document/fcc-partially-grants-spacex-gen2-broadband-satellite-application.
  6. [6]J.-C. Liou, “An Active Debris Removal Parametric Study for LEO Environment Remediation,” Advances in Space Research, Vol. 47, No. 11, 2011, pp. 1865–1876. https://doi.org/10.1016/j.asr.2011.02.003.
  7. [7]S. Servadio, N. Simha, D. Gusmini, D. Jang, T. St. Francis, A. D’Ambrosio, G. Lavezzi, and R. Linares, “Risk Index for the Optimal Ranking of Active Debris Removal Targets,” Journal of Spacecraft and Rockets, Vol. 61, No. 2, 2024, pp. 407–420. https://arc.aiaa.org/doi/10.2514/1.A35752.DOI
  8. [8]D. Jang, D. Gusmini, P. M. Siew, A. D’Ambrosio, S. Servadio, P. Machuca, and R. Linares, “New Monte Carlo Model for the Space Environment,” Journal of Spacecraft and Rockets, Vol. 62, No. 4, 2025, pp. 1346–1367. https://arc.aiaa.org/doi/10.2514/1.A36137.DOI
  9. [9]MIT ARC Lab, “MIT Monte Carlo Orbital Capacity Assessment Tool (MOCAT-MC),” GitHub Repository, 2024. https://github.com/ARCLab-MIT/MOCAT-MC.
  10. [10]J.-C. Liou, D. T. Hall, P. H. Krisko, and J. N. Opiela, “LEGEND– A Three-Dimensional LEO-to-GEO Debris Evolutionary Model,” Advances in Space Research, Vol. 34, No. 5, 2004, pp. 981–986. https://doi.org/10.1016/j.asr.2003.02.027.
  11. [11]H. G. Lewis, G. G. Swinerd, R. J. Newland, and A. Saunders, “Active Removal Study for On-Orbit Debris Using DAMAGE,” Proceedings of the 5th European Conference on Space Debris (H. Lacoste, ed.), ESA SP-672, Darmstadt, Germany, European Space Agency, ESA, 2009. https://conference.sdo.esoc.esa.int/proceedings/sdc5/paper/120/SDC5-paper120.pdf.
  12. [12]H. G. Lewis, G. Swinerd, N. Williams, and G. Gittins, “DAMAGE: A Dedicated GEO Debris Model Framework,” Proceedings of the 3rd European Conference on Space Debris, ESA SP-473, Darmstadt, Germany, European Space Agency, ESA, 2001. https://conference.sdo.esoc.esa.int/proceedings/sdc3/paper/67/SDC3-paper27.pdf.
  13. [13]N. Simha, S. Servadio, M. Lifson, G. Lavezzi, and R. Linares, “Optimal Active Debris Removal mission planning to inform policy decisions,” Acta Astronautica, Vol. 228, 2025, pp. 224–236. https://doi.org/10.1016/j.actaastro.2024.11.050.
  14. [14]Y. B. Medhin and S. Servadio, “Development and Validation of an Enhanced Risk-Driven Index for Active Debris Removal Prioritization,” Journal of Spacecraft and Rockets, June 2026. https://doi.org/10.2514/1.A36649.
  15. [15]Y. B. Medhin and S. Servadio, “The Sustainability of the Leo Orbit Capacity via Risk-Driven Active Debris Removal,” arXiv preprint arXiv:2507.16101, July 2025. https://arxiv.org/abs/2507.16101.
  16. [16]A. Lue, “The All-Versus-All Low Earth Orbit Conjunction Problem,” Proceedings of the Advanced Maui Optical and Space Surveillance Technologies Conference (AMOS), Maui, HI, Maui Economic Development Board, 2011, p. 260. https://amostech.com/TechnicalPapers/2011/Astrodynamics/LUE.pdf.DOI
  17. [17]E. R. George, “A High Performance Conjunction Analysis Technique for Cluster and Multi-Core Computers,” Proceedings of the Advanced Maui Optical and Space Surveillance Technologies Conference (AMOS), Maui, HI, Maui Economic Development Board, 2011, p. 270. https://ui.adsabs.harvard.edu/abs/2011amos.conf..306G/abstract.DOI
  18. [18]J.-C. Liou, D. J. Kessler, M. Matney, and G. Stansbery, “A New Approach to Evaluate Collision Probabilities Among Asteroids, Comets, and Kuiper Belt Objects,” Proceedings of the 34th Lunar and Planetary Science Conference, Vol. 34, Houston, TX, Lunar and Planetary Institute, 2003, p. 1828. https://ui.adsabs.harvard.edu/abs/2003LPI....34.1828L.
  19. [19]J.-C. Liou, “Collision Activities in the Future Orbital Debris Environment,” Advances in Space Research, Vol. 38, No. 9, 2006, pp. 2102–2106. https://doi.org/10.1016/j.asr.2005.06.021.
  20. [20]H. G. Lewis, S. Diserens, T. Maclay, and J. P. Sheehan, “Limitations of the CUBE Method for Assessing Large Constellations,” Proceedings of the 1st International Orbital Debris Conference, Houston, TX, Universities Space Research Association, 2019. https://ui.adsabs.harvard.edu/abs/2019LPICo2109.6104L/abstract.
  21. [21]S. Diserens, H. G. Lewis, and J. Fliege, “Assessing Collision Algorithms for the NewSpace Era,” Journal of Space Safety Engineering, Vol. 7, No. 3, 2020, pp. 274–281. https://doi.org/10.1016/j.jsse.2020.07.021.
  22. [22]J. R. Alarcón-Rodríguez, F. Martínez Fadrique, and H. Klinkrad, “Collision Risk Assessment with a ”Smart Sieve” Method,” Proceedings of the Joint ESA–NASA Space-Flight Safety Conference, Vol. 486 of ESA SP-486, ESA/ESOC, Darmstadt, Germany, European Space Agency, 2002, pp. 159–164. https://ui.adsabs.harvard.edu/abs/2002ESASP.486..159A/abstract.
  23. [23]X.-w. Wang and J. Liu, “An Introduction to a New Space Debris Evolution Model: SOLEM,” Advances in Astronomy, Vol. 2019, 2019, p. 2738276. https://doi.org/10.1155/2019/2738276.
  24. [24]X.-W. Wang, J. Liu, and S.-X. Cui, “A Collision Probability Estimation Algorithm Used in the Space Debris Evolutionary Model,” arXiv preprint, 2019. https://arxiv.org/abs/1903.12335.
  25. [25]G. A. Bird, Molecular Gas Dynamics and the Direct Simulation of Gas Flows. Oxford, UK: Oxford University Press, 1994. https://doi.org/10.1093/oso/9780198561958.001.0001.
  26. [26]F. J. Alexander, A. L. Garcia, and B. J. Alder, “Cell Size Dependence of Transport Coefficients in Stochastic Particle Algorithms,” Physics of Fluids, Vol. 10, No. 6, 1998, pp. 1540–1542. https://doi.org/10.1063/1.869674.
  27. [27]F. J. Alexander, A. L. Garcia, and B. J. Alder, “Erratum: ”Cell Size Dependence of Transport Coefficients in Stochastic Particle Algorithms”,” Physics of Fluids, Vol. 12, No. 3, 2000, p. 731. https://doi.org/10.1063/1.870278.
  28. [28]M. A. Gallis, J. R. Torczynski, D. J. Rader, and G. A. Bird, “Convergence Behavior of a New DSMC Algorithm,” Journal of Computational Physics, Vol. 228, No. 12, 2009, pp. 4532–4548. https://doi.org/10.1016/j.jcp.2009.03.021.
  29. [29]G. A. Bird, M. A. Gallis, J. R. Torczynski, and D. J. Rader, “Accuracy and Efficiency of the Sophisticated Direct Simulation Monte Carlo Algorithm for Simulating Noncontinuum Gas Flows,” Physics of Fluids, Vol. 21, No. 1, 2009, p. 017103. https://doi.org/10.1063/1.3067865.
  30. [30]M. A. Gallis and J. R. Torczynski, “Effect of Collision-Partner Selection Schemes on the Accuracy and Efficiency of the Direct Simulation Monte Carlo Method,” International Journal for Numerical Methods in Fluids, Vol. 67, No. 8, 2011, pp. 1057–1072. https://doi.org/10.1002/fld.2409.
  31. [31]M. A. Gallis, J. R. Torczynski, D. J. Rader, and G. A. Bird, “Accuracy and Convergence of a New DSMC Algorithm,” 40th Thermophysics Conference, Seattle, Washington, American Institute of Aeronautics and Astronautics, June 2008. AIAA Paper 2008-3913. https://doi.org/10.2514/6.2008-3913.
  32. [32]D. P. Robbins and T. S. Bolis, “Average Distance between Two Points in a Box (Solution to Elementary Problem E2629),” American Mathematical Monthly, Vol. 85, No. 4, 1978, pp. 277–278. https://www.jstor.org/stable/2321177.
  33. [33]S. Servadio and R. Zanetti, “Recursive polynomial minimum mean-square error estimation with applications to orbit determination,” Journal of Guidance, Control, and Dynamics, Vol. 43, No. 5, 2020, pp. 939–954. https://doi.org/10.2514/1.G004544.
  34. [34]G. Facchinetti, “Analysis and Validation of the CUBE Algorithm: Assessing Gas Kinetic Theory to Model Collision Risk in Long-Term Debris Propagations,” Master’s thesis, Politecnico di Milano, 2024. https://www.researchgate.net/publication/382464290.DOI
  35. [35]D. J. Kessler, “Derivation of the Collision Probability between Orbiting Objects: The Lifetimes of Jupiter’s Outer Moons,” Icarus, Vol. 48, No. 1, 1981, pp. 39–48. https://doi.org/10.1016/0019-1035(81)90151-2.

Paper details

vlnc:W_yek2mccf
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents