Fast and Accurate Computation of Orbital Collision Probability for Short-Term Encounters

Romain Serra, Denis Arzelier, Mioara Joldeş, Jean B. Lasserre, Aude Rondepierre, Bruno SalvyJournal of Guidance Control and Dynamics 2016 · DOI

TL;DR

This paper introduces a novel analytical method for calculating the probability of collision between orbiting space objects during short-term encounters. By leveraging Laplace transforms and D-finite functions, they derive an exact formula that is both fast and highly accurate, outperforming existing methods and offering guaranteed error bounds for practical risk assessment.

What Problem Does This Paper Address?

Space debris is a growing concern, making accurate collision probability assessment crucial for on-orbit safety. For short-term encounters, where relative velocities are high (common in Low Earth Orbit), the problem is typically simplified by assuming spherical objects and Gaussian uncertainty in their positions. This reduces the collision probability calculation to integrating a 2D Gaussian probability density function over a disk. However, computing this integral analytically and accurately has been a significant challenge. Existing methods either rely on approximations, are computationally expensive (like Monte Carlo simulations), or struggle with very low probabilities. This paper aims to provide a robust, exact, and efficient analytical solution.

Methods

The core of this paper is a new analytical formula for collision probability. The authors derive this formula by:

  • Laplace Transform and D-finite Functions: They reformulate the 2D integral as a function whose Laplace transform can be computed in closed-form. This involves using properties of D-finite functions (solutions to linear ODEs with polynomial coefficients).
  • Power Series Expansion: The Laplace transform is then expanded into a Laurent series, and term-by-term inverse Laplace transforms yield a convergent power series for the collision probability. A key innovation is finding a simple linear recurrence relation for the coefficients of this series, making it numerically stable.
  • Preconditioning: To avoid numerical cancellation issues when evaluating the power series, a preconditioning technique is applied, transforming the problem into one with better numerical properties.
  • Analytic Error Bounds: Crucially, the authors derive analytical bounds for the truncation error of the power series. This allows for a priori determination of the number of terms needed for a desired accuracy, guaranteeing the precision of the computed probability.

Datasets

Not discussed in the paper. The paper uses synthetic test cases derived from existing literature (Chan, Alfano) and real-world data (CSMs) for evaluation.

Key Insights and Ideas

  • Exact Analytical Formula: Unlike previous analytical methods that relied on approximations, this work provides an exact formula for the collision probability under the short-term encounter model.
  • D-finite Functions as a Powerful Tool: The application of D-finite function theory and Laplace transforms proves highly effective for solving this complex integration problem.
  • Numerical Stability through Recurrence Relations: Deriving a linear recurrence for the power series coefficients is a significant contribution, ensuring that the method is not only accurate but also numerically stable for computation.
  • Guaranteed Accuracy: The ability to provide analytical bounds on the truncation error is a major advantage, allowing users to specify a desired accuracy and have confidence in the computed result.
  • Chan's Method as a Special Case: The paper demonstrates that a previously established analytical method (Chan's) is a specific instance of their more general formula.

Key Results

  • High Accuracy: The proposed method achieves very high accuracy, often matching or exceeding the precision of reference values. For many test cases, the results are identical to the reference values.
  • Computational Efficiency: The method is very fast, with results obtained in less than a second. In cases where simple bounds suffice, the response is almost instantaneous.
  • Guaranteed Error Bounds: Algorithm 2, which incorporates the error bounds, allows for a priori computation of the number of terms needed for a specified accuracy (e.g., 10⁻¹³).
  • Robustness: While generally efficient, the paper notes that for some "degenerate" cases (like Alfano's test cases), the number of terms required can increase significantly, though the method still provides accurate results.

Limitations and Future Work

  • Degenerate Cases: The paper acknowledges that for certain "degenerate" cases, the number of terms required in the series expansion can become very high.
  • Future Work: The authors plan to investigate these high-term-count cases further using saddle-point based methods. They also suggest a parameter sensitivity analysis, similar to Chan's work, to explore how input variations affect the collision probability, expecting to achieve similar results but with better accuracy.

Summary updated

Abstract

This article provides a new method for computing the probability of collision between two spherical space objects involved in a short-term encounter under Gaussian-distributed uncertainty. In this model of conjunction, classical assumptions reduce the probability of collision to the integral of a two-dimensional Gaussian probability density function over a disk. The computational method presented here is based on an analytic expression for the integral, derived by use of Laplace transform and D-finite functions properties. The formula has the form of a product between an exponential term and a convergent power series with positive coefficients. Analytic bounds on the truncation error are also derived and are used to obtain a very accurate algorithm. Another contribution is the derivation of analytic bounds on the probability of collision itself, allowing for a very fast and, in most cases, very precise evaluation of the risk. The only other analytical method of the literature (based on an approximation) is shown to be a special case of the new formula. A numerical study illustrates the efficiency of the proposed algorithms on a broad variety of examples and favorably compares the approach to the other methods of the literature.
BibTeX
@article{serra2016fast,
  author = {Romain Serra and Denis Arzelier and Mioara Joldeş and Jean B. Lasserre and Aude Rondepierre and Bruno Salvy},
  title = {{Fast and Accurate Computation of Orbital Collision Probability for Short-Term Encounters}},
  journal = {Journal of Guidance Control and Dynamics},
  year = {2016},
  doi = {10.2514/1.g001353},
}
Figure