Search NASA⌕ Search

Engineering topics

Roa, Javier

Publications and source records attributed to Roa, Javier.

17 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2019

Efficient method for approximating nonlinear dynamics: applications to uncertainty propagation and estimation

High-order Taylor series expansions can be used to model nonlinear dynamics at the cost of integrating a large set of variational equations to obtain high-order state-transition tensors (STTs). This paper presents an innovative technique for approximating the high-order STTs that reduces significantly the computational cost by retaining only the dominant secular terms. We propagate the low-order partial derivatives of Kepler’s equation, which only requires the integration of six additional equations to extend an n-th order approximation to order (n + 1). The approximation stems from the Lindstedt-Poincare procedure and exploits the stability properties of orbital motion. Since the method makes no dynamical assumptions, it can accommodate any source of orbital perturbations. We show how the approximation of the second-order STT significantly increases the accuracy of the linear method for uncertainty propagation with only a small computational overhead. Finally, we derive a high-order approximate extended Kalman filter that implements the proposed approximation of the STT and improves the performance of linear filters. Examples of application with different perturbation sources include the heliocentric orbit of an asteroid, an orbiter around Europa, and an Earth-orbiting satellite.

Park, Ryan S↗
NASA NTRS2019

MultiLayer Clustered Sampling (MLCS) technique for near-earth asteroid impact hazard assessment

Because of planetary encounters, the motion of near-Earth asteroids is chaotic and small differences in the initial conditions tend to diverge exponentially. Linear approximations for propagating orbital uncertainties can lead to inaccurate estimates of the probability of an Earth collision. We present a novel fully nonlinear strategy for estimating the probability of an asteroid impact using sequential Monte Carlo layers. The method first explores a low-resolution layer to locate potentially relevant regions. Then, we conduct localized searches on deeper layers with higher resolution. The method retains the accuracy of brute-force Monte Carlo sampling while reducing the computational cost by only sampling relevant regions.

Farnocchia, Davide↗
NASA NTRS2018

Applications of the Dynamic N-Dimensional K-Vector

The n-dimensional k-vector (NDKV) is an appealing alternative to binary tress for resolving complex queries in large relational databases. The method has excelled in several applications involving static databases. The present paper extends the theory supporting the NDKV to handle dynamic databases, where the data is updated frequently. This includes deleting records, adding new entries, or editing existing elements. The merit of this new version of the NDKV, the dynamic n-dimensional k-vector (DNDKV), is that it is no longer necessary to recompute the entire k-vector (the main structure that indexes the data) every time a record changes. The algorithm updates the four constituents of the standard NDKV on the fly: the database, sorted database, index, and k-vector tables. As a result, the DNDKV becomes comparable in terms of capabilities and flexibility to stateof-the-art storage engines relying on structured query languages (SQL). The performance of the DNDKV is assessed by running typical read/write operations on a database that contains millions of pre-computed missions to celestial bodies. This database requires frequent updates whenever an orbit solution is refined or new bodies are discovered. The DNDKV is faster than rebuilding the k-vector tables completely, provided that the number of elements being added or removed is not excessively large. Direct runtime comparisons with MySQL suggest that the DNDKV is several times faster for reading but might be slower for writing and updating the database. One limit of the technique is the elements being added must be within the range of the current k-vector tables. If this is not the case, the technique cannot be used and the k-vector tables must be rebuilt from scratch.

Mortari, Daniele↗
NASA NTRS2018

Automatic Design of Missions to Small Bodies

The new JPL Small-Body Automatic Mission-Design System comprises two main elements: a database of pre-computed mission options to all known asteroids and comets, and an interactive web interface that can be used to design transfers to each small body. The system is kept current with the JPL Small Body orbit catalog, is publicly available, and can be accessed from the JPL Solar System Dynamics Group website. The missions computed by the automatic system are impulsive. However, a low-thrust v estimate is also provided. The database of pre-computed missions can be filtered to find potential targets with certain orbital and physical properties, and that meet specific mission-design constraints. In addition to describing the system in detail, this paper presents empirical analytic expressions to approximate the impulsive v requirements of missions to comets and to each family of asteroids, obtained by fitting statistical data. To show how the interactive interface works, we consider mission options to asteroid 99942 Apophis. We also include optimal mission opportunities to other selected small bodies.

Farnocchia, Davide↗
NASA NTRS2017

Semi-analytic preliminary design of low-thrust missions

Using generalized logarithmic spirals to approximate low-thrust trajectories, a new strategy for the design of low-thrust gravity-assist transfers has been developed. Each transfer leg is defined by a semi-analytic model, and its solution is equivalent to a hybrid Lambert’s problem. The method is suitable for approximating both flyby and rendezvous transfer legs. A branch and prune algorithm is used to generate a collection of initial guesses for further optimization. The analytic nature of the low-thrust model simplifies the pruning step, since dynamical and operational constraints (like maximum thrust or total v) can be imposed easily. The solutions obtained with the global search algorithm can be post-processed, filtered, and ranked according to various criteria. This is where the versatility of the method resides, because changing the selection criteria does not require a new search. Selected candidates are then optimized further, in order to generate actual low-thrust orbits. Two mission design examples are presented: an asteroid deflection mission using a kinetic impactor, and a rendezvous mission to Jupiter. These examples are used to analyze the convergence of the optimization stage, in particular how far from the optimal solution the initial guesses are.

Park, Ryan S.↗
NASA NTRS2017

A new concept of stability in orbit propagation, useful for quantifying numerical errors

We present the concept of topological stability in the numerical propagation of orbits, and show how it results in a useful new method for measuring the global numerical error of an orbit propagation. The concept applies to any problem in orbital dynamics. Moreover, it can be extended to any three-dimensional system of di erential equations of second order. In order to assess the topological stability of a given integration a special metric is introduced, which can be used to estimate the numerical errors robustly. The method is particularly well suited for dealing with strongly perturbed and chaotic systems. The construction is based on the constraint imposed by the Hopf map that supports the Kustaanheimo-Stiefel transformation. Generic concepts of stability are translated to KS space.

Pelaez, Jesus↗
NASA NTRS2017

GTOC9: Methods and Results from the Jet Propulsion Laboratory Team

The removal of 123 pieces of debris from the Sunsynchronous LEO environment is accomplished by a 10-spacecraft campaign wherein the spacecraft, flying in succession over an 8-yr period, rendezvous with a series of the debris objects, delivering a de-orbit package at each one before moving on to the next object by means of impulsive manoeuvres. This was the GTOC9 problem, as posed by the European Space Agency. The methods used by the Jet Propulsion Laboratory team are described, along with the winning solution found by the team. Methods include branch-and-bound searches that exploit the natural nodal drift to compute long chains of rendezvous with debris objects, beam searches for synthesising campaigns, ant colony optimisation, and a genetic algorithm. Databases of transfers between all bodies on a fine time grid are made, containing an easyto- compute yet accurate estimate of the transfer V . Lastly, a final non-linear programming optimisation is performed to ensure the trajectories meet all the constraints and are locally optimal in initial mass.

Sims, Jon↗
NASA NTRS2016

Three-Dimensional Generalized Logarithmic Spirals

The family of generalized logarithmic spirals including a control parameter is extended to the three-dimensional case. The in-plane motion is decoupled from the out-of-plane motion in such a way that the integrals of motion found in the planar problem are still preserved in the three-dimensional case. Designing a low-thrust orbit transfer decomposes in two stages: first, orbits are projected on a reference plane and the planar transfer is solved with a generalized logarithmic spiral. Second, the out-of-plane component of the motion is included in order to target the final orbit. The projection of the three-dimensional transfer orbit on the reference plane is a generalized logarithmic spiral. Arbitrary shape-based laws for the 3D motion can be considered. This paper explores a polynomial and a Fourier series shaping method, together with a polynomial steering law. A fictitious low-thrust sample return mission to Ceres is designed to show the versatility of the method.

Roa, Javier↗
NASA NTRS2016

Introducing a Degree of Freedom in the Family of Generalized Logarithmic Spirals

The versatility of the family of generalized logarithmic spirals is improved by introducing a degree of freedom in the solution. The low-thrust acceleration profile now includes a control term that affects both the magnitude and the direction of the thrust. Exact and fully analytic solutions to the trajectory, the velocity, the time of flight, etc. are made available. Two integrals of motion are preserved. The first one is a generalization of the equation of the energy and depends on the values of the control parameter. The second one relates to the equation of the angular momentum. The problem of finding spiral transfers between two arbitrary state vectors reduces to solving one algebraic equation with one unknown. The degree of freedom allows fixing the time of flight of the transfer. If the time of flight is fixed, then there are two equations with two unknowns. No other iterative procedures are required. Coast arcs can be introduced in the solution naturally. An explicit expression for the maximum acceleration reached along the transfer is provided. Thanks to the symmetry properties of the solution a simple algorithm for generating periodic orbits is presented. An arbitrary number of intermediate nodes can be introduced to improve the flexibility of the solution when facing optimization problems. An example of a low-thrust gravity-assist Earth-Mars-Ceres trajectory shows that the solution is comparable to that obtained with other preliminary design techniques.

Roa, Javier↗
NASA NTRS2016

Spiral Lamber's Problem with Generalized Logarithmic Spirals

Lambert’s problem subject to a continuous acceleration is solved using the family of generalized logarithmic spirals. Thanks to the existence of two first integrals related to the energy and angular momentum surprising analogies with the Keplerian case are found. A minimum-energy spiral transfer exists. Increasing the value of the constant of the generalized energy yields pairs of conjugate spiral trajectories. The properties of such spirals are strongly connected with the properties of conjugate Keplerian orbits. When the generalized constant of the energy reaches a critical value the two solutions degenerate into a pair of parabolic spirals, one of which connects the two vectors through infinity. From that point the spiral transfers become hyperbolic. Generalized logarithmic spirals admit closed-form solutions to all the required magnitudes including the time of flight, providing a deep insight into the dynamics of the problem. In addition, the maximum acceleration along the transfer is found analytically so the solutions that violate the design constraints on the maximum thrust acceleration can be rejected without any further computations. When the time of flight is fixed there is still a degree of freedom in the solution, related to a control parameter. Resonant transfers appear naturally thanks to the symmetry properties of the generalized logarithmic spirals. The problem of designing a low-thrust transfer between two bodies can be reduced to solving the corresponding spiral Lambert’s problem. In order to show the versatility of the method it is applied to the design of an asteroid tour and to explore launch opportunities to Mars.\

Roa, Javier↗
NASA NTRS2015

Efficient Trajectory Propagation for Orbit Determination Problems

Regularized formulations of orbital motion apply a series of techniques to improve the numerical integration of the orbit. Despite their advantages and potential applications little attention has been paid to the propagation of the partial derivatives of the corresponding set of elements or coordinates, required in many orbit-determination scenarios and optimization problems. This paper fills this gap by presenting the general procedure for integrating the state-transition matrix of the system together with the nominal trajectory using regularized formulations and different sets of elements. The main difficulty comes from introducing an independent variable different from time, because the solution needs to be synchronized. The correction of the time delay is treated from a generic perspective not focused on any particular formulation. The synchronization using time-elements is also discussed. Numerical examples include strongly-perturbed orbits in the Pluto system, motivated by the recent flyby of the New Horizons spacecraft, together with a geocentric flyby of the NEAR spacecraft.

numerical methods↗