Landing dynamics program for axisymmetric impact attenuating vehicles /LANDIT/
Computer program for predicting dynamic landing response characteristics of axisymmetric impact attenuating vehicles
Knoell, A. C.↗
SEARCH · Search NASA
Results for “Dynamic Programming”
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.
Optimal scheduling for profit maximization of energy storage merchants considering market impact based on dynamic programming
This paper analyzes how electricity merchants' market impact affects merchants' profit. Energy storage has long been studied for its role in maximizing profit, and merchant decisions are assumed to have no impact on market prices. However, the trading decisions of large-scale energy storage merchants (e.g., pumped storage hydro) will affect the market prices. This paper employs dynamic programming theory to investigate merchants' optimal economic dispatch considering the market impact and physical characteristics of storage systems. Our findings show that the State-of-Charge (SOC) based analytical solution significantly facilitates energy storage merchants' decision-making. The SOC range is segmented into three regions by two optimal SOC reference points, which depend on the available energy in storage, given prices, and market impact. By comparing the current storage SOC with the reference points, the merchant can get the corresponding optimal actions. We analytically show that if the merchant neglects the market impact on the power market, she will exaggerate her expected profit when the price-taker and price-maker merchants have the same generating and pumping upper limits offered to Independent System Operators (ISOs). Furthermore, the profit-maximizing merchant must, therefore, assay to balance the trade-off correctly between the intensity of market impact and the dispatched power. Our findings are verified by numerical simulation, and results demonstrate the ramifications for electricity merchants in energy arbitrage decisions.
25 ENERGY STORAGE↗
Eco-driving Profile Optimization by Dynamic Programming for Battery Electric Vehicles
Although full automation has not yet been achieved, automated vehicles are a valid research area. Not only would automated vehicles provide ultimate driver convenience, but they would maximize energy efficiency by eliminating undesired human driving behaviors and optimally controlling the powertrain. From the perspective of control related to energy saving, speed profile optimization is important for improving system efficiency and satisfying passenger demands. This study employs Dynamic Programming (DP) to solve the constrained optimal problem for travel time, distance, and speed limit by exploring all possible control options. The solutions obtained by DP demonstrate consistent control patterns combining four control modes-acceleration, cruising, coasting, and braking, with cruising or coasting being selective depending on the boundary conditions. Further, this study introduces DP-based simulation results and attempts to provide comprehensive interpretations of the optimal policy by analyzing the essential factors that affect the control problem, including boundary conditions, road load, and powertrain characteristics. Based on these interpretations, the control concepts can be explained as the optimal policy selecting the best control option based on system efficiency and boundary conditions. The results of DP are compared with a human-like driver model to show that the optimal speed profiles can effectively reduce energy consumption.
Autonomous vehicles↗
Optimal input design for aircraft parameter estimation using dynamic programming principles
A new technique was developed for designing optimal flight test inputs for aircraft parameter estimation experiments. The principles of dynamic programming were used for the design in the time domain. This approach made it possible to include realistic practical constraints on the input and output variables. A description of the new approach is presented, followed by an example for a multiple input linear model describing the lateral dynamics of a fighter aircraft. The optimal input designs produced by the new technique demonstrated improved quality and expanded capability relative to the conventional multiple input design method.
Klein, Vladislav↗
Optimal Input Design for Aircraft Parameter Estimation using Dynamic Programming Principles
A new technique was developed for designing optimal flight test inputs for aircraft parameter estimation experiments. The principles of dynamic programming were used for the design in the time domain. This approach made it possible to include realistic practical constraints on the input and output variables. A description of the new approach is presented, followed by an example for a multiple input linear model describing the lateral dynamics of a fighter aircraft. The optimal input designs produced by the new technique demonstrated improved quality and expanded capability relative to the conventional multiple input design method.
Morelli, Eugene A.↗
ddcMD: A fully GPU-accelerated molecular dynamics program for the Martini force field
We have implemented the Martini force field within Lawrence Livermore National Laboratory’s molecular dynamics program, ddcMD. The program is extended to a heterogeneous programming model so that it can exploit graphics processing unit (GPU) accelerators. In addition to the Martini force field being ported to the GPU, the entire integration step, including thermostat, barostat, and constraint solver, is ported as well, which speeds up the simulations to 278-fold using one GPU vs one central processing unit (CPU) core. A benchmark study is performed with several test cases, comparing ddcMD and GROMACS Martini simulations. The average performance of ddcMD for a protein–lipid simulation system of 136k particles achieves 1.04 µs/day on one NVIDIA V100 GPU and aggregates 6.19 µs/day on one Summit node with six GPUs. The GPU implementation in ddcMD offloads all computations to the GPU and only requires one CPU core per simulation to manage the inputs and outputs, freeing up remaining CPU resources on the compute node for alternative tasks often required in complex simulation campaigns.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Differential dynamic programming methods for solving bang-bang control problems.
Nonlinear bang-bang optimal control problems solution based on differential dynamic programming, noting use of Pontryagin adjoint variables
Jacobson, D. H.↗
Dynamic programming training period for an MSE adaptive equalizer.
A steepest descent variable step-size algorithm has been designed using dynamic programming for a mean-square-error adaptive equalizer. Additive noise and a constraint have been included. It is found that the new algorithm converges faster than the common fixed step-size algorithm.
Richman, S. H.↗
Dynamic programming and direct interaction for the optimum design of skeletal towers
A computer technique is proposed for automatically designing tower structures. Dynamic programming was used to find the optimum geometric configuration of the structural members, while the member sizes were proportioned by direct iteration. Tower structures are particularly suited to this method of automatic design since the rapidity of the analysis and design depends primarily upon substructuring. Substructuring of towers was comparatively simple because interaction between adjacent substructures is simulated with reasonable accuracy. Typical examples are presented to illustrate the method.
Howell, G. C.↗
Accumulator Sizing for the Hybrid Hydraulic Electric Architecture (HHEA) Using Dynamic Programming
Abstract The Hybrid Hydraulic Electric Architecture (HHEA) is an approach to electrifying and improving that does not require very large electric machines. The majority power is provided hydraulically via a set of common pressure rails while small electric machines are used to modulate that power to meet exact demand. Each common pressure rail has an accumulator, which keeps the pressure of each rail near constant as long as the volume in the accumulator does not change much. A main pump adds or removes fluid from each accumulator as needed to reduce volume changes in the accumulators. It is the operation of this main pump which is investigated here. In previous analysis it was assumed that the size of the accumulators was large enough to account for any difference in fluid volume without significantly changing the pressure. In this paper, the required accumulator sizes are studied using a dynamic programming approach. At each time step the inlet and outlet of the main pump could be connected to any of the common pressure rails. These decisions for the main pump were optimized to minimize the required accumulator size. Case studies are conducted using drive cycles from a 22-ton excavator, a 20-ton wheel loader and a 5-ton excavator. The machines could be operated with total accumulator sizes of less than 20, 10, and 5 liters respectively. Required accumulator size was found to vary with pump flow rate, the frequency at which the pump/motor was able to change operating conditions, the tolerance level of pressure deviation and the accumulator’s polytropic index.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Multi-mesh gear dynamics program evaluation and enhancements
A multiple mesh gear dynamics computer program was continually developed and modified during the last four years. The program can handle epicyclic gear systems as well as single mesh systems with internal, buttress, or helical tooth forms. The following modifications were added under the current funding: variable contact friction, planet cage and ring gear rim flexibility options, user friendly options, dynamic side bands, a speed survey option and the combining of the single and multiple mesh options into one general program. The modified program was evaluated by comparing calculated values to published test data and to test data taken on a Hamilton Standard turboprop reduction gear-box. In general, the correlation between the test data and the analytical data is good.
Boyd, L. S.↗
A new method of optimal design for a two-dimensional diffuser by using dynamic programming
A new method for predicting the optimal velocity distribution on the wall of a two dimensional diffuser is presented. The method uses dynamic programming to solve the optimal control problem with inequality constraints of state variables. The physical model of optimization is designed to prevent the separation of the boundary layer while approaching the maximum pressure ratio in a diffuser of a specified length. The computational results are in fair agreement with the experimental ones. Optimal velocity distribution on a diffuser wall is said to occur when the flow decelerates quickly at first and then smoothly, while the flow is near separation, but always protected from it. The optimal velocity distribution can be used to design the contour of the diffuser.
Gu, Chuangang↗
Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae
The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as input. The generated algorithm runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula.
Rosu, Grigore↗
Langley rotorcraft structural dynamics program: Background, status, accomplishments, plans
Excessive vibration is the most common technical problem to arise as a show stopper in the development of a new rotorcraft. Vibration predictions have not been relied on by the industry during design because of deficiencies in finite element dynamic analyses. A rotorcraft structural dynamics program aimed at meeting the industry's long-term needs in this key technical area was implemented at Langley in 1984. The subject program is a cooperative effort involving NASA, the Army, academia, and the helicopter industry in a series of generic research activities directed at establishing the critical elements of the technology base needed for development of a superior finite element dynamics design analysis capability in the U.S. helicopter industry. An executive overview of the background, status, accomplishments, and future direction of this program is presented.
Kvaternik, Raymond G.↗
Computational Fluid Dynamics Program at NASA Ames Research Center
The Computational Fluid Dynamics (CFD) Program at NASA Ames Research Center is reviewed and discussed. The technical elements of the CFD Program are listed and briefly discussed. These elements include algorithm research, research and pilot code development, scientific visualization, advanced surface representation, volume grid generation, and numerical optimization. Next, the discipline of CFD is briefly discussed and related to other areas of research at NASA Ames including experimental fluid dynamics, computer science research, computational chemistry, and numerical aerodynamic simulation. These areas combine with CFD to form a larger area of research, which might collectively be called computational technology. The ultimate goal of computational technology research at NASA Ames is to increase the physical understanding of the world in which we live, solve problems of national importance, and increase the technical capabilities of the aerospace community. Next, the major programs at NASA Ames that either use CFD technology or perform research in CFD are listed and discussed. Briefly, this list includes turbulent/transition physics and modeling, high-speed real gas flows, interdisciplinary research, turbomachinery demonstration computations, complete aircraft aerodynamics, rotorcraft applications, powered lift flows, high alpha flows, multiple body aerodynamics, and incompressible flow applications. Some of the individual problems actively being worked in each of these areas is listed to help define the breadth or extent of CFD involvement in each of these major programs. State-of-the-art examples of various CFD applications are presented to highlight most of these areas. The main emphasis of this portion of the presentation is on examples which will not otherwise be treated at this conference by the individual presentations. Finally, a list of principal current limitations and expected future directions is given.
Holst, Terry L.↗
Parallel solution of sparse one-dimensional dynamic programming problems
Parallel computation offers the potential for quickly solving large computational problems. However, it is often a non-trivial task to effectively use parallel computers. Solution methods must sometimes be reformulated to exploit parallelism; the reformulations are often more complex than their slower serial counterparts. We illustrate these points by studying the parallelization of sparse one-dimensional dynamic programming problems, those which do not obviously admit substantial parallelization. We propose a new method for parallelizing such problems, develop analytic models which help us to identify problems which parallelize well, and compare the performance of our algorithm with existing algorithms on a multiprocessor.
Nicol, David M.↗
A variational dynamic programming approach to robot-path planning with a distance-safety criterion
An approach to robot-path planning is developed by considering both the traveling distance and the safety of the robot. A computationally-efficient algorithm is developed to find a near-optimal path with a weighted distance-safety criterion by using a variational calculus and dynamic programming (VCDP) method. The algorithm is readily applicable to any factory environment by representing the free workspace as channels. A method for deriving these channels is also proposed. Although it is developed mainly for two-dimensional problems, this method can be easily extended to a class of three-dimensional problems. Numerical examples are presented to demonstrate the utility and power of this method.
Suh, Suk-Hwan↗
Control of Fractional Diffusion Problems via Dynamic Programming Equations
In this study, we explore the approximation of feedback control of integro-differential equations containing a fractional Laplacian term. To obtain feedback control for the state variable of this nonlocal equation, we use the Hamilton–Jacobi–Bellman equation. It is well known that this approach suffers from the curse of dimensionality, and to mitigate this problem we couple semi-Lagrangian schemes for the discretization of the dynamic programming principle with the use of Shepard approximation. This coupling enables approximation of high-dimensional problems. Numerical convergence toward the solution of the continuous problem is provided together with linear and nonlinear examples. The robustness of the method with respect to disturbances of the system is illustrated by comparisons with an open-loop control approach.
97 MATHEMATICS AND COMPUTING↗