Engineering Papers⌕ Search

Engineering topics

Baars, Luis

Publications and source records attributed to Baars, Luis.

Assessing GEO and LEO Repeating Conjunctions Using High Fidelity Brute Force Monte Carlo Simulations

Probability of collision (P(sub c)) estimates for Earth-orbiting satellites typically assume a temporally-isolated conjunction event. However, under certain conditions two objects may experience multiple high-risk close approach events over the course of hours or days. In these repeating conjunction cases, the P(sub c) accumulates as each successive encounter occurs. The NASA Conjunction Assessment Risk Analysis team has updated its “brute force Monte Carlo” (BFMC) software to estimate such accumulating P(sub c) values for repeating conjunctions. This study describes the updated BFMC algorithm and discusses the implications for conjunction risk assessment.

Baars, Luis↗

Assessing Geo and Leo Repeating Conjunctions Using High Fidelity Brute Force Monte Carlo Simulations

Probability of collision (P(sub c)) estimates for Earth-orbiting satellites typically assume a temporally-isolated conjunction event. However, under certain conditions two objects may experience multiple high-risk close approach events over the course of hours or days. In these repeating conjunction cases, the P(sub c) accumulates as each successive encounter occurs. The NASA Conjunction Assessment Risk Analysis team has updated its “brute force Monte Carlo” (BFMC) software to estimate such accumulating P(sub c) values for repeating conjunctions. This study describes the updated BFMC algorithm and discusses the implications for conjunction risk assessment.

Baars, Luis↗

Quantifying Shortcomings in the 2-D Pc Calculation

The probability of collision, Pc, between two Earth-orbiting satellites can often, but not always, be approximated adequately using the "2D-Pc" formulation. The objective is to find a set of "boundary conditions" that ensure the 2D-Pc approximation be sufficiently accurate, so that it may be determined when computationally-intensive Brute Force Monte Carlo1 (BFMC) Pc estimates are required. We critically examine the assumptions used in the formulation of the 2D-Pc approximation and then formulate 2D-Pc boundary condition tests to check if these assumptions are satisfied adequately.

Analysis↗