Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 973 records · Page 54

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented that optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented which optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗

Impact of mismodeled idle engine performance on calculation and tracking of optimal 4-D descent trajectories

Advanced flight management systems are being developed which are capable of calculating optimal 3-D and 4-D flight trajectories for arbitrary fuel and time costs. These systems require mathematical models of airplane performance in order to compute the optimal profiles. Mismodeled idle engine characteristics can result in descent trajectories requiring excessive throttle and/or speedbrake activity in order to achieve the desired end conditions. This paper evaluates the cost and fuel penalties, trajectory variations, and flight control requirements associated with typical idle engine modeling errors for a twin-jet transport airplane. Variations in idle power setting, thrust, fuel flow, and surge bleed operation were evaluated for a cruise/descent flight segment. The results of this analysis provide insight into the penalties associated with uncertainties in idle engine performance and suggest methods of modeling which minimize these penalties.

Williams, D. H.↗

Releasing Correlated Trajectories: Towards High Utility and Optimal Differential Privacy

A mutual correlation between trajectories of two users is very helpful to real-life applications such as product recommendation and social media. While providing tremendous benefits, the releasing of correlated trajectories may leak sensitive social relations, due to potential links between mutual correlations and social relations. To the best of our knowledge, here we take the first step to propose a mathematically rigorous n-body Laplace framework, satisfying epsilon-differential privacy, which efficiently prevents a social relation inference through the mutual correlation between n-node trajectories of two users. The problem is mathematically formulated by defining a trajectory correlation score to measure the social relation between two users. Then, under the n-body Laplace framework, we propose two Lagrange Multiplier-based Differentially Private (LMDP) approaches to optimize the privacy budgets, for the data utility measured by location distances and the data utility measured by location correlations, i.e., UD-LMDP and UC-LMDP. Also, we present detailed analyses of privacy, data utility, adversary knowledge and the constrained optimizations. Finally, we perform experimental studies with real-life data. Our experimental results show that our proposed approaches achieve better privacy and data utility than the existing approaches.

97 MATHEMATICS AND COMPUTING↗

Trajectory design via unsupervised probabilistic learning on optimal manifolds

Abstract This article illustrates the use of unsupervised probabilistic learning techniques for the analysis of planetary reentry trajectories. A three-degree-of-freedom model was employed to generate optimal trajectories that comprise the training datasets. The algorithm first extracts the intrinsic structure in the data via a diffusion map approach. We find that data resides on manifolds of much lower dimensionality compared to the high-dimensional state space that describes each trajectory. Using the diffusion coordinates on the graph of training samples, the probabilistic framework subsequently augments the original data with samples that are statistically consistent with the original set. The augmented samples are then used to construct conditional statistics that are ultimately assembled in a path planning algorithm. In this framework, the controls are determined stage by stage during the flight to adapt to changing mission objectives in real-time.

42 ENGINEERING↗

Optimization and guidance of abort landing trajectories in a windshear

The abort landing problem for flight trajectories in the presence of windshear is considered with reference to flight in a vertical plane. The optimal trajectory (OT) problem is a minimax problem or Chebyshev problem of optimal control which can be converted into a Bolza problem through suitable transformations. Numerical results for several combinations of windshear intensities and initial altitudes are presented. A guidance trajectory (GT) law is implemented in feedback control form, subject to prescribed bounds on the angle of attack and its time derivative. Simplified guidance trajectories (SGT) are then considered, leading to a safe target altitude guidance. Conclusions derived for strong-to-severe windshear conditions include GT and SGT preserving the basic properties of OT, and the peak altitude drop of GT and SGT being less than that of the constant pitch trajectory and the maximum angle-of-attack trajectory.

Miele, A.↗

Guidance and Control Algorithms for the Mars Entry, Descent and Landing Systems Analysis

The purpose of the Mars Entry, Descent and Landing Systems Analysis (EDL-SA) study was to identify feasible technologies that will enable human exploration of Mars, specifically to deliver large payloads to the Martian surface. This paper focuses on the methods used to guide and control two of the contending technologies, a mid- lift-to-drag (L/D) rigid aeroshell and a hypersonic inflatable aerodynamic decelerator (HIAD), through the entry portion of the trajectory. The Program to Optimize Simulated Trajectories II (POST2) is used to simulate and analyze the trajectories of the contending technologies and guidance and control algorithms. Three guidance algorithms are discussed in this paper: EDL theoretical guidance, Numerical Predictor-Corrector (NPC) guidance and Analytical Predictor-Corrector (APC) guidance. EDL-SA also considered two forms of control: bank angle control, similar to that used by Apollo and the Space Shuttle, and a center-of-gravity (CG) offset control. This paper presents the performance comparison of these guidance algorithms and summarizes the results as they impact the technology recommendations for future study.

Davis, Jody L.↗

Safe Onboard Guidance and Control Under Probabilistic Uncertainty

An algorithm was developed that determines the fuel-optimal spacecraft guidance trajectory that takes into account uncertainty, in order to guarantee that mission safety constraints are satisfied with the required probability. The algorithm uses convex optimization to solve for the optimal trajectory. Convex optimization is amenable to onboard solution due to its excellent convergence properties. The algorithm is novel because, unlike prior approaches, it does not require time-consuming evaluation of multivariate probability densities. Instead, it uses a new mathematical bounding approach to ensure that probability constraints are satisfied, and it is shown that the resulting optimization is convex. Empirical results show that the approach is many orders of magnitude less conservative than existing set conversion techniques, for a small penalty in computation time.

Blackmore, Lars James↗

Benchmarking the Collocation Stand-Alone Library and Toolkit (CSALT)

This paper describes the processes and results of Verification and Validation (V&V) efforts for the Collocation Stand Alone Library and Toolkit (CSALT). We describe the test program and environments, the tools used for independent test data, and comparison results. The V&V effort employs classical problems with known analytic solutions, solutions from other available software tools, and comparisons to benchmarking data available in the public literature. Presenting all test results are beyond the scope of a single paper. Here we present high-level test results for a broad range of problems, and detailed comparisons for selected problems.

optimal control↗

Sensitivity of the Asteroid Redirect Robotic Mission (ARRM) to Launch Date and Asteroid Stay Time

National Aeronautics and Space Administrations (NASAs) proposed Asteroid Redirect Mission (ARM) is being designed to robotically capture and then redirect an asteroidal boulder mass into a stable orbit in the vicinity of the moon, where astronauts would be able to visit and study it. The current reference trajectory for the robotic portion, ARRM, assumes a launch on a Delta IV H in the end of the calendar year 2021, with a return for astronaut operations in cislunar space in 2026. The current baseline design allocates 245 days of stay time at the asteroid for operations and boulder collection. This paper outlines analysis completed by the ARRM mission design team to understand the sensitivity of the reference trajectory to launch date and asteroid stay time.

trajectory analysis↗

Optimal finite-thrust spacecraft trajectories using collocation and nonlinear programming

A new method is described for the determination of optimal spacecraft trajectories in an inverse-square field using finite, fixed thrust. The method employs a recently developed optimization technique which uses a piecewise polynomial representation for the state and controls, and collocation, thus converting the optimal control problem into a nonlinear programming problem, which is solved numerically. This technique has been modified to provide efficient handling of those portions of the trajectory which can be determined analytically, i.e., the coast arcs. Among the problems that have been solved using this method are optimal rendezvous and transfer (including multirevolution cases) and optimal multiburn orbit insertion from hyperbolic approach.

Enright, Paul J.↗

Calculation of free fall trajectories based on numerical optimization techniques

The development of a means of computing free-fall (nonthrusting) trajectories from one specified point in the solar system to another specified point in the solar system in a given amount of time was studied. The problem is that of solving a two-point boundary value problem for which the initial slope is unknown. Two standard methods of attack exist for solving two-point boundary value problems. The first method is known as the initial value or shooting method. The second method of attack for two-point boundary value problems is to approximate the nonlinear differential equations by an appropriate linearized set. Parts of both boundary value problem solution techniques described above are used. A complete velocity history is guessed such that the corresponding position history satisfies the given boundary conditions at the appropriate times. An iterative procedure is then followed until the last guessed velocity history and the velocity history obtained from integrating the acceleration history agree to some specified tolerance everywhere along the trajectory.

Source record↗

Flight Envelope Assessment of SmallSat Aerocapture Trajectories at Venus and Mars

Aerocapture is an increasingly studied orbit insertion concept for small satellite (SmallSat) missions beyond low Earth orbit (LEO). Compared to fully propulsive methods, aerocapture reduces the orbit-insertion propellant mass by approaching on a hyperbolic path and using the planetary atmosphere to reduce the vehicle’s velocity such that the final target orbit is achieved. This allows for an increase in payload mass delivered to orbit and a reduction in launch-to-orbit time. To analyze the feasibility at Venus and Mars, aerocapture flight envelope analysis is conducted by assessing the guidable trajectory space during atmospheric flight given entry conditions, vehicle properties, target parameters, and planet-dependent trajectory dispersions. The Program to Optimize Simulated Trajectories II (POST2) is used to simulate both ballistic and lifting aerocapture trajectories with SmallSat-compatible aeroshell designs. The entry flight path angle is optimized to achieve a final target orbit for lift up/down and max/min control configurations. When plotted, the resulting area between the steep and shallow trajectories forms a flight envelope with planet-dependent ±3σ atmospheric, aerodynamic, and delivery state dispersion profiles applied. The results presented in this paper show that SmallSat aerocapture is feasible for lifting aeroshell designs at Mars and Venus as well as ballistic vehicle designs at Mars.

Jack A. Joshi↗