Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dynamic 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 379 records · Page 21

The Microgravity Vibration Isolation Mount: A Dynamic Model for Optimal Controller Design

Vibration acceleration levels on large space platforms exceed the requirements of many space experiments. The Microgravity Vibration Isolation Mount (MIM) was built by the Canadian Space Agency to attenuate these disturbances to acceptable levels, and has been operational on the Russian Space Station Mir since May 1996. It has demonstrated good isolation performance and has supported several materials science experiments. The MIM uses Lorentz (voice-coil) magnetic actuators to levitate and isolate payloads at the individual experiment/sub-experiment (versus rack) level. Payload acceleration, relative position, and relative orientation (Euler-parameter) measurements are fed to a state-space controller. The controller, in turn, determines the actuator currents needed for effective experiment isolation. This paper presents the development of an algebraic, state-space model of the MIM, in a form suitable for optimal controller design.

Hampton, R. David↗

Aeroelastic, CFD, and Dynamic Computation and Optimization for Buffet and Flutter Application

The work presented in this paper include: 'Coupled and Uncoupled Bending-Torsion Responses of Twin-Tail Buffet'; 'Fluid/Structure Twin Tail Buffet Response Over a Wide Range of Angles of Attack'; 'Resent Advances in Multidisciplinary Aeronautical Problems of Fluids/Structures/Dynamics Interaction'; and'Development of a Coupled Fluid/Structure Aeroelastic Solver with Applications to Vortex Breakdown induced Twin Tail Buffeting.

Kandil, Osama A.↗

Systems and methods for determining optimal parameters for dynamic quantum clustering analyses

In the present work, quantum clustering is extended to provide a dynamical approach for data clustering using a time-dependent Schrodinger equation. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering. Additionally, the parameters of the analysis can be modified in order to improve the efficiency of the dynamic quantum clustering processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Risk-Based Distributionally Robust Optimal Power Flow With Dynamic Line Rating

In this paper, we propose a risk-based data-driven distributionally robust approach to investigating the optimal power flow with dynamic line rating. The risk terms, including penalties for load shedding, wind generation curtailment and line overload, are embedded into the objective function. To robustify the solution, we consider a distributional uncertainty set based on the second-order moment, that captures the correlation between wind generation outputs and line ratings, and also the Wasserstein distance, that hedges against data perturbations. We show that the proposed model can be reformulated as a convex conic program. Approximations of the proposed model are suggested, which leads to a significant reduction of the number of the constraints. For practical large-scale test systems, a distributionally robust optimal power flow model with Wasserstein-distance-based distributional uncertainty set and its convex reformulation are also provided. Simulation results on the 5-bus, the IEEE 118-bus and the Polish 2736-bus test systems validate the effectiveness of the proposed models.

distributionally robust optimization↗

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some NP -hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.

Groër, Christopher S.↗

Optimal mitigation and control over power system dynamics for stochastic grid resilience

Optimal mitigation planning for highly disruptive contingencies to a transmission-level power system requires optimization with dynamic power system constraints, due to the key role of dynamics in system stability to major perturbations. We formulate a generalized disjunctive program to determine optimal grid component hardening choices for protecting against major failures, with differential algebraic constraints representing system dynamics (specifically, differential equations representing generator and load behavior and algebraic equations representing instantaneous power balance over the transmission system). We optionally allow stochastic optimal pre-positioning across all considered failure scenarios, and optimal emergency control within each scenario. This novel formulation allows, for the first time, analyzing the resilience interdependencies of mitigation planning, preventive control, and emergency control. Using all three strategies in concert is particularly effective at maintaining robust power system operation under severe contingencies, as we demonstrate on the western system coordinating council 9-bus test system using synthetic multi-device outage scenarios.

30 DIRECT ENERGY CONVERSION↗

Memristor design rules for dynamic learning and edge processing applications

The ability to dynamically learn and adapt to changes in the environment is one of the hallmarks of biological systems. In this work, we identify the subset of the design space of memristive materials that is optimal for dynamic learning applications. Using an architecture inspired on the learning center of the insect brain, we implement a model system consisting of a discrete implementation of spiking neurons where dynamic learning takes place on a set of plastic synapses formed by memristor pairs in a crossbar array. Using two separate benchmarks, one comprising the dynamic learning of the Modified National Institute of Standards and Technology dataset and another one targeting one shot learning, we have identified the key properties that memristive materials should have to be optimal dynamic learners. The results obtained show that a fine degree of control of the memristor internal state is key to achieve high classification accuracy during dynamic learning but that within this optimal region learning is extremely robust both to device variability and to errors in the writing of the internal state, in all cases allowing for 2 sigma variations greater than 40% without significant loss of accuracy, hence overcoming two of the perceived limitations of memristors. By additionally requiring that learning takes place concurrently to information processing, we are able to derive a set constraints to the memristor dynamics.

36 MATERIALS SCIENCE↗

Optimal discrete-time dynamic output-feedback design - A w-domain approach

An alternative method for optimal digital control design is described in this paper. The method is based on the usage of the w-transform and has many attractive design features. One of these is its immediate connection with frequency loop-shaping techniques that are now popular and effective for multivariable control synthesis in continuous-time domain. Furthermore, any design algorithms originally developed for continuous-time systems can now be immediately extended to the discrete-time domain. The main results presented in this paper are the exact problem formulation and solution of an optimal discrete-time dynamic output-feedback design in the w-domain involving a quadratic performance index to random disturbances. In addition, necessary conditions for optimality are obtained for the numerical solution of the optimal output-feedback compensator design. A numerical example is presented illustrating its application to the design of a low-order dynamic compensator in a stability augmentation system of a commercial transport.

Ha, Cheolkeun↗