Optimal nonlinear dynamic sparse model selection and Bayesian parameter estimation for nonlinear systems
Not provided.
Computer Science↗
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.
Dynamics Informed Optimization for Resilient Energy Systems
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 (WSCC) 9-bus test system using synthetic multi-device outage scenarios. Towards integrating our modeling framework with real threats and more realistic power systems, we explore applying hybrid dynamics to power systems. Our work is applied to basic RL circuits with the ultimate goal of using the methodology to model protective tripping schemes in the grid. Finally, we survey mitigation techniques for HEMP threats and describe a GIS application developed to create threat scenarios in a grid with geographic detail.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Time Optimal Trajectory Planning in Dynamic Environments
A method is presented for planning the motion of a robot in a dynamic environment by computing a trajectory that avoids all obstacles and that satisfies the robot dynamics and its actuator constraints. This method consists of two steps -- the computation of the trajectory and its refinement with a dynamic optimization.
Robotics Velocity Obstacle↗
On the design of optimal constrained dynamic compensators for linear constant systems
Optimal fixed dimensionality dynamic compensator design for linear time-invariant closed-loop system based on quadratic cost and gain criteria
Athans, M.↗
Computing methods in optimization problems - Gradient methods for the optimization of dynamic system parameters by hybrid computation
Gradient methods for optimization of dynamic system parameters by hybrid computation
HYBRID COMPUTER↗
Optimizing a dynamical decoupling protocol for solid-state electronic spin ensembles in diamond
In this study, we demonstrate significant improvements of the spin coherence time of a dense ensemble of nitrogen-vacancy (NV) centers in diamond through optimized dynamical decoupling (DD). Cooling the sample down to 77 K suppresses longitudinal spin relaxation T 1 effects and DD microwave pulses are used to increase the transverse coherence time T 2 from ~0.7ms up to ~30ms. Furthermore, we extend previous work of single-axis (Carr-Purcell-Meiboom-Gill) DD towards the preservation of arbitrary spin states. Following a theoretical and experimental characterization of pulse and detuning errors, we compare the performance of various DD protocols. We also identify that the optimal control scheme for preserving an arbitrary spin state is a recursive protocol, the concatenated version of the XY8 pulse sequence. The improved spin coherence might have an immediate impact on improvements of the sensitivities of ac magnetometry. Moreover, the protocol can be used on denser diamond samples to increase coherence times up to NV-NV interaction time scales, a major step towards the creation of quantum collective NV spin states.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Thermal energy storage to minimize cost and improve efficiency of a polygeneration district energy system in a real-time electricity market
District energy systems can produce low-cost utilities for large energy networks, but can also be a resource for the electric grid by their ability to ramp production or to store thermal energy by responding to real-time market signals. In this work, dynamic optimization exploits the flexibility of thermal energy storage by determining optimal times to store and extract excess energy. This concept is applied to a polygeneration distributed energy system with combined heat and power, district heating, district cooling, and chilled water thermal energy storage. The system is a university campus responsible for meeting the energy needs of tens of thousands of people. The objective for the dynamic optimization problem is to minimize cost over a 24-h period while meeting multiple loads in real time. The paper presents a novel algorithm to solve this dynamic optimization problem with energy storage by decomposing the problem into multiple static mixed-integer nonlinear programming (MINLP) problems. Another innovative feature of this work is the study of a large, complex energy network which includes the interrelations of a wide variety of energy technologies. Results indicate that a cost savings of 16.5% is realized when the system can participate in the wholesale electricity market.
25 ENERGY STORAGE↗
Fast dynamic aperture optimization with forward-reversal integration
A fast dynamic aperture (DA) optimization method for storage rings has been developed through the use of reversal integration. Even if dynamical systems have an exact reversal symmetry, a numerical forward integration differs from its reversal. For a chaotic trajectory, cumulative round-off errors are scaled, which results in an exponential growth on the difference. The exponential effect is a generic chaos indicator which represents the sensitivity of the chaotic motion to its initial condition. The chaos indicator of the charged particle motion can be obtained by comparing the forward integrations of particle trajectories with corresponding reversals, a.k.a. “backward integrations.” The indicator is observable even through short-term particle tracking simulations. Therefore, adopting it as an objective function could speed up optimization. Finally, the DA of the National Synchrotron Light Source II storage ring, and another test diffraction-limited light source ring, were optimized using this method for the purpose of demonstration.
43 PARTICLE ACCELERATORS↗
Multi-objective dynamic aperture optimization for storage rings
We report an efficient dynamic aperture (DA) optimization approach using multiobjective genetic algorithm (MOGA), which is driven by nonlinear driving terms computation. It was found that having small low order driving terms is a necessary but insufficient condition of having a decent DA. Then direct DA tracking simulation is implemented among the last generation candidates to select the best solutions. The approach was demonstrated successfully in optimizing NSLS-II storage ring DA.
43 PARTICLE ACCELERATORS↗
Fast Dynamic Aperture Optimization with Reversal Integration
A fast method for dynamic aperture (DA) optimization of storage rings has been developed through the use of reversal integration. Even if dynamical systems have an exact reversal symme- try, a numerical forward integration di ers from its reversal. For chaotic trajectories, cumulative round-o errors are scaled, which results in an exponential growth in the di erence. The exponential e ect, intrinsically associated with the Lyapunov exponent, is a generic indicator of chaos because it represents the sensitivity of chaotic motion to an initial condition. A chaos indicator of the charged particle motion is then obtained by comparing the forward integrations of particle trajectories with corresponding reversals, a.k.a. \backward integrations." The indicator was con rmed to be ob- servable through short-term particle tracking simulations. Therefore, adopting it as an objective function could speed up optimization. The DA of the National Synchrotron Light Source II storage ring, and another test di raction-limited light source ring, were optimized using this method for the purpose of demonstration.
36 MATERIALS SCIENCE↗
Topology optimization of finite strain viscoplastic systems under transient loads [Dynamic topology optimization based on finite strain visco-plasticity]
In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capability of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.
42 ENGINEERING↗
Optimal, centralized dynamic curbside parking space zoning
In this paper we formulate a dynamic mixed integer program for optimally zoning curbside parking spaces subject to transportation policy-inspired constraints and regularization terms. First, we illustrate how given some objective of curb zoning valuation as a function of zone type (paid parking, bus stop, etc.), dynamically rezoning involves unrolling this optimization program over a fixed time horizon. Second, we implement two different solution methods given an example curb zoning valuation. In the first method, we solve long horizon dynamic zoning problems via approximate dynamic programming. In the second method, we employ Dantzig-Wolfe decomposition to break-up the mixed-integer program into a master problem and several sub-problems that can be solved in parallel. This speeds up the computational solve-time of the MIP considerably. We present simulation results and comparisons of the different employed techniques on vehicle arrival-rate data obtained for a neighborhood in downtown Seattle, Washington, USA.
Nazir, Mohammad Nawaf↗
Synthesis of Optimal Nonlinear Feedback Laws for Dynamic Systems Using Neural Networks
Open-loop solutions of dynamical optimization problems can be numerically computed usingexisting software packages. The computed time histories of the state and control variables, formultiple sets of end conditions can then be used to train a neural network to 'recognize' the optimal,nonlinear feedback relation between the states and controls of the system. The 'learned' network canthen be used to output an approximate optimal control given a full set (or a partial set) of measuredsystem states. With simple neural networks, we have successfully demonstrated the efficacy of theproposed approach using a minimum-time orbit injection problem. The usefulness and limitations ofthis novel approach on real-life optimal guidance and control problems, with many state and control variables as well as path inequality constraints, remain to be seen.
Orbit injection problem↗
Gradient methods for the optimization of dynamic system parameters by hybrid computation.
Computer implementation of gradient method in continuous and discrete optimization of dynamic system
DISCRETE FUNCTION↗
Optimal demand response scheduling of an industrial air separation unit using data-driven dynamic models
Not provided.
Computer Science↗
Nuclear–Electronic Orbital QM/MM Approach: Geometry Optimizations and Molecular Dynamics
Hybrid quantum mechanical/molecular mechanical (QM/MM) methods allow simulations of chemical reactions in atomistic solvent and heterogeneous environments such as proteins. Herein, the nuclear–electronic orbital (NEO) QM/MM approach is introduced to enable the quantization of specified nuclei, typically protons, in the QM region using a method such as NEO-density functional theory (NEO-DFT). This approach includes proton delocalization, polarization, anharmonicity, and zero-point energy in geometry optimizations and dynamics. Expressions for the energies and analytical gradients associated with the NEO-QM/MM method, as well as the previously developed polarizable continuum model (NEO-PCM), are provided. Geometry optimizations of small organic molecules hydrogen bonded to water in either dielectric continuum solvent or explicit atomistic solvent illustrate that aqueous solvation can strengthen hydrogen-bonding interactions for the systems studied, as indicated by shorter intermolecular distances at the hydrogen-bond interface. We then performed a real-time direct dynamics simulation of a phenol molecule in explicit water using the NEO-QM/MM method. Furthermore, these developments and initial examples provide the foundation for future studies of nuclear–electronic quantum dynamics in complex chemical and biological environments.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Human motion planning based on recursive dynamics and optimal control techniques
This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A quasi-Newton nonlinear programming technique (super-linear convergence) is implemented to solve minimum torque-based human motion-planning problems. The explicit analytical gradients needed in the dynamics are derived using a matrix exponential formulation and Lie algebra. Cubic spline functions are used to make the search space for an optimal solution finite. Based on our formulations, our method is well conditioned and robust, in addition to being computationally efficient. To better illustrate the efficiency of our method, we present results of natural looking and physically correct human motions for a variety of human motion tasks involving open and closed loop kinematic chains.
Non-NASA Center↗
A Formal Approach to Empirical Dynamic Model Optimization and Validation
A framework was developed for the optimization and validation of empirical dynamic models subject to an arbitrary set of validation criteria. The validation requirements imposed upon the model, which may involve several sets of input-output data and arbitrary specifications in time and frequency domains, are used to determine if model predictions are within admissible error limits. The parameters of the empirical model are estimated by finding the parameter realization for which the smallest of the margins of requirement compliance is as large as possible. The uncertainty in the value of this estimate is characterized by studying the set of model parameters yielding predictions that comply with all the requirements. Strategies are presented for bounding this set, studying its dependence on admissible prediction error set by the analyst, and evaluating the sensitivity of the model predictions to parameter variations. This information is instrumental in characterizing uncertainty models used for evaluating the dynamic model at operating conditions differing from those used for its identification and validation. A practical example based on the short period dynamics of the F-16 is used for illustration.
Crespo, Luis G↗