Search NASA⌕ Search

SEARCH · Search NASA

Results for “robust trajectory optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Copernicus-LinCov (COPCOV) Software Integration in Support of Robust Trajectory Optimization

Robust trajectory optimization is the process of optimizing a trajectory while accounting for system uncertainty due to a variety of potential error sources. This work highlights the development and features of a novel tool known as CopCov to support robust trajectory optimization efforts. CopCov acts as an interface between Copernicus, a generalized trajectory design and optimization tool, and LinCov, a linear covariance analysis tool. By having a direct interface between these two software packages, Copernicus can receive covariance information from LinCov through a direct feedback loop, thus enabling optimization of a trajectory that is robust to trajectory dispersions and navigation errors. This paper details the architecture of CopCov and its flexibility to operate under varying configurations, including with both tools running locally or alternatively with the tools communicating via a remote connection. Additionally, the CopCov tool is demonstrated on a simple Hohmann transfer reference trajectory with varying numbers of Trajectory Correction Maneuvers (TCMs) and varying problem formulations. This example scenario is used to highlight how the inclusion of the CopCov interface affects burn placement of both major burns and minor burns (i.e., TCMs) in the optimized solution. Results are compared against analytical solutions and against a Genetic Algorithm (GA) optimizer for independent verification and validation.

Copernicus↗

Robust Trajectory Optimization Techniques Using a Sweeping Gradient Method and Linear Covariance Analysis

We present robust trajectory optimization techniques using a sweeping gradient method for ordinary differential equations with events (SGM) and linear covariance analysis (LinCov). SGM is a method for computing the gradient of trajectory analyses defined by performance indices over initial value problems with events with respect to static parameters. LinCov is an analytic technique for predicting stochastic behavior of dynamical systems. By combining SGM and LinCov, it is possible use efficient, off-the-shelf, gradient-based optimizers to solve robust optimal trajectory design problems. We describe the individual methods and some details on how they can be combined. Then we apply the combined techniques to a variety of orbital trajectory design problems to demonstrate its use, including minimum fuel transfer and mid-course correction burn scheduling.

Benjamin W L Margolis↗

Angles-Only Robust Trajectory Optimization for NRHO Rendezvous

This study demonstrates a robust trajectory optimization approach for rendezvous and proximity operations with angles-only navigation measurements. Often, sensors that directly measure relative range and velocity require communication or coordination between the chaser and target vehicle and can have limiting pointing accuracy, mass, or power requirements compared to angle measurement sensors. Thus, the capability to perform a rendezvous with only angle measurements can be advantageous for vehicle design and to improve robustness to failures. However, the well studied limitation of angles-only navigation in measuring range results in large uncertainties in the navigation system that must be reduced with chaser vehicle thrust maneuvers to induce observability in range for the navigation filter. This analysis presents a trajectory optimization problem for a lunar ascent rendezvous during a crewed lunar mission in a Near-Rectilinear Halo Orbit (NRHO) that is limited to only angle measurements. The objective of this study is to show that an angles-only rendezvous is feasible in an NRHO and to present the sensitivity to an assortment of constraints generated from a systematic optimization process using linear covariance analysis and particle swarm optimization. Linearized NRHO dynamics and linearized relative targeting are applied to use linear covariance analysis to determine the expected delta-v and trajectory dispersions due to initial state uncertainty, sensor errors, maneuver execution errors, and unmodeled dynamics. The delta-v and trajectory dispersions are passed into a particle swarm optimization algorithm to find the optimized maneuver profile that minimizes fuel use while satisfying constraints such as free drift and underburn to 3-sigma certainty. The trajectory constraints including time available, desired final uncertainty, and initial uncertainty are varied to ascertain sensitivity and desirable engineering trades.

Linear Covariance Analysis↗

Robust Trajectory Optimization for Guided Powered Descent and Landing

A robust trajectory optimization approach for guidance algorithm gain selection for powered descent and landing is developed. This approach uses a genetic algorithm to determine optimal guidance algorithm parameters while incorporating uncertainty information from linear covariance analysis. The optimal guidance algorithm parameters are determined while accounting for environment, navigation, and vehicle property uncertainty and sensor suite fidelity. As a demonstration of this method, the optimal gains for the fractional polynomial powered descent guidance are found for the braking phase of a robotic lunar landing mission. Scenarios with differing sensor suites and sensor qualities are considered, with objective functions to minimize variability in propellant usage or terminal position. Results show that the optimal guidance algorithm gains for a given trajectory differ based on the sensor suite, and optimal guidance algorithm gains may result in up to 20% performance improvements over the baseline in propellant usage and landed accuracy.

Grace E Calkins↗

Robust Trajectory Optimization and GN&C Performance Analysis for NRHO Rendezvous

This paper evaluates several candidate Near-Rectilinear Halo Orbits (NRHO) rendezvous trajectory designs using linear covariance (LinCov) analysis and determines the optimal locations for NRHO rendezvous translational maneuver locations. The performance of several candidate relative trajectory designs are determined as a function of relative navigation accuracy (angles only), inertial optical navigation (OpNav), range observability maneuvers, maneuver execution errors, relative maneuver targeting, and environment uncertainties. Further, the optimal locations of rendezvous maneuvers are determined for each of the candidate reference trajectories. The long-term goal of this research is to utilize LinCov and a genetic optimization algorithm (GA) to determine a complete end-to-end optimal NRHO trajectory design that is robust to navigation errors, maneuver execution errors, and environment uncertainties. This paper represents a first step toward this goal. Three candidate rendezvous trajectories with varying numbers of range-observability maneuvers are evaluated for their robustness to uncertainties, errors, and total trajectory correction delta-v performance. Some key elements of this analysis include relative navigation performance in an NRHO, relative trajectory dispersion performance, and total 3-sigma delta-v performance. This development provides the foundation to then determine an optimal and robust end-to-end NRHO rendezvous trajectory, including the determination of the optimal locations of range observability maneuvers, if needed.

Linear Covariance Analysis↗

Robust Trajectory Optimization for NRHO Rendezvous Using SPICE Kernel Relative Motion

In this paper, robust optimization is performed on trajectory correction maneuvers during the lunar lander return phase of an Artemis mission, treating the trajectory from one hour after low lunar orbit departure to arrival in the vicinity of the lunar Gateway as a relative motion problem. To enable rapid stochastic optimization techniques requiring many candidate trajectories, SPICE kernel relative motion as implemented by the Quadratic Interpolated State Transition (QIST) system is used as the underlying dynamics propagation. The optimization is performed with a genetic optimizer using linear covariance (LinCov) software in a simplified operational context, taking into account the availability of navigation sensors with varying measurement models, ranges, and accuracies. No numerical integration is used, since the relative motion around Gateway is fully characterized with the a priori computation of the QIST coefficients. Maneuver placements are computed to optimize the minimum 3σ delta-v of the trajectory, the position dispersion at a target point, and a convex combination of these two metrics. An order of magnitude runtime improvement is provided over legacy methods with less than 10% error introduced. All QIST results are shown to be in-family with legacy methods. The tradespace for optimal delta-v design is found to range from 77.0 to 93.9 m/s, while the range of optimal dispersion is between 1.4 and 11.7 km.

Relative Motion↗

Sensitivity of Optimal Midcourse Correction Scheduling for Robust Cislunar Trajectory Design

A new approach to optimal trajectory design is the determination of optimal trajectories that are robust to initial trajectory dispersions, navigation errors, maneuver execution errors, and environment modeling errors. This paper investigates the sensitivity of cislunar robust optimal trajectory design to launch date, duration of navigation measurement passes, and navigation measurement frequency. For a given cislunar trajectory from translunar injection (TLI) to lunar orbit insertion (LOI), the optimal locations of midcourse corrections, also known as trajectory correction maneuvers (TCM) are determined by minimizing the final 3-σ ∆v subject to a final 3-σ position dispersion constraint for a given launch date, specified measurement pass duration prior to each maneuver, and measurement frequency. Optical navigation (OpNav) is assumed, and OpNav field-of-view (FOV) and lighting constraints are employed. These constraints turn out to be important elements of the problem. The sensitivity of the optimal TCM locations are then investigated by varying the launch date, duration of OpNav measurement passes, and the OpNav measurement frequency, and then re-optimizing the locations of the TCMs. Given the problem parameters provided herein, results show that while the optimal TCM locations with respect to TLI vary greatly from one launch date to another, their locations with respect to LOI are nearly invariant over a 2-month launch window. Results also show that in all cases the optimal location of the last TCM is found to be at the point where the OpNav lunar FOV constraint is first violated. For all other TCMs, OpNav measurement pass duration and measurement frequency can have a moderate to large affect on the optimal TCM locations.

Linear Covariance Analysis↗

Robust Cislunar Trajectory Optimization Via Midcourse Correction and Optical Navigation Scheduling

This paper presents a new approach to optimal trajectory design that considers uncertainties in the system, referred to herein as robust trajectory optimization. This approach assumes an existing reference trajectory and optimizes the locations of midcourse correction burns and utilization of onboard navigation sensors to minimize dispersions in ∆v or final position. Navigation errors, maneuver execution errors, orbit insertion errors, and environmental modeling errors are considered. The application in this paper is cislunar flight with the goal of injecting into a Near-Rectilinear Halo Orbit for rendezvous with a target vehicle. Two complementary optimization problems are proposed. One problem minimizes the total ∆v dispersion subject to a final position dispersion constraint. The other problem minimizes the final position dispersion subject to a total ∆v dispersion constraint. The results from each optimization problem are shown for a complete mission profile.

Linear Covariance Analysis↗

Generalized Linear Targeting For Cislunar Flight

An important element of Artemis and NASA’s campaign to explore the Moon is the autonomous onboard two-level targeter (TLT) used during all cislunar flight phases. The function of the TLT is to autonomously recompute the burn targets for the upcoming burn (or multiple burns) in response to navigation and vehicle dispersion providing a solution that meets all of the trajectory constraints. Although the TLT has been utilized previously as a ground-based planning tool, and flown onboard during the Artemis I mission, it’s complexity and iterative nature make is difficult to incorporate into and support rapid analyses such as robust optimal trajectory design applications where speed is essential. In this paper, a set of generalized linear targeting algorithms that mimics many of the properties of the TLT is derived. The generalized algorithms can handle single or multiple impulsive maneuvers, with multiple constraints at multiple fixed or variable times. A linear targeting algorithm for finite burn maneuvers is also derived. The generalized linear targeting algorithms are exceptionally fast and easy to implement in Monte Carlo analysis, linear covariance (LinCov) analysis, and robust optimal trajectory design. Several cislunar flight examples are provided.

Linear Covariance Analysis↗

Co-Optimization of Navigation System Requirements and Trajectory Design Using a Sweeping Gradient Method and Linear Covariance Analysis

We describe the application of a sweeping gradient method for ordinary differential equations with events (SGM) and linear covariance analysis (LinCov) to the co-optimization of navigation system requirement generation and robust trajectory design. SGM is a method for computing the gradient of trajectory analyses defined by performance indices over initial value problems with events with respect to static parameters. LinCov is an analytic technique for predicting stochastic behavior of dynamical systems. By combining SGM and LinCov, it is possible use efficient, off-the-shelf, gradient-based optimizers to solve a combined robust optimal trajectory and navigation system design problem. In this paper, we formulate the required models to apply the combined SGM and LinCov techniques to a Near-Rectilinear Halo Orbit rendezvous approach scenario and show results for several intermediate problems.

Benjamin W L Margolis↗

Trajectory optimization for the National Aerospace Plane

The primary objective of this research is to develop an efficient and robust trajectory optimization tool for the optimal ascent problem of the National Aerospace Plane (NASP). This report is organized in the following order to summarize the complete work: Section two states the formulation and models of the trajectory optimization problem. An inverse dynamics approach to the problem is introduced in Section three. Optimal trajectories corresponding to various conditions and performance parameters are presented in Section four. A midcourse nonlinear feedback controller is developed in Section five. Section six demonstrates the performance of the inverse dynamics approach and midcourse controller during disturbances. Section seven discusses rocket assisted ascent which may be beneficial when orbital altitude is high. Finally, Section eight recommends areas of future research.

Lu, Ping↗

Optimized Trajectory Correction Burn Placement for NRHO Orbit Maintenance

NASA's future Artemis missions plan to utilize a near rectilinear halo orbit (NRHO) in the lunar vicinity to facilitate access to the lunar surface and place other critical assets to support human exploration. This exploration architecture requires a vehicle to remain in the NRHO for long periods of time ranging from several days, to weeks, to months, and even years. Consequently, periodic orbit maintenance burns become essential to ensure the spacecraft follows the desired reference trajectory in an efficient yet effective manner despite crew activity, navigation uncertainty, maneuver execution errors, disturbance accelerations, orbit insertion dispersions, and other system limitations. This work introduces a targeting algorithm that can be utilized to analyze a variety of targeting constraints and parameters that maximizes overall performance. Techniques associated with robust trajectory optimization are used to identify the optimized number and placement for NRHO trajectory correction (NTC) burns that accounts for the mission schedule, both a primary and backup navigation system, targeting strategies and burn plan configurations, vehicle venting, thruster selection, and integrated GN\&C performance. A notional scenario extracted from the NASA Artemis III mission is used to motivate and demonstrate these concepts and performance results.

Linear Covariance Analysis↗

Optimized Trajectory Correction Burn Placement for the NASA Artemis II Mission

The NASA Artemis II mission represents the first time humans plan to return to the lunar vicinity in over 50 years with a crew traveling to the Moon in the Orion spacecraft on a free return trajectory. This first crewed mission of the Artemis program will evaluate human-rated elements of Orion in preparation to sending astronauts to the lunar surface. The selected free-return cislunar trajectory profile that is reminiscent of the Apollo 8 mission that nominally requires no additional translational burns following the trans-lunar injection (TLI) burn. Due to crew activity, maneuver execution errors, navigation uncertainty, orbit insertion errors, disturbance accelerations, and other system limitations; periodic trajectory corrections burns are necessary to ensure proper entry interface (EI) conditions are satisfied for a safe return to Earth. Robust trajectory optimization techniques are utilized to determine the optimized placements for the Artemis II trajectory correction burns that accounts for the crew schedule, both the primary and backup navigation systems, targeting strategies and burn plan configurations, spacecraft venting, thruster selection, and the integrated GN&C performance.

Linear Covariance Analysis↗

Numerical derivative techniques for trajectory optimization

The adoption of robust numerical optimization techniques in trajectory simulation programs has resulted in powerful design and analysis tools. These trajectory simulation/optimization programs are widely used, and a representative list includes the GTS system, the POST program, and newer collocation methods such as OTIS and FONPAC. All of these programs rely on optimization algorithms which require objective function and constraint gradient data during the iteration process. However, most trajectory optimization problems lack simple analytical expressions for these derivatives. In the general case a function evaluation involves integrating aerodynamic, propulsive, and gravity forces over multiple trajectory phases with complex control models. With the newer collocation methods, the integration is replaced by defect constraints and cubic approximations for the state. While analytic gradient expressions can sometimes be derived for trajectory optimization problems, the derivation is cumbersome, time consuming, and prone to mistakes. Fortunately, an alternate method exists for the gradient evaluation, namely finite difference approximations. In this paper some finite difference gradient techniques developed for use with the GTS system are presented. These techniques include methods for computing first and second partial derivatives of single and multiple sets of functions. A key feature of these methods is an error control mechanism which automatically adjusts the perturbation size to obtain accurate derivative values.

Hallman, Wayne P.↗

A Robust Initialization Scheme for a Lateral Trajectory Optimization Problem with Time of Arrival Windows

We present a robust initialization scheme that estimates parameter values for the numerical solution of a two-point boundary value problem. The two-point boundary value problem formulation stems from the optimization of a cost functional subject to the dynamics of a simplified lateral aircraft model and other constraints. Leveraging regular perturbation methods, initial parameter estimates are analytically determined and used to initialize a gradient descent optimization routine which is shown to rapidly converge over a range of initial aircraft positions and heading angles. Additionally, the velocity of the aircraft is optimized to ensure the trajectory of the aircraft terminates within a desired region in both time and space.

lateral trajectory optimization↗

A feedback linearization approach to spacecraft control using momentum exchange devices

Recent developments in the area of nonlinear control theory have shown how coordiante changes in the state and input spaces can be used with nonlinear feedback to transform certain nonlinear ordinary differential equations into equivalent linear equations. These feedback linearization techniques are applied to resolve two problems arising in the control of spacecraft equipped with control moment gyroscopes (CMGs). The first application involves the computation of rate commands for the gimbals that rotate the individual gyroscopes to produce commanded torques on the spacecraft. The second application is to the long-term management of stored momentum in the system of control moment gyroscopes using environmental torques acting on the vehicle. An approach to distributing control effort among a group of redundant actuators is described that uses feedback linearization techniques to parameterize sets of controls which influence a specified subsystem in a desired way. The approach is adapted for use in spacecraft control with double-gimballed gyroscopes to produce an algorithm that avoids problematic gimbal configurations by approximating sets of gimbal rates that drive CMG rotors into desirable configurations. The momentum management problem is stated as a trajectory optimization problem with a nonlinear dynamical constraint. Feedback linearization and collocation are used to transform this problem into an unconstrainted nonlinear program. The approach to trajectory optimization is fast and robust. A number of examples are presented showing applications to the proposed NASA space station.

Dzielski, John Edward↗

Autorotation flight control system

The present invention provides computer implemented methodology that permits the safe landing and recovery of rotorcraft following engine failure. With this invention successful autorotations may be performed from well within the unsafe operating area of the height-velocity profile of a helicopter by employing the fast and robust real-time trajectory optimization algorithm that commands control motion through an intuitive pilot display, or directly in the case of autonomous rotorcraft. The algorithm generates optimal trajectories and control commands via the direct-collocation optimization method, solved using a nonlinear programming problem solver. The control inputs computed are collective pitch and aircraft pitch, which are easily tracked and manipulated by the pilot or converted to control actuator commands for automated operation during autorotation in the case of an autonomous rotorcraft. The formulation of the optimal control problem has been carefully tailored so the solutions resemble those of an expert pilot, accounting for the performance limitations of the rotorcraft and safety concerns.

Bachelder, Edward N.↗