arXiv subjects

Simone Servadio

Publications and source records attributed to Simone Servadio.

31 records · Page 2Linked to original sources

arXiv2025

Dynamical Update Maps for Particle Flow with Differential Algebra

Particle Flow Filters estimate the ``a posteriori" probability density function (PDF) by moving an ensemble of particles according to the likelihood. Particles are propagated under the system dynamics until a measurement becomes available when each particle undergoes an additional stochastic differential equation in a pseudo-time that updates the distribution following a homotopy transformation. This flow of particles can be represented as a recursive update step of the filter. In this work, we leverage the Differential Algebra (DA) representation of the solution flow of dynamics to improve the computational burden of particle flow filters. Thanks to this approximation, both the prediction and the update differential equations are solved in the DA framework, creating two sets of polynomial maps: the first propagates particles forward in time while the second updates particles, achieving the flow. The final result is a new particle flow filter that rapidly propagates and updates PDFs using mathematics based on deviation vectors. Numerical applications show the benefits of the proposed technique, especially in reducing computational time, so that small systems such as CubeSats can run the filter for attitude determination.

cs.CE↗

arXiv2024

A New Monte-Carlo Model for the Space Environment

This paper introduces a novel Monte Carlo (MC) method to simulate the evolution of the low-earth orbit environment, enhancing the MIT Orbital Capacity Analysis Tool (MOCAT). In recent decades, numerous space environment models have been developed by government agencies and research groups to understand and predict the dynamics of space debris. Our MC approach advances this by simulating the trajectories of space objects and modeling their interactions, such as collisions and explosions. This aids in analyzing the trends of space-object and debris populations. A key innovation of our method is the computational efficiency in orbit propagation, which is crucial for handling potentially large numbers of objects over centuries. We present validation results against the IADC (Inter-Agency Space Debris Coordination Committee) study and explore various scenarios, including ones without future launches and those involving the launch of proposed megaconstellations with over 80,000 active payloads. With the improvement in computational efficiencies provided by this work, we can run these new scenarios that predict millions of trackable objects over a 200-year period. The previous state-of-the-art was 400,000 objects over the same period of time. Notably, while fewer megaconstellations are planned for altitudes above 800 km, even minimal failures in post-mission disposal or collision avoidance maneuvers can significantly impact orbital debris accumulation.

astro-ph.EP↗

arXiv2024

Advances in Cislunar Periodic Solutions via Taylor Polynomial Maps

In this paper, novel approaches are developed to explore the dynamics of motion in periodic orbits near libration points in cislunar space using the Differential Algebra (DA) framework. The Circular Restricted Three-Body Problem (CR3BP) models the motion, with initial states derived numerically via differential correction. Periodic orbit families are computed using the Pseudo-Arclength Continuation (PAC) method and fitted. Two newly developed polynomial regression models (PRMs) express initial states as functions of predefined parameters and are used in the DA framework to evaluate propagated states. The initial states, expressed via PRM, are propagated in the DA framework using the fourth-order Runge-Kutta (RK4) method. The resultant polynomials of both PRM and DA are employed to develop a control law that shows significantly reduced control effort compared to the traditional tracking control law, demonstrating their potential for cislunar space applications, particularly those requiring computationally inexpensive low-energy transfers.

math.DS↗

arXiv2024

Likelihood Scouting Via Map Inversion For A Posterior-Sampled Particle Filter

An exploit of the Sequential Importance Sampling (SIS) algorithm using Differential Algebra (DA) techniques is derived to develop an efficient particle filter. The filter creates an original kind of particles, called scout particles, that bring information from the measurement noise onto the state prior probability density function. Thanks to the creation of high-order polynomial maps and their inversions, the scouting of the measurements helps the SIS algorithm identify the region of the prior more affected by the likelihood distribution. The result of the technique is two different versions of the proposed Scout Particle Filter (SPF), which identifies and delimits the region where the true posterior probability has high density in the SIS algorithm. Four different numerical applications show the benefits of the methodology both in terms of accuracy and efficiency, where the SPF is compared to other particle filters, with a particular focus on target tracking and orbit determination problems.

cs.IT↗

arXiv2024

Markers Identification for Relative Pose Estimation of an Uncooperative Target

This paper introduces a novel method using chaser spacecraft image processing and Convolutional Neural Networks (CNNs) to detect structural markers on the European Space Agency's (ESA) Environmental Satellite (ENVISAT) for safe de-orbiting. Advanced image pre-processing techniques, including noise addition and blurring, are employed to improve marker detection accuracy and robustness. Initial results show promising potential for autonomous space debris removal, supporting proactive strategies for space sustainability. The effectiveness of our approach suggests that our estimation method could significantly enhance the safety and efficiency of debris removal operations by implementing more robust and autonomous systems in actual space missions.

cs.CV↗

arXiv2024

Parameters Evolution in Source-Sink Space Population Evolutionary Models

MOCAT-SSEM is a Source-Sink model that predicts the Low Earth Orbit (LEO) space population divided into families using a predefined set of interaction parameters. Thanks to data from the Monte Carlo version of the model (MOCAT-MC), which propagates singularly every object, it is possible to estimate such parameters, assumed as additional stochastic variables. Thus, this paper proposed a new set of parameters so that the new Source-Sink model prediction better fits the computationally expensive and accurate MOCAT-MC simulation. Estimation is performed by extracting stochastic quantities from the space population, which has been analyzed to fit common probability density functions.

stat.AP↗

arXiv2024

Uncertainty Propagation and Filtering via the Koopman Operator in Astrodynamics

The Koopman Operator (KO) provides an analytical solution of dynamical systems in terms of orthogonal polynomials. This work exploits this representation to include the propagation of uncertainties, where the polynomials are modified to work with stochastic variables. Thus, a new uncertainty quantification technique is proposed, where the KO solution is expanded to include the prediction of central moments, up to an arbitrary order. The propagation of uncertainties is then expanded to develop a new filtering algorithm, where measurements are considered as additional observables in the KO mathematics. Numerical simulations in astrodynamics assess the accuracy and performance of the new methodologies.

cs.IT↗

arXiv2024

Propagation of Uncertainty with the Koopman Operator

This paper proposes a new method to propagate uncertainties undergoing nonlinear dynamics using the Koopman Operator (KO). Probability density functions are propagated directly using the Koopman approximation of the solution flow of the system, where the dynamics have been projected on a well-defined set of basis functions. The prediction technique is derived following both the analytical (Galerkin) and numerical (EDMD) derivation of the KO, and a least square reduction algorithm assures the recursivity of the proposed methodology.

cs.IT↗

arXiv2024

Threat Level Estimation From Possible Break-Up Events In LEO

The NASA Standard Break-Up Model models collisions and explosions in space, which identifies the future distribution of debris. Given a possible break-up event, this work analyses the threat posed by the generated debris in the orbit of an asset spacecraft. Using the Koopman Operator solution of the $J_2$ perturbed two-body dynamics, the family of all possible orbits that cross the asset's pathway is identified and parameterized according to their velocity. The threat level assessment of a collision onto the asset is estimated considering the intersection between the velocities of the break-up model and the Koopman transfer solutions.

astro-ph.EP↗

arXiv2022

A Lambert's Problem Solution via the Koopman Operator with Orthogonal Polynomials

Lambert's problem has been long studied in the context of space operations; its solution enables accurate orbit determination and spacecraft guidance. This work offers an analytical solution to Lambert's problem using the Koopman Operator (KO). In contrast to previous methods in the literature, the KO provides the analysis of a nonlinear system by seeking a transformation that embeds the nonlinear dynamics into a global linear representation. Our new methodology to solve for Lambert solutions considers the position of the system's eigenvalues on the phase plane, evaluating accurate state transition polynomial maps for a computationally efficient propagation of the dynamics. The methodology used and multiple-revolution solutions found are compared in accuracy and performance with other techniques found in the literature, highlighting the benefits of the newly developed analytical approach over classical numerical methodologies.

math.NA↗

arXiv2022

A Koopman Operator Tutorial with Othogonal Polynomials

The Koopman Operator (KO) offers a promising alternative methodology to solve ordinary differential equations analytically. The solution of the dynamical system is analyzed in terms of observables, which are expressed as a linear combination of the eigenfunctions of the system. Coefficients are evaluated via the Galerkin method, using Legendre polynomials as a set of orthogonal basis functions. This tutorial provides a detailed analysis of the Koopman theory, followed by a rigorous explanation of the KO implementation in a computer environment, where a line-by-line description of a MATLAB code solves the Duffing oscillator application.

math.NA↗

arXiv2022

A Koopman-Operator Control Optimization for Relative Motion in Space

A high order optimal control strategy implemented in the Koopman operator framework is proposed in this work. The new technique exploits the Koopman representation of the solution of the equations of motion to develop an energy optimal inverse control methodology. The operator theory can reformulate a nonlinear dynamical system of finite dimension into a linear system with an infinite number of dimensions. As a results, the state of any nonlinear dynamics is represented as a linear combination of high-order orthogonal polynomials, which creates the state transition polynomial map of the solution. Since the optimal control technique can be reduced to a two-points boundary value problem, the Koopman map is used to connect the state and control variables in time, such that optimal values are obtained through map inversion and polynomial evaluation. The new technique is applied to rendezvous applications in space, where the relative motion between two satellites is modelled with a high-order polynomial series expansion of the Lagrangian of the system, such that the Clohessy-Wiltshire equations represent the reduction of the high-order model to a linear truncation.

math.OC↗

arXiv2021

Dynamics Near the Three-Body Libration Points via Koopman Operator Theory

This paper investigates the application of the Koopman Operator theory to the motion of a satellite about a libration point in the Circular Restricted Three-Body Problem. Recently, the Koopman Operator has emerged as a promising alternative to the geometric perspective for dynamical systems, where the Koopman Operator formulates the analysis and dynamical systems in terms of observables. This paper explores the use of the Koopman Operator for computing both 2D and 3D periodic orbits near libration points. Further, simulation results show that the Koopman Operator provides analytical solutions with high accuracy for both Lyapunov and Halo orbits, which are then applied to a station-keeping application.

nlin.CD↗