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 649 records · Page 36

PROGRESS ON THE INTERACTION REGION DESIGN AND DETECTOR INTEGRATION AT JLAB'S MEIC

One of the unique features of JLab's Medium-energy Electron-Ion Collider (MEIC) is a full-acceptance detector with a dedicated, small-angle, high-resolution detection system, capable of covering a wide range of momenta (and charge-to-mass ratios) with respect to the original ion beam to enable access to new physics. We present an interaction region design developed with close integration of the detection and beam dynamical aspects. The dynamical aspect of the design rests on a symmetry-based concept for compensation of non-linear effects. The optics and geometry have been optimized to accommodate the detection requirements and to ensure the interaction region's modularity for ease of integration into the collider ring lattices. As a result, the design offers an excellent detector performance combined with the necessary provisions for non-linear dynamical optimization.

Morozov, Vasiliy↗

Multibody for Everybody (M4E): A Symbolic Dynamics Modeling Tool with Applications in Simulation, Control, and Optimization

Developing the analytical model of a multibody system is often the initial step in control and optimization. The analytical model (equations of motion) describes a system’s time evolution under specified forcing conditions. Although developing these equations is easy for simple systems, this process becomes more complex for systems composed of multiple bodies. Deriving equations of motion for complex multibody systems requires specialized expertise in multibody dynamics, is time-consuming, and is susceptible to error. To address this issue, this paper presents an open-source, easy-to-use, systematic framework to derive symbolic equations of motion in both Python and MATLAB using the joint coordinate formulation. This formulation results in a set of ordinary differential equations that use the minimum set of coordinates needed to model a system. The symbolic representation provides better insight into the influence of design parameters on system performance, facilitates sensitivity analysis and parameter studies, and supports direct implementation of control and optimization routines. The tool enables numerical simulation for specified parameter sets, is modular for straightforward integration with other tools and libraries, and allows incorporation of hydrodynamics, mooring, and other external forces. The result is a reproducible, extensible pipeline for modeling, simulation, and design of complex multibody systems. The proposed tool is versatile and can be applied to domains such as robotics, control, and design. In addition, we integrated external libraries that provide capabilities for modeling offshore systems such as underwater robots and marine energy converters.

16 TIDAL AND WAVE POWER↗

Accelerating Radiation Computations for Dynamical Models With Targeted Machine Learning and Code Optimization

Abstract Atmospheric radiation is the main driver of weather and climate, yet due to a complicated absorption spectrum, the precise treatment of radiative transfer in numerical weather and climate models is computationally unfeasible. Radiation parameterizations need to maximize computational efficiency as well as accuracy, and for predicting the future climate many greenhouse gases need to be included. In this work, neural networks (NNs) were developed to replace the gas optics computations in a modern radiation scheme (RTE+RRTMGP) by using carefully constructed models and training data. The NNs, implemented in Fortran and utilizing BLAS for batched inference, are faster by a factor of 1–6, depending on the software and hardware platforms. We combined the accelerated gas optics with a refactored radiative transfer solver, resulting in clear‐sky longwave (shortwave) fluxes being 3.5 (1.8) faster to compute on an Intel platform. The accuracy, evaluated with benchmark line‐by‐line computations across a large range of atmospheric conditions, is very similar to the original scheme with errors in heating rates and top‐of‐atmosphere radiative forcings typically below 0.1 K day −1 and 0.5 W m −2 , respectively. These results show that targeted machine learning, code restructuring techniques, and the use of numerical libraries can yield material gains in efficiency while retaining accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal Control for the Quantum Simulation of Nuclear Dynamics

We propose a method for enacting the unitary time propagation of two interacting neutrons at leading order of chiral effective-field theory by efficiently encoding the nuclear dynamics into a single multilevel quantum device. The emulated output of the quantum simulation shows that, by applying a single gate that draws on the underlying characteristics of the device, it is possible to observe multiple cycles of the nuclear dynamics before the onset of decoherence. Owing to the signal's longevity, we can then extract spectroscopic properties of the simulated nuclear system. This allows us to validate the encoding of the nuclear Hamiltonian and the robustness of the simulation in the presence of quantum-hardware noise by comparing the extracted spectroscopic information to exact calculations. This work paves the way for transformative calculations of the dynamical properties of nuclei on near-term quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An application of different dioids in public key cryptography

Dioids provide a natural framework for analyzing a broad class of discrete event dynamical systems such as the design and analysis of bus and railway timetables, scheduling of high-throughput industrial processes, solution of combinatorial optimization problems, the analysis and improvement of flow systems in communication networks. They have appeared in several branches of mathematics such as functional analysis, optimization, stochastic systems and dynamic programming, tropical geometry, fuzzy logic. In this paper we show how to involve dioids in public key cryptography. The main goal is to create key – exchange protocols based on dioids. Additionally the digital signature scheme is presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗

Topology optimization beyond linear elasticity

Complex, non-linear path-dependent and transient response of engineering structures can today be numerically modeled with good accuracy. For linear systems, this modeling has successfully been combined with computational design optimization for many years. The combination of non-linear modeling and numerical design optimization is far less established. In the present paper we discuss some recent steps taken to close the gap between the use of linear and non-linear modeling with numerical optimization. Examples with nonlinear elasticity, finite strain plasticity and dynamic modeling combined with topology optimization are discussed.

42 ENGINEERING↗

Optimal control landscape for the generation of unitary transformations with constrained dynamics

The reliable and precise generation of quantum unitary transformations is essential for the realization of a number of fundamental objectives, such as quantum control and quantum information processing. Prior work has explored the optimal control problem of generating such unitary transformations as a surface-optimization problem over the quantum control landscape, defined as a metric for realizing a desired unitary transformation as a function of the control variables. It was found that under the assumption of nondissipative and controllable dynamics, the landscape topology is trap free, which implies that any reasonable optimization heuristic should be able to identify globally optimal solutions. The present work is a control landscape analysis, which incorporates specific constraints in the Hamiltonian that correspond to certain dynamical symmetries in the underlying physical system. It is found that the presence of such symmetries does not destroy the trap-free topology. These findings expand the class of quantum dynamical systems on which control problems are intrinsically amenable to a solution by optimal control.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast, Dynamic, and Scalable Algorithms for Large-Scale Constrained Optimization

Scientists and engineers constantly aim to optimize an objective subject to physical, environmental, and/or resource constraints. The technique of using mathematical models to formulate and find real solutions of such problems is known as mathematical optimization, a process that has become invaluable for design and discovery in numerous scientific fields. This project has focused on the design, analysis, and implementation of high-performance computing algorithms for solving cutting-edge optimization problems. These include problems that involve (1) data uncertainties, such as those in the future supply, demand, and capacity of a given power system, (2) extreme numbers of alternatives, such as in the design of electrical power grids to avoid network vulnerabilities, and (3) real-time decisions, such as in the control of chemical reactors. The key features of the new algorithms are that they are fast, dynamic, and scalable to meet the computational requirements of scientists and researchers working to optimize large-scale, complex systems. The algorithms that have been designed, analyzed, and tested as part of the project can be characterized based on the types of optimization problems they have been designed to solve. Much of the work has focused on algorithms for solving large-scale constrained optimization problems. Contributions have also been made in the design of algorithms for unconstrained optimization, with some specialized methods for solving problems that have inherent nonsmoothness. Contributions have also been made in areas that have grown to prominence in the field over the five-year award period. These include the design of algorithms for solving large-scale stochastic optimization problems, such as those that arise in large-scale machine learning, and in complexity analyses for solving nonconvex problems, which has been a focal point of much recent work in continuous optimization. Overall, the project has supported work that has led to almost 30 articles that have been published or accepted to top journals in the field of mathematical optimization.

97 MATHEMATICS AND COMPUTING↗

Characterization of the mean flow field in the far wake region behind ocean current turbines

Herein this paper forms, optimizes, and evaluates three numerical approaches for characterizing mean velocities in far wake region behind ocean current turbines. These approaches are derived from wake models originally developed for wind turbines and are referred here as the Larsen/Larsen, Larsen/Ainslie, and Jensen/Ainslie approaches based on the researchers originally credited with developing the expressions for dependence of the mean wake velocity on centerline and/or radial locations. The numerical coefficients utilized by these approaches are optimized to best match Computational fluid dynamics (CFD) generated wake velocity data. After optimizing the coefficients, this study finds that the Larsen/Ainslie and Jensen/Ainslie approaches best match the CFD generated flow data, with Larsen/Ainslie being the best match for an ambient turbulence intensity (TI) of 3% and Jensen/Ainslie being the best match for TIs of 6 and 9%.

16 TIDAL AND WAVE POWER↗

Layer-Parallel Training of Deep Residual Neural Networks

Residual neural networks (ResNets) are a promising class of deep neural networks that have shown excellent performance for a number of learning tasks, e.g., image classification and recognition. Mathematically, ResNet architectures can be interpreted as forward Euler discretizations of a nonlinear initial value problem whose time-dependent control variables represent the weights of the neural network. Hence, training a ResNet can be cast as an optimal control problem of the associated dynamical system. For similar time-dependent optimal control problems arising in engineering applications, parallel-in-time methods have shown notable improvements in scalability. This paper demonstrates the use of those techniques for efficient and effective training of ResNets. The proposed algorithms replace the classical (sequential) forward and backward propagation through the network layers with a parallel nonlinear multigrid iteration applied to the layer domain. This adds a new dimension of parallelism across layers that is attractive when training very deep networks. From this basic idea, we derive multiple layer-parallel methods. The most efficient version employs a simultaneous optimization approach where updates to the network parameters are based on inexact gradient information in order to speed up the training process. Finally, using numerical examples from supervised classification, we demonstrate that the new approach achieves a training performance similar to that of traditional methods, but enables layer-parallelism and thus provides speedup over layer-serial methods through greater concurrency.

97 MATHEMATICS AND COMPUTING↗

Integrated Optimization of Powertrain Energy Management and Vehicle Motion Control for Autonomous Hybrid Electric Vehicles

Hybrid Electric Vehicles (HEVs) and autonomous vehicles have been widely studied recently for on-road transportation. In the study of autonomous HEVs, the control of the vehicle's external dynamics and powertrain dynamics are often treated separately. Optimizing these two problems together can significantly improve fuel economy. In this paper, an autonomous HEV following a leader is considered. First, the augmented model to integrate the abovementioned dynamics is presented. Second, the optimization problem is defined to find the optimum fuel consumption of the follower in pursuit of a leader in a drive cycle. A customized control strategy based on Approximate Dynamic Programming (ADP) is then explored in which the optimal cost-to-go at each time step is approximated using neural networks. Also, the accuracy of the optimization solution is enhanced by applying the concept of the reachable sets. At last, three case studies show that the examined integrated control strategy outperforms the one with the separated optimization method by an additional 7.4%, 4.6%, and 11.8% improvement in fuel consumption, respectively.

33 ADVANCED PROPULSION SYSTEMS↗

Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

In this paper, we develop a unifying optimization formulation to describe the Dynamic Channel and Power Assignment (DCPA) problem and evaluation method for comparing DCPA algorithms. DCPA refers to the allocation of transmit power and frequency channels to links in a cognitive network so as to maximize the total number of feasible links while minimizing the aggregate transmit power. We apply our evaluation method to five algorithms representative of DCPA used in literature. This comparison illustrates the tradeoffs between control modes (centralized versus distributed) and channel/power assignment techniques. We estimate the complexity of each algorithm. Through simulations, we evaluate the effectiveness of the algorithms in achieving feasible link allocations in the network, as well as their power efficiency. Our results indicate that, when few channels are available, the effectiveness of all algorithms is comparable and thus the one with smallest complexity should be selected. The Least Interfering Channel and Iterative Power Assignment (LICIPA) algorithm does not require cross-link gain information, has the overall lowest run time, and highest feasibility ratio of all the distributed algorithms; however, this comes at a cost of higher average power per link.

42 ENGINEERING↗

Beam Dynamics Challenges of a Far-Future ERL-Based Collider - The Ghost Collider

Beam Dynamics Challenges of a Far-Future ERL-Based Collider - The Ghost Collider In a recent paper, Valery Telnov proposed a linear collider based on twin axis cavities [1]. In a subsequent presentation, Erk Jensen proposed a modification with intra-bucket energy recovery [2], which eliminates higher order mode excitation. Interestingly, this means that there is no need for large aperture SRF cavities and high-power HOM couplers. The Ghost Collider adopts these ideas, and adds the concept of four-beam collisions (initially proposed by Joel LeDuff [3]) to remove beam-beam interactions and disruption. This concept brings up a series of new beam dynamics problems which make optimization of the parameters difficult. The presentation will describe the concept, which has a series of beam-dynamics challenges to be solved before the concept can advance. [1] V.I. Telnov, JINST 16 (2021) no.12, P12025 [2] E. Jensen https://indico.cern.ch/event/1040671/?view=nicecompact [3] Status Report on D. C. I, The Orsay Storage Ring Group, IEEE Transactions on Nuclear Science, Vol. NS-26, No.3, June 1979

Hutton, Andrew↗