Optimization of data return from planetary missions by trajectory design.
Data return advantages of earth-Mars-earth flyby trajectories over more conventional Mars trajectories
SEARCH · Search NASA
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.
Data return advantages of earth-Mars-earth flyby trajectories over more conventional Mars trajectories
The design and analysis of on-demand mobility class vehicles will require thorough acoustic analysis to ensure that more numerous aircraft can operate in densely populated areas without causing excessive levels of noise. This work is a step towards a comprehensive ODM vehicle analysis capability. The authors use 6DOF equations of motion to model the electric quad-rotor concept developed by NASA's Revolutionary Vertical Lift Technologies program. As a first step towards acoustic analysis, this trajectory is coupled to an acoustic model that tracks the sound pressure level perceived by an acoustic observer on the ground. The results show that the approach is successful in finding trajectories that minimize total propulsive impulse while obeying limits imposed on the sound pressure level. Future work will involve adding acoustic analysis of increasing fidelity and tying the resulting trajectories to the performance of the electric propulsion system.
Simulation and Optimization of Rocket Trajectories program (SORT) contains comprehensive mathematical models for simulating aircraft dynamics, freely falling objects, and many types of ballistic trajectories. Provides high-fidelity, three-degrees-of-freedom simulation for atmospheric and exoatmospheric flight. It numerically models vehicle subsystems and vehicle environment. Used for wide range of simulations. Written in machine-independent FORTRAN 77.
Abort trajectories are optimized for human halo orbit missions about the translunar libration point (L2), with an emphasis on the use of free return trajectories. Optimal transfers from outbound free returns to L2 halo orbits are numerically optimized in the four-body ephemeris model. Circumlunar free returns are used for direct transfers, and cislunar free returns are used in combination with lunar gravity assists to reduce propulsive requirements. Trends in orbit insertion cost and flight time are documented across the southern L2 halo family as a function of halo orbit position and free return flight time. It is determined that the maximum amplitude southern halo incurs the lowest orbit insertion cost for direct transfers but the maximum cost for lunar gravity assist transfers. The minimum amplitude halo is the most expensive destination for direct transfers but the least expensive for lunar gravity assist transfers. The on-orbit abort costs for three halos are computed as a function of abort time and return time. Finally, an architecture analysis is performed to determine launch and on-orbit vehicle requirements for halo orbit missions.
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.
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.
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.
Space tug optimal round trip trajectories for payload earth escape injection missions, obtaining boundary value problem solution by Newton- Raphson iteration technique
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.
Explicit equations for steering Atlas-Centaur multistage launch vehicle to lunar trajectory
Discontinuities occurring in closed loop optimal control problems when using maximum principle
Dynamic programming and Pontryagin maximum principle
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.
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.
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.
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.
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.
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.