Search NASA⌕ Search

SEARCH · Search NASA

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 1,423 records · Page 79

C3PU:Real-Time Predictive Charge Control Software for Battery Management Systems (Code for Charge Control and Predictive Unit) [SWR-21-48]

C3PU sets up a model predictive control formulation for the optimal charging control of battery packs and can be deployed for real-time operation on an embedded microprocessor. C3PU uses electrochemical and thermal models of battery packs to predict the charging trajectories of the battery pack over a time horizon under different operating conditions. It then selects the optimal charging trajectory such that a pre-defined objective is minimized, which in the present state of the code is to minimize the charging duration of the battery pack. The optimal charging trajectory is obtained by solving an underlying mathematical problem. However, C3PU is flexible to incorporate other charging objectives. The underlying battery models can be swapped as well, as long as they follow certain mathematical properties. Mathematically, optimal control problems (in this case, optimally controlling the charging current of the battery pack) are computationally expensive. C3PU implements advanced numerical techniques, namely pseudo-spectral optimization, to reduce the computational burden of the underlying problem to solve. This allows for the problem to be solved in real-time in an embedded system. Once the optimal charging trajectory is computed over a time horizon, C3PU can package such data and send it out via appropriate communication protocols.

Mishra, Partha↗

Three Orbital Burns to Molniya Orbit Via Shuttle_Centaur G Upper Stage

An unclassified analytical trajectory design, performance, and mission study was done for the 1982 to 1986 joint National Aeronautics and Space Administration (NASA)-United States Air Force (USAF) Shuttle/Centaur G upper stage development program to send performance-demanding payloads to high orbits such as Molniya using an unconventional orbit transfer. This optimized three orbital burn transfer to Molniya orbit was compared to the then-baselined two burn transfer. The results of the three dimensional trajectory optimization performed include powered phase steering data and coast phase orbital element data. Time derivatives of the orbital elements as functions of thrust components were evaluated and used to explain the optimization's solution. Vehicle performance as a function of parking orbit inclination was given. Performance and orbital element data was provided for launch windows as functions of launch time. Ground track data was given for all burns and coasts including variation within the launch window. It was found that a Centaur with fully loaded propellant tanks could be flown from a 37 deg inclination low Earth parking orbit and achieve Molniya orbit with comparable performance to the baselined transfer which started from a 57 deg inclined orbit: 9,545 versus 9,552 lb of separated spacecraft weight, respectively. There was a significant reduction in the need for propellant launch time reserve for a 1 hr window: only 78 lb for the three burn transfer versus 320 lb for the two burn transfer. Conversely, this also meant that longer launch windows over more orbital revolutions could be done for the same amount of propellant reserve. There was no practical difference in ground tracking station or airborne assets needed to secure telemetric data, even though the geometric locations of the burns varied considerably. There was a significant adverse increase in total mission elapsed time for the three versus two burn transfer (12 vs. 1-1/4 hr), but could be accommodated by modest modifications to Centaur systems. Future applications were discussed. The three burn transfer was found to be a viable, arguably preferable, alternative to the two burn transfer.

Orbital trajectory design↗

Automated Design of Propellant-Optimal, End-to-End, Low-Thrust Trajectories for Trojan Asteroid Tours

The Sun-Jupiter Trojan asteroids are celestial bodies of great scientific interest as well as potential resources offering water and other mineral resources for longterm human exploration of the solar system. Previous investigations under this project have addressed the automated design of tours within the asteroid swarm. This investigation expands the current automation scheme by incorporating options for a complete trajectory design approach to the Trojan asteroids. Computational aspects of the design procedure are automated such that end-to-end trajectories are generated with a minimum of human interaction after key elements and constraints associated with a proposed mission concept are specified.

Trojan asteroid↗

Minimum deltaV Burn Planning for the International Space Station Using a Hybrid Optimization Technique, Level 1

The International Space Station's (ISS) trajectory is coordinated and executed by the Trajectory Operations and Planning (TOPO) group at NASA's Johnson Space Center. TOPO group personnel routinely generate look-ahead trajectories for the ISS that incorporate translation burns needed to maintain its orbit over the next three to twelve months. The burns are modeled as in-plane, horizontal burns, and must meet operational trajectory constraints imposed by both NASA and the Russian Space Agency. In generating these trajectories, TOPO personnel must determine the number of burns to model, each burn's Time of Ignition (TIG), and magnitude (i.e. deltaV) that meet these constraints. The current process for targeting these burns is manually intensive, and does not take advantage of more modern techniques that can reduce the workload needed to find feasible burn solutions, i.e. solutions that simply meet the constraints, or provide optimal burn solutions that minimize the total DeltaV while simultaneously meeting the constraints. A two-level, hybrid optimization technique is proposed to find both feasible and globally optimal burn solutions for ISS trajectory planning. For optimal solutions, the technique breaks the optimization problem into two distinct sub-problems, one for choosing the optimal number of burns and each burn's optimal TIG, and the other for computing the minimum total deltaV burn solution that satisfies the trajectory constraints. Each of the two aforementioned levels uses a different optimization algorithm to solve one of the sub-problems, giving rise to a hybrid technique. Level 2, or the outer level, uses a genetic algorithm to select the number of burns and each burn's TIG. Level 1, or the inner level, uses the burn TIGs from Level 2 in a sequential quadratic programming (SQP) algorithm to compute a minimum total deltaV burn solution subject to the trajectory constraints. The total deltaV from Level 1 is then used as a fitness function by the genetic algorithm in Level 2 to select the number of burns and their TIGs for the next generation. In this manner, the two levels solve their respective sub-problems separately but collaboratively until a burn solution is found that globally minimizes the deltaV across the entire trajectory. Feasible solutions can also be found by simply using the SQP algorithm in Level 1 with a zero cost function. This paper discusses the formulation of the Level 1 sub-problem and the development of a prototype software tool to solve it. The Level 2 sub-problem will be discussed in a future work. Following the Level 1 formulation and solution, several look-ahead trajectory examples for the ISS are explored. In each case, the burn targeting results using the current process are compared against a feasible solution found using Level 1 in the proposed technique. Level 1 is then used to find a minimum deltaV solution given the fixed number of burns and burn TIGs. The optimal solution is compared with the previously found feasible solution to determine the deltaV (and therefore propellant) savings. The proposed technique seeks to both improve the current process for targeting ISS burns, and to add the capability to optimize ISS burns in a novel fashion. The optimal solutions found using this technique can potentially save hundreds of kilograms of propellant over the course of the ISS mission compared to feasible solutions alone. While the software tool being developed to implement this technique is specific to ISS, the concept is extensible to other long-duration, central-body orbiting missions that must perform orbit maintenance burns to meet operational trajectory constraints.

Brown, Aaron J.↗

A comparison between onestep and other multiconic trajectory propagation methods

The paper presents an optimized version of the one-step multiconic method of spacecraft trajectory propagation in the presence of two attracting bodies. This method is compared to eleven other methods ranging from simple conic propagation to full integration of the equations of motion by applying the methods to a wide variety of test cases taken from planned space missions. This optimize one-step method is shown to be an order of magnitude better than other single-step methods for interplanetary and most lunar trajectories. Multistep multiconics methods and integration of the state offer another order of magnitude improvement, but at a proportionally higher cost and calculation time.

Kiedron, Krystyna↗

Halo Orbit Mission Correction Maneuvers Using Optimal Control

This paper addresses the computation of the required trajectory correction maneuvers (TCM) for a halo orbit space mission to compensate for the launch velocity errors introduced by inaccuracies of the launch vehicle.

Halo Orbit trajectory error correction optimal con↗

Autonomous Eco-Driving with Traffic Light and Lead Vehicle Constraints: An Application of Best Constrained Interpolation

Eco-Driving is a critical technology for improving automotive transportation efficiency. It is achieved by modifying the driving trajectory over a particular route to minimize required propulsion energy. Eco-Driving can be approached as an optimal control problem subject to driving constraints such as traffic lights and positions of other vehicles. Best interpolation in a strip is a problem in approximation theory and optimal control. The solution to this problem is a cubic spline. In this research, we demonstrate the connection between Eco-Driving and best interpolation in the strip. By exploiting this connection, we are able to generate optimal Eco-Driving trajectories that could be driven with an autonomous system. Using the simulation tool FASTSim, we can evaluate the trajectories using conventional, hybrid electric, and fully electric vehicle models. Our results quantify the energy efficiency improvements that can be achieved with the proposed approach.

Mahmoud, Yara Hazem↗

Autonomous Eco-Driving with Traffic Light and Lead Vehicle Constraints: An Application of Best Constrained Interpolation

Eco-Driving is a critical technology for improving automotive transportation efficiency. It is achieved by modifying the driving trajectory over a particular route to minimize required propulsion energy. Eco-Driving can be approached as an optimal control problem subject to driving constraints such as traffic lights and positions of other vehicles. Best interpolation in a strip is a problem in approximation theory and optimal control. The solution to this problem is a cubic spline. In this research, we demonstrate the connection between Eco-Driving and best interpolation in the strip. By exploiting this connection, we are able to generate optimal Eco-Driving trajectories that could be driven with an autonomous system. Using the simulation tool FASTSim, we can evaluate the trajectories using conventional, hybrid electric, and fully electric vehicle models. Our results quantify the energy efficiency improvements that can be achieved with the proposed approach.

Mahmoud, Yara Hazem↗

The primer vector in linear, relative-motion equations

Primer vector theory is used in analyzing a set of linear, relative-motion equations - the Clohessy-Wiltshire equations - to determine the criteria and necessary conditions for an optimal, N-impulse trajectory. Since the state vector for these equations is defined in terms of a linear system of ordinary differential equations, all fundamental relations defining the solution of the state and costate equations, and the necessary conditions for optimality, can be expressed in terms of elementary functions. The analysis develops the analytical criteria for improving a solution by (1) moving any dependent or independent variable in the initial and/or final orbit, and (2) adding intermediate impulses. If these criteria are violated, the theory establishes a sufficient number of analytical equations. The subsequent satisfaction of these equations will result in the optimal position vectors and times of an N-impulse trajectory. The solution is examined for the specific boundary conditions of (1) fixed-end conditions, two-impulse, and time-open transfer; (2) an orbit-to-orbit transfer; and (3) a generalized rendezvous problem. A sequence of rendezvous problems is solved to illustrate the analysis and the computational procedure.

Source record↗

Advances in hypersonic vehicle synthesis with application to studies of advanced thermal protection system

This report summarizes the work entitled 'Advances in Hypersonic Vehicle Synthesis with Application to Studies of Advanced Thermal Protection Systems.' The effort was in two areas: (1) development of advanced methods of trajectory and propulsion system optimization; and (2) development of advanced methods of structural weight estimation. The majority of the effort was spent in the trajectory area.

Ardema, Mark D.↗

Open-Loop Pitch Table Optimization for the Maximum Dynamic Pressure Orion Abort Flight Test

NASA has scheduled the retirement of the space shuttle orbiter fleet at the end of 2010. The Constellation program was created to develop the next generation of human spaceflight vehicles and launch vehicles, known as Orion and Ares respectively. The Orion vehicle is a return to the capsule configuration that was used in the Mercury, Gemini, and Apollo programs. This configuration allows for the inclusion of an abort system that safely removes the capsule from the booster in the event of a failure on launch. The Flight Test Office at NASA's Dryden Flight Research Center has been tasked with the flight testing of the abort system to ensure proper functionality and safety. The abort system will be tested in various scenarios to approximate the conditions encountered during an actual Orion launch. Every abort will have a closed-loop controller with an open-loop backup that will direct the vehicle during the abort. In order to provide the best fit for the desired total angle of attack profile with the open-loop pitch table, the table is tuned using simulated abort trajectories. A pitch table optimization program was created to tune the trajectories in an automated fashion. The program development was divided into three phases. Phase 1 used only the simulated nominal run to tune the open-loop pitch table. Phase 2 used the simulated nominal and three simulated off nominal runs to tune the open-loop pitch table. Phase 3 used the simulated nominal and sixteen simulated off nominal runs to tune the open-loop pitch table. The optimization program allowed for a quicker and more accurate fit to the desired profile as well as allowing for expanded resolution of the pitch table.

Stillwater, Ryan A.↗

Primer vector theory applied to the linear relative-motion equations

Prime vector theory is used in analyzing a set of linear relative-motion equations - the Clohessy-Wiltshire (C/W) equations - to determine the criteria and necessary conditions for an optimal N-impulse trajectory. The analysis develops the analytical criteria for improving a solution by: (1) moving any dependent or independent variable in the initial and/or final orbit, and (2) adding intermediate impulses. If these criteria are violated, the theory establishes a sufficient number of analytical equations. The subsequent satisfaction of these equations will result in the optimal position vectors and times of an N-impulse trajectory. The solution is examined for the specific boundary conditions of: (1) fixed-end conditions, two impulse, and time-open transfer; (2) an orbit-to-orbit transfer; and (3) a generalized renezvous problem.

Jezewski, D.↗

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

autonomuys vehicles↗

Global trajectory targeting via computer graphics

A technique is described in which the two-point boundary value problem (TPBVP) may be solved with the aid of interactive computer graphics. The particular TPBVP considered is the optimal electric propulsion space trajectory problem. An appropriate two-dimensional projection of the TPBVP mapping, or trajectory, is displayed on the computer's television screen, and a man-in-the-loop varies selected trajectory starting conditions in the fashion of a nonlinear walk until the viewed trajectory endpoint lies near a displayed target. Once global targeting is accomplished in this manner, program internal logic can easily handle local targeting to strongly solve the TPBVP.

Mann, F. I.↗

Air-breathing hypersonic vehicle guidance and control studies; An integrated trajectory/control analysis methodology: Phase 1

A tool which generates optimal trajectory/control histories in an integrated manner is generically adapted to the treatment of single-stage-to-orbit air-breathing hypersonic vehicles. The methodology is implemented as a two point boundary value problem solution technique. Its use permits an assessment of an entire near-minimum-fuel trajectory and desired control strategy from takeoff to orbit while satisfying physically derived inequality constraints and while achieving efficient propulsive mode phasing. A simpler analysis strategy that partitions the trajectory into several boundary condition matched segments is also included to construct preliminary trajectory and control history representations with less computational burden than is required for the overall flight profile assessment. A demonstration was accomplished using a tabulated example (winged-cone accelerator) vehicle model that is combined with a newly developed multidimensional cubic spline data smoothing routine. A constrained near-fuel-optimal trajectory, imposing a dynamic pressure limit of 1000 psf, was developed from horizontal takeoff to 20,000 ft/sec relative air speed while aiming for a polar orbit. Previously unspecified propulsive discontinuities were located. Flight regimes demanding rapid attitude changes were identified, dictating control effector and closed-loop controller authority was ascertained after evaluating effector use for vehicle trim. Also, inadequacies in vehicle model representations and specific subsystem models with insufficient fidelity were determined based on unusual control characteristics and/or excessive sensitivity to uncertainty.

Hattis, Philip D.↗

Optimum Interplanetary Rendezvous Trajectories With Powerlimited Vehicles

The optimum-thrust equations for both variable and constant thrust are presented. These thrust programs are used to generate rendezvous trajectories from the Earth to Mars for various flight times and launch dates during the years 1968-71. The manner in which the propulsion requirements vary with flight time and launch date are considered, and a comparison of vehicle performance using the variable- and constant-thrust programs is presented. The optimization of the pro- pulsion system parameters is discussed, and the existence of optimum launch dates is interpreted in terms of certain transversality conditions derivable from the calculus of variations. A brief comparison of the advanced propulsion vehicle and the ballistic vehicle propulsion requirements is made for Earth-Mars rendezvous trajectories. An appendix considering the analytical basis for this work is included.

INTERPLANETARY TRAJECTORY↗

Leveraging Multiple Connected Traffic Light Signals in an Energy-Efficient Speed Planner

Connecting automated vehicles to traffic lights can lead to significant energy savings by enabling them to pass through intersections in an energy-efficient way without unnecessary stops. A cellular-based communication system connecting multiple traffic lights can help realize the full potential of energy-efficient driving at intersections. Thus, we propose a hierarchical speed planner that can leverage information from multiple connected traffic lights. The proposed speed planner consists of two modules: a green window selector and a reference trajectory generator. The green window selector, based on Dijkstra’s algorithm, finds a series of "green windows" for connected traffic lights that builds an energy-optimal path for vehicles to follow. The reference trajectory generator finds optimal entering times, based on the selected green window at each intersection, and then computes reference trajectories. Deriving and using analytical optimal entering speeds as a function of entering times allows us to guarantee the computational simplicity suitable for real-time implementation. We also demonstrate how to balance energy and traffic flow perspectives in the reference trajectory generator. Lastly, a high-fidelity simulation framework is used to evaluate the proposed speed planner and quantify the extent to which it can save energy in various real-world urban route scenarios.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗