Statistical Learning of Conjunction Data Messages Through a Bayesian Non-Homogeneous Poisson Process

• URL: http://arxiv.org/abs/2311.05426v2
• Date: Wed, 15 Nov 2023 22:13:06 GMT
• Title: Statistical Learning of Conjunction Data Messages Through a Bayesian Non-Homogeneous Poisson Process
• Authors: Marta Guimar\~aes, Cl\'audia Soares, Chiara Manfletti
• Abstract summary: Current approaches for collision avoidance and space traffic management face many challenges. Satellite owners/operators must be aware of their assets' collision risk to decide whether a collision avoidance manoeuvre needs to be performed.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Current approaches for collision avoidance and space traffic management face many challenges, mainly due to the continuous increase in the number of objects in orbit and the lack of scalable and automated solutions. To avoid catastrophic incidents, satellite owners/operators must be aware of their assets' collision risk to decide whether a collision avoidance manoeuvre needs to be performed. This process is typically executed through the use of warnings issued in the form of CDMs which contain information about the event, such as the expected TCA and the probability of collision. Our previous work presented a statistical learning model that allowed us to answer two important questions: (1) Will any new conjunctions be issued in the next specified time interval? (2) When and with what uncertainty will the next CDM arrive? However, the model was based on an empirical Bayes homogeneous Poisson process, which assumes that the arrival rates of CDMs are constant over time. In fact, the rate at which the CDMs are issued depends on the behaviour of the objects as well as on the screening process performed by third parties. Thus, in this work, we extend the previous study and propose a Bayesian non-homogeneous Poisson process implemented with high precision using a Probabilistic Programming Language to fully describe the underlying phenomena. We compare the proposed solution with a baseline model to demonstrate the added value of our approach. The results show that this problem can be successfully modelled by our Bayesian non-homogeneous Poisson Process with greater accuracy, contributing to the development of automated collision avoidance systems and helping operators react timely but sparingly with satellite manoeuvres.

Related papers

• Probabilistic Forecasting with Stochastic Interpolants and Föllmer Processes [18.344934424278048]
  We propose a framework for probabilistic forecasting of dynamical systems based on generative modeling. We show that the drift and the diffusion coefficients of this SDE can be adjusted after training, and that a specific choice that minimizes the impact of the estimation error gives a F"ollmer process.
  arXiv  Detail & Related papers  (2024-03-20T16:33:06Z)
• Predicting the Probability of Collision of a Satellite with Space Debris: A Bayesian Machine Learning Approach [0.0]
  Space is becoming more crowded in Low Earth Orbit due to increased space activity. The need to consider collision avoidance as part of routine operations is evident to satellite operators. Current procedures rely on the analysis of multiple collision warnings by human analysts.
  arXiv  Detail & Related papers  (2023-11-17T16:41:35Z)
• Predicting the Position Uncertainty at the Time of Closest Approach with Diffusion Models [0.0]
  This work proposes a machine learning model to forecast the position uncertainty of objects involved in a close encounter. It shows that the proposed solution has the potential to significantly improve the safety and effectiveness of spacecraft operations.
  arXiv  Detail & Related papers  (2023-11-09T14:54:08Z)
• Score Matching-based Pseudolikelihood Estimation of Neural Marked Spatio-Temporal Point Process with Uncertainty Quantification [59.81904428056924]
  We introduce SMASH: a Score MAtching estimator for learning markedPs with uncertainty quantification. Specifically, our framework adopts a normalization-free objective by estimating the pseudolikelihood of markedPs through score-matching. The superior performance of our proposed framework is demonstrated through extensive experiments in both event prediction and uncertainty quantification.
  arXiv  Detail & Related papers  (2023-10-25T02:37:51Z)
• User-defined Event Sampling and Uncertainty Quantification in Diffusion Models for Physical Dynamical Systems [49.75149094527068]
  We show that diffusion models can be adapted to make predictions and provide uncertainty quantification for chaotic dynamical systems. We develop a probabilistic approximation scheme for the conditional score function which converges to the true distribution as the noise level decreases. We are able to sample conditionally on nonlinear userdefined events at inference time, and matches data statistics even when sampling from the tails of the distribution.
  arXiv  Detail & Related papers  (2023-06-13T03:42:03Z)
• Temporal Scale Estimation for Oversampled Network Cascades: Theory, Algorithms, and Experiment [8.43300003915341]
  Various discrete-time probabilistic models for spreading processes have been proposed. FastClock is a clock estimation algorithm that runs in linear time in the size of its input. We give empirical results on the performance of our algorithm in comparison to the state of the art estimator.
  arXiv  Detail & Related papers  (2021-09-22T18:03:28Z)
• Fast nonlinear risk assessment for autonomous vehicles using learned conditional probabilistic models of agent futures [19.247932561037487]
  This paper presents fast non-sampling based methods to assess the risk for trajectories of autonomous vehicles. The presented methods address a wide range of representations for uncertain predictions including both Gaussian and non-Gaussian mixture models. We construct deterministic linear dynamical systems that govern the exact time evolution of the moments of uncertain position.
  arXiv  Detail & Related papers  (2021-09-21T05:55:39Z)
• Complex Event Forecasting with Prediction Suffix Trees: Extended Technical Report [70.7321040534471]
  Complex Event Recognition (CER) systems have become popular in the past two decades due to their ability to "instantly" detect patterns on real-time streams of events. There is a lack of methods for forecasting when a pattern might occur before such an occurrence is actually detected by a CER engine. We present a formal framework that attempts to address the issue of Complex Event Forecasting.
  arXiv  Detail & Related papers  (2021-09-01T09:52:31Z)
• Heterogeneous-Agent Trajectory Forecasting Incorporating Class Uncertainty [54.88405167739227]
  We present HAICU, a method for heterogeneous-agent trajectory forecasting that explicitly incorporates agents' class probabilities. We additionally present PUP, a new challenging real-world autonomous driving dataset. We demonstrate that incorporating class probabilities in trajectory forecasting significantly improves performance in the face of uncertainty.
  arXiv  Detail & Related papers  (2021-04-26T10:28:34Z)
• Congestion-aware Multi-agent Trajectory Prediction for Collision Avoidance [110.63037190641414]
  We propose to learn congestion patterns explicitly and devise a novel "Sense--Learn--Reason--Predict" framework. By decomposing the learning phases into two stages, a "student" can learn contextual cues from a "teacher" while generating collision-free trajectories. In experiments, we demonstrate that the proposed model is able to generate collision-free trajectory predictions in a synthetic dataset.
  arXiv  Detail & Related papers  (2021-03-26T02:42:33Z)
• Machine learning for causal inference: on the use of cross-fit estimators [77.34726150561087]
  Doubly-robust cross-fit estimators have been proposed to yield better statistical properties. We conducted a simulation study to assess the performance of several estimators for the average causal effect (ACE) When used with machine learning, the doubly-robust cross-fit estimators substantially outperformed all of the other estimators in terms of bias, variance, and confidence interval coverage.
  arXiv  Detail & Related papers  (2020-04-21T23:09:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.