Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamic programming algorithm”

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 289 records · Page 16

Simplified truss-beam modeling - Dynamic analysis

A model of the truss-beam has been developed and a set of algorithms provided to determine the flexibility matrix. Using lumped masses at the panel juncture, and applying the flexibility matrix in the equation of motion for the system, the dynamic characteristics are readily determined. An interactive computer program has been developed both in Basic and in Fortran for the IMB PC and other compatible micro-computers. This method is used to determine the lower natural frequencies of two truss-beams, and the results compared with those found by others.

Abu-Saba, Elias G.↗

Three-Dimensional Trajectory Design for Reducing Climate Impact of Trans-Atlantic Flights

The impact of aircraft emissions and contrails on the environment adds an additional aspect to aircraft trajectory optimization. This study developed a three-dimensional trajectory optimization algorithm for trans-Atlantic flights in cruise to generate aircraft trajectories that minimize environmental impacts due to CO2 emissions and contrails in the presence of winds. The climate-optimal trajectory is developed using dynamic programming that adjusts a wind-optimal aircraft heading while determining the optimal locations, altitudes and times for en-route step climbs. Flying wind-optimal routes minimize aircraft travel time, fuel burn and associated emissions during cruise while adjusting aircraft heading and en-route step climbs at the optimal locations and times minimize climate impact of contrails. This capability integrates an air traffic management simulation with aircraft fuel burn and emissions models, contrail formation and dispersion models, simplified climate response models, and a common climate metric. A study was conducted to evaluate the potential cost and benefits of flying climate-optimal routes in North Atlantic Airspace and their impacts to the Organized Track System design based on the trans-Atlantic air traffic during a day, July 12, 2012. Results show eastbound flights achieved a larger environmental benefit with less additional fuel burn than westbound flights that operated in strong headwinds that caused more additional fuel burn and aircraft emissions to avoid traversing contrails favorable regions.

climate impact of aviation↗

Performance Analysis of Magnetohydrodynamic Drag Modulation for Actively Controlled Aerocapture at Neptune

While the Ice Giants are a top priority for flagship missions in the NASA’s near-term future, current technologies limit the scientific payload and mission timeline for future Uranian and Neptunian missions due to the need for fuel for orbit insertion maneuvers. Thus, to maximize the scientific potential of future missions, atmospheric aerocapture has been heavily researched. While atmospheric aerocapture simulations have proven enabling for capturing around Neptune, its deep atmospheric pass requires an aeroshell with robust thermal protection systems (TPS). Magnetohydrodynamically-controlled aerocapture serves as a potential solution to the limitations of both fully propulsive orbit insertion and aerodynamically controlled aerocapture. Through NASA Langley’s high-fidelity flight dynamics simulation, the Program to Optimize Simulated Trajectories II, both the aerodynamic-only and magnetohydrodynamic aerocapture methods were simulated and compared for identical missions to Neptune. After applying an optimized numerical predictor-corrector guidance algorithm for both methods, the results showed that magnetohydrodynamics has not only the control authority to successfully capture around Neptune, but also the unique advantage of a shallower atmospheric pass, decreasing the maximum heat load and the required TPS mass.

Danny N. Nguyen↗

Flexible dynamic boundary microgrid operation considering network and load unbalances

Flexible microgrids with dynamic boundaries have recently been introduced in the literature. With the ability to reconfigure the topology of the microgrids dynamically through remotely controlled switches, flexible microgrids with dynamic boundaries can further improve the resiliency and energy efficiency of microgrids with distributed energy resources (DERs). This paper focuses on the optimal operation considering one of the predominant characteristics of microgrids and distribution systems – unbalanced networks and loads. In existing literature, balanced modeling of microgrids is more common due to its attractive simplicity. The three-phase power unbalance has not been considered as a constraint on the generation units in a microgrid. Further, negative sequence constraints have also been neglected. In this article, we propose a set of constraints that is specifically related to the capabilities of inverter interfaced resources to supply unbalanced current/power when the microgrid is islanded from the main distribution grid. We incorporate the new set of constraints into two optimization formulations leveraging two convex relaxations of the three-phase power flow equations: mixed-integer linear programming (MILP) and mixed-integer semidefinite programming (MISDP) that optimize the dispatch of controllable switches and DERs in the microgrid. The algorithms are then extended to networked microgrids with grid-forming sources. We test the algorithms on a realistic community microgrid model in Puerto Rico as well as standardized IEEE distribution test feeders. The testing results demonstrate the performance of the proposed algorithms. The MILP is fast and scalable, and the MISDP enforces the negative sequence voltage constraints.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Summary of research in applied mathematics, numerical analysis, and computer sciences

The major categories of current ICASE research programs addressed include: numerical methods, with particular emphasis on the development and analysis of basic numerical algorithms; control and parameter identification problems, with emphasis on effective numerical methods; computational problems in engineering and physical sciences, particularly fluid dynamics, acoustics, and structural analysis; and computer systems and software, especially vector and parallel computers.

Source record↗

Cumulative reports and publications through December 31, 1989

A complete list of reports from the Institute for Computer Applications in Science and Engineering (ICASE) is presented. The major categories of the current ICASE research program are: numerical methods, with particular emphasis on the development and analysis of basic numerical algorithms; control and parameter identification problems, with emphasis on effectual numerical methods; computational problems in engineering and the physical sciences, particularly fluid dynamics, acoustics, structural analysis, and chemistry; computer systems and software, especially vector and parallel computers, microcomputers, and data management. Since ICASE reports are intended to be preprints of articles that will appear in journals or conference proceedings, the published reference is included when it is available.

Source record↗

Robotic space simulation integration of vision algorithms into an orbital operations simulation

In order to successfully plan and analyze future space activities, computer-based simulations of activities in low earth orbit will be required to model and integrate vision and robotic operations with vehicle dynamics and proximity operations procedures. The orbital operations simulation (OOS) is configured and enhanced as a testbed for robotic space operations. Vision integration algorithms are being developed in three areas: preprocessing, recognition, and attitude/attitude rates. The vision program (Rice University) was modified for use in the OOS. Systems integration testing is now in progress.

Bochsler, Daniel C.↗

Nationwide Energy Saving Potential Evaluation for Office Buildings with Occupant-Based Building Controls

The heating ventilation and air-conditioning (HVAC) system is a major contributor to building energy consumption. This paper aims to quantify the nationwide energy savings potential of implementing the occupancy-based control (OBC) for the HVAC system in typical medium-sized office buildings using a whole building simulation program (i.e., EnergyPlus). First, the medium-sized office from the DOE Commercial Prototype Building Models was modified to have detailed layout and space functions. Then, a statistic-algorithm-based tool was used to generate the dynamic occupancy schedules for various rooms. Next, both a baseline case and two OBC cases were created for the comparison based on the updated ASHRAE Standard 90.1 and ASHRAE Guideline 36. The HVAC operation in the baseline case follows a static occupancy schedule and fixed setpoint schedules for both room air temperatures and minimal system outside air flowrates, while the proposed OBC cases use the room temperature reset, system minimum outdoor airflow reset, and zone minimal supply airflow rate reset. These cases were extended to five climate zones in the United States to further quantify the energy savings potential associated with the OBC on a nationwide scale. The preliminary result of this case study shows that there could be significant energy savings potential from the proposed OBC strategies in medium-sized office buildings in the United States.

Pang, Zhihong↗

Surface melting over the Greenland ice sheet from enhanced resolution passive microwave brightness temperatures (1979–2019)

Surface melting is a major component of the Greenland ice sheet (GrIS) surface mass balance, affecting sea level rise through direct runoff and the modulation on ice dynamics and hydrological processes, supraglacially, englacially and subglacially. Passive microwave (PMW) brightness temperature observations are of paramount importance in studying the spatial and temporal evolution of surface melting in view of their long temporal coverage (1979–to date) and high temporal resolution (daily). However, a major limitation of PMW datasets has been the relatively coarse spatial resolution, being historically of the order of tens of kilometres. Here, we use a newly released passive microwave dataset (37 GHz, horizontal polarization) made available through the NASA MeASUREs program to study the spatiotemporal evolution of surface melting over the GrIS at an enhanced spatial resolution of 3.125 Km. We assess the outputs of different detection algorithms through data collected by Automatic Weather Stations (AWS) and the outputs of the MAR regional climate model. We found that surface melting is well captured using a dynamic algorithm based on the outputs of MEMLS model, capable to detect sporadic and persistent melting. Our results indicate that, during the reference period 1979–2019 (1988–2019), surface melting over the GrIS increased in terms of both duration, up to ~4.5 (2.9) days per decade, and extension, up to 6.9 % (3.6 %) of the GrIS surface extent per decade, according to the MEMLS algorithm. Furthermore, the melting season has started up to ~4 (2.5) days earlier and ended ~7 (3.9) days later per decade. We also explored the information content of the enhanced resolution dataset with respect to the one at 25 km and MAR outputs through a semi-variogram approach. We found that the enhanced product is more sensitive to local scale processes, hence confirming the potential interest of this new enhanced product for studying surface melting over Greenland at a higher spatial resolution than the historical products and monitor its impact on sea level rise. This offers the opportunity to improve our understanding of the processes driving melting, to validate modelled melt extent at high resolution and potentially to assimilate this data in climate models.

Surface melting↗

Extending substructure based iterative solvers to multiple load and repeated analyses

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

Farhat, Charbel↗

Adaptive stabilization of quantum circuits executed on unstable devices

Conventional computers have evolved to device components that demonstrate failure rates of 10 −17 or less, while current quantum computing devices typically exhibit error rates of 10 −2 or greater. This raises concerns about the reliability and reproducibility of the results obtained from quantum computers. The problem is highlighted by experimental observation that today’s NISQ devices are inherently unstable. Remote quantum cloud servers typically do not provide users with an ability to calibrate the device themselves. Using inaccurate characterization data for error mitigation can have devastating impact on reproducibility. In this study, we investigate if one can infer the critical channel parameters dynamically from the noisy binary output of the executed quantum circuit and use it to improve program stability. An open question however is how well does this methodology scale. We discuss the efficacy and efficiency of our adaptive algorithm using canonical quantum circuits such as the uniform superposition circuit. Our metric of performance is the Hellinger distance between the post-stabilization observations and the reference (ideal) distribution.

Dasgupta, Samudra↗

NEXT Generation Energy Technologies for Connected and Automated On-Road Vehicles (NEXTCAR Phase I & II)

The Ohio State University’s ARPA-E NEXTCAR project was a multi-phase, multi-year research, development, and demonstration program focused on improving the energy efficiency of connected and automated vehicles (CAVs). The team developed and validated advanced vehicle motion and powertrain control algorithms that coordinate propulsion and automation systems to optimize energy use. Key technologies included Dynamic Skip Fire engine control, predictive eco-driving functions such as Eco-Approach and Departure (Eco-AND) and Eco-Adaptive Cruise Control (Eco-ACC), and powertrain-agnostic optimization frameworks for hybrid, plug-in hybrid, and battery electric vehicles. The project successfully demonstrated up to 30% energy-efficiency improvement during real-world testing at the Transportation Research Center and the American Center for Mobility. The outcomes provide a foundation for scalable, cost-effective deployment of energy-optimized CAV technologies across the automotive industry.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Real Time Predictive and Adaptive Hybrid Powertrain Control Development via Neuroevolution

The real-time application of powertrain-based predictive energy management (PrEM) brings the prospect of additional energy savings for hybrid powertrains. Torque split optimal control methodologies have been a focus in the automotive industry and academia for many years. Their real-time application in modern vehicles is, however, still lagging behind. While conventional exact and non-exact optimal control techniques such as Dynamic Programming and Model Predictive Control have been demonstrated, they suffer from the curse of dimensionality and quickly display limitations with high system complexity and highly stochastic environment operation. This paper demonstrates that Neuroevolution associated drive cycle classification algorithms can infer optimal control strategies for any system complexity and environment, hence streamlining and speeding up the control development process. Neuroevolution also circumvents the integration of low fidelity online plant models, further avoiding prohibitive embedded computing requirements and fidelity loss. This brings the prospect of optimal control to complex multi-physics system applications. The methodology presented here covers the development of the drive cycles used to train and validate the neurocontrollers and classifiers, as well as the application of the Neuroevolution process.

33 ADVANCED PROPULSION SYSTEMS↗

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.↗

Neural network error correction for solving coupled ordinary differential equations

A neural network is presented to learn errors generated by a numerical algorithm for solving coupled nonlinear differential equations. The method is based on using a neural network to correctly learn the error generated by, for example, Runge-Kutta on a model molecular dynamics (MD) problem. The neural network programs used in this study were developed by NASA. Comparisons are made for training the neural network using backpropagation and a new method which was found to converge with fewer iterations. The neural net programs, the MD model and the calculations are discussed.

Shelton, R. O.↗

A Change Impact Analysis to Characterize Evolving Program Behaviors

Change impact analysis techniques estimate the potential effects of changes made to software. Directed Incremental Symbolic Execution (DiSE) is an intraprocedural technique for characterizing the impact of software changes on program behaviors. DiSE first estimates the impact of the changes on the source code using program slicing techniques, and then uses the impact sets to guide symbolic execution to generate path conditions that characterize impacted program behaviors. DiSE, however, cannot reason about the flow of impact between methods and will fail to generate path conditions for certain impacted program behaviors. In this work, we present iDiSE, an extension to DiSE that performs an interprocedural analysis. iDiSE combines static and dynamic calling context information to efficiently generate impacted program behaviors across calling contexts. Information about impacted program behaviors is useful for testing, verification, and debugging of evolving programs. We present a case-study of our implementation of the iDiSE algorithm to demonstrate its efficiency at computing impacted program behaviors. Traditional notions of coverage are insufficient for characterizing the testing efforts used to validate evolving program behaviors because they do not take into account the impact of changes to the code. In this work we present novel definitions of impacted coverage metrics that are useful for evaluating the testing effort required to test evolving programs. We then describe how the notions of impacted coverage can be used to configure techniques such as DiSE and iDiSE in order to support regression testing related tasks. We also discuss how DiSE and iDiSE can be configured for debugging finding the root cause of errors introduced by changes made to the code. In our empirical evaluation we demonstrate that the configurations of DiSE and iDiSE can be used to support various software maintenance tasks

Rungta, Neha Shyam↗

A research program in advanced information systems

Topics addressed cover: identification of large space structure dynamics; special-purpose architectures for computational fluid dynamics; fault-tolerant processor architectures; data flow techniques; software specification and verification tools; management of software development; software environment for concurrent computing; and parallel algorithms and architectures for the solution of partial differential equations.

Vandervelde, Wallace E.↗