Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discrete 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 235 records · Page 13

Current drive in recombining plasma

The Langevin equations describing the average collisional dynamics of suprathermal particles in nonstationary plasma remarkably admit an exact analytical solution in the case of recombining plasma. The current density produced by arbitrary particle fluxes is derived including the effect of charge recombination. Since recombination has the effect of lowering the charge density of the plasma, thus reducing the charged particle collisional frequencies, the evolution of the current density can be modified substantially compared to plasma with fixed charge density. The current drive efficiency is derived and optimized for discrete and continuous pulses of current, leading to the discovery of a nonzero “residual” current density that persists indefinitely under certain conditions, a feature not present in stationary plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

New Methods of Uncertainty Quantification for Mixed Discrete-Continuous Variable Models

The scale and complexity of problems such as designing power grids or planning for climate change is growing rapidly, driving the development of complicated computer models. More complex models have longer run times and incorporate larger numbers of inputs, both continuous and discrete. For example, a detailed physics model may have continuous variables such as temperature, height or pressure along with discrete variables that indicate the choice of a material for a particular piece or the model to be used to calculate air flow. A power grid design model may have continuous variables such as generation capacity, power flow or demand along with discrete variables such as number of generators, number of transmission lines or binary variables to indicate whether or not a node is chosen for generation expansion. A growing awareness of uncertainty and the desire to make risk-informed decisions is causing uncertainty quantification (UQ) to be more routine and often required. UQ provides the underpinnings necessary to establish confidence in models and their use; therefore, much time and effort is being invested in creating efficient approaches for UQ. However, these efforts have been focused on models that take continuous variables as inputs. When discrete inputs are thrown into the mix, the basic approach is to repeat the UQ analysis for each combination of discrete inputs or some subset thereof; this rapidly becomes intractable. Because of the computational complexity inherent in mixed discrete-continuous models, researchers will focus on the uncertainty in their particular problem finding ways to take advantage of symmetries, simplifications or structures. For example, uncertainty propagation in certain dynamical systems can be efficiently carried out after various decomposition steps or uncertainty propagation in stochastic programming is confined to scenario generation. Unfortunately models are not always available for such machinations: models may be embedded in legacy codes, may utilize commercial off the shelf codes or may be created by stringing a series of codes together. It is also time consuming to start each problem from scratch; worse there may not be any simplifications or symmetries to take advantage of. For these situations a UQ method developed for any black box function is necessary. This report documents a new conceptual model for performing UQ for mixed discrete-continuous models which not only applies to any simulator function, but allows the use of the efficient UQ methods that have been developed for continuous inputs only. The conceptual model is presented and an estimation procedure is fleshed out for one class of problems. This is applied to variations of a mixed discrete-continuous optimization test problem. This procedure provides comparable results to a benchmark solution with fewer function evaluations.

Bauman, Lara E.↗

Design and convergence analysis of the conforming virtual element method for polyharmonic problems

In the recent years, there has been a tremendous interest to numerical methods that approximate partial differential equations (PDEs) on computational meshes with arbitrarily-shaped polygonal/polyhedral (polytopal, for short) elements. A nonexhaustive list of such methods include the Mimetic Finite Difference method [4, 9, 21, 24, 28, 33, 35, 62, 64–67], the Polygonal Finite Element Method [68, 73, 74], the polygonal Discontinuous Galerkin Finite Element Methods [5, 7, 8, 10, 13–15, 18, 36, 38, 39, 41, 50], the Hybridizable Discontinuous Galerkin and Hybrid High-Order Methods [46–48, 51], the Gradient Discretization method [49, 53, 54], the Finite Volume Method [52], and the BEM-based FEM [71]. An alternative approach that also proved to be very successful is provided by the Virtual Element method (VEM), which was originally proposed in [19] for the numerical treatment of second-order elliptic problems [43, 44], and readily extended to linear and nonlinear elasticity [22, 25, 56], plate bending problems [37], Cahn-Hilliard equation [3], Stokes equations [2], Laplace-Beltrami equation [55], Darcy-Brinkam equation [76], discrete topology optimization problems [6], fracture networks problems [29], eigenvalue problems [59, 75]. The mixed virtual element formulation was proposed in [20, 34]; the nonconforming Virtual element formulations was proposed for second-order elliptic problems in [16], and later extended to general advection-reaction-diffusion problems, Stokes equation, the biharmonic problems, the iegenvalue problem, and the Schrodinger equation in [11, 30, 42, 45, 58, 80]. The p- and hp-version of the VEM were developed in [26, 27] and efficient multigrid methods for the resulting linear system of equations in [12]. A posteriori error estimates can be found in [40].

97 MATHEMATICS AND COMPUTING↗

When ancient numerical demons meet physics-informed machine learning: adjoint-based gradients for implicit differentiable modeling

Recent advances in differentiable modeling, a genre of physics-informed machine learning that trains neural networks (NNs) together with process-based equations, have shown promise in enhancing hydrological models' accuracy, interpretability, and knowledge-discovery potential. Current differentiable models are efficient for NN-based parameter regionalization, but the simple explicit numerical schemes paired with sequential calculations (operator splitting) can incur numerical errors whose impacts on models' representation power and learned parameters are not clear. Implicit schemes, however, cannot rely on automatic differentiation to calculate gradients due to potential issues of gradient vanishing and memory demand. Here we propose a “discretize-then-optimize” adjoint method to enable differentiable implicit numerical schemes for the first time for large-scale hydrological modeling. The adjoint model demonstrates comprehensively improved performance, with Kling–Gupta efficiency coefficients, peak-flow and low-flow metrics, and evapotranspiration that moderately surpass the already-competitive explicit model. Therefore, the previous sequential-calculation approach had a detrimental impact on the model's ability to represent hydrological dynamics. Furthermore, with a structural update that describes capillary rise, the adjoint model can better describe baseflow in arid regions and also produce low flows that outperform even pure machine learning methods such as long short-term memory networks. The adjoint model rectified some parameter distortions but did not alter spatial parameter distributions, demonstrating the robustness of regionalized parameterization. Despite higher computational expenses and modest improvements, the adjoint model's success removes the barrier for complex implicit schemes to enrich differentiable modeling in hydrology.

58 GEOSCIENCES↗

Constant directions of the Riccati equation

A constant direction of the Riccati equation associated with a class of singular discrete-time optimization problems is defined. The set of constant directions is completely characterized using a control viewpoint. Constant directions are used to reduce the computational complexity of the optimal system. Application to optimal filtering in colored noise is given.

Rappaport, D.↗

The preview control problem with application to man-machine system analysis

The preview control problem is formulated in a general form and its solution is obtained. The analytical tool used is discrete stochastic optimal control theory. Aiming the application to manual control situations with preview, time delay, observation noise, motor noise, etc. were included in formulating the problem. Manual preview control experiments were performed to qualitatively check the validity of the model, and it was found that the mechanism of the manual control problem was explained by the developed model.

Tomizuka, M.↗

Four-dimensional guidance problem with control delays

This paper, assuming steady wind and zero sideslip, presents a discrete-time mathematical model to obtain a control law and three-dimensional flight path to guide an aircraft in a given time from a given initial state (position, velocity and heading) to a prescribed final state subject to the constraints on airspeed acceleration, and pitch and bank angles of the aircraft. For ease in implementing the control law, the control inputs are assumed to be delayed and are applied in a sequential fashion. The guidance problem is formulated as a discrete nonlinear optimal control problem with time delays in dynamics and a cost functional of Bolza form. With a quadratic penalty function to handle terminal constraints on velocity and heading, a solution technique to the control problem based on conjugate gradient algorithm is investigated. Numerical examples are presented to illustrate the applicability of this approach to solution of a terminal area guidance problem in an automated air traffic control environment.

Nagarajan, N.↗

An extension of the quickened display for manual control

It is very difficult (or even impossible) for a human to control plants of third order or more with little or no damping by just knowing the instantaneous error. It has been shown that adding first and/or higher order derivatives to the error signal and displaying the combined signal are effective in facilitating human control over such plants. This signal quickening technique by Birmingham and Taylor is further extended to incorporate the future trajectory variation into the displayed signal so as to minimize the tracking error. A method for tuning free parameters in ordinary and extended quickening is established by applying discrete-time optimal control. Experimental results for a triple integrator plant indicate the effectiveness of the proposed method to achieve high quality tracking.

Tomizuka, M.↗

Radiative Transfer Simulations of the Two-Dimensional Ocean Glint Reflectance and Determination of the Sea Surface Roughness

An optimized discrete-ordinate radiative transfer model (DISORT3) with a pseudo-two-dimensional bidirectional reflectance distribution function (BRDF) is used to simulate and validate ocean glint reflectances at an infrared wavelength (1036 nm) by matching model results with a complete set of BRDF measurements obtained from the NASA cloud absorption radiometer (CAR) deployed on an aircraft. The surface roughness is then obtained through a retrieval algorithm and is used to extend the simulation into the visible spectral range where diffuse reflectance becomes important. In general, the simulated reflectances and surface roughness information are in good agreement with the measurements, and the diffuse reflectance in the visible, ignored in current glint algorithms, is shown to be important. The successful implementation of this new treatment of ocean glint reflectance and surface roughness in DISORT3 will help improve glint correction algorithms in current and future ocean color remote sensing applications.

glint↗

Control simulations of many-body quantum systems by a synergism of discrete real-time learning and optimal control theory

We present a self-consistent algorithm for optimal control simulations of many-body quantum systems. The algorithm features a two-step synergism that combines discrete real-time machine learning (DRTL) with Quantum Optimal Control Theory (QOCT) using the time-dependent Schrödinger equation. Specifically, in step (1), DRTL is employed to identify a compact working space (i.e., the important portion of the Hilbert space) for the time evolution of the many-body quantum system in the presence of a control field (i.e., the initial or previously updated field), and in step (2), QOCT utilizes the DRTL-determined working space to find a newly updated control field for a chosen objective. Steps 1 and 2 are iterated until a self-consistent control objective value is reached such that the resulting optimal control field yields the same targeted objective value when the corresponding working space is systematically enlarged. Furthermore, to demonstrate this two-step self-consistent DRTL-QOCT synergistic algorithm, we perform optimal control simulations of strongly interacting 1D as well as 2D Heisenberg spin systems. In both scenarios, only a single spin (at the left end site for 1D and the upper left corner site for 2D) is driven by the time-dependent control fields to create an excitation at the opposite site as the target. It is found that, starting from all spin-down zero excitation states, the synergistic method is able to identify working spaces and convergence of the desired controlled dynamics with just a few iterations of the overall algorithm. In the cases studied, the dimensionality of the working space scales only quasi-linearly with the number of spins.

Artificial neural networks↗

Adaptive control based on retrospective cost optimization

A discrete-time adaptive control law for stabilization, command following, and disturbance rejection that is effective for systems that are unstable, MIMO, and/or nonminimum phase. The adaptive control algorithm includes guidelines concerning the modeling information needed for implementation. This information includes the relative degree, the first nonzero Markov parameter, and the nonminimum-phase zeros. Except when the plant has nonminimum-phase zeros whose absolute value is less than the plant's spectral radius, the required zero information can be approximated by a sufficient number of Markov parameters. No additional information about the poles or zeros need be known. Numerical examples are presented to illustrate the algorithm's effectiveness in handling systems with errors in the required modeling data, unknown latency, sensor noise, and saturation.

Santillo, Mario A.↗

A Framework for Optimization-Based ISRU Tool Design Using Discrete Element Modeling

Novel robotic excavation technologies are needed to perform in-situ resource utilization (ISRU) tasks at levels required to sustain a long-term presence on the lunar surface. Developing and testing multiple iterations of functional hardware is time and cost prohibitive, thus slowing down the pace of progress and delaying humanity’s settlement of the Moon. High-fidelity, physics-based simulation can reduce the time and effort required to develop and deploy robotic systems [1]. We have adopted this approach to create high-fidelity models of robotic test hardware to enable rapid virtual design and optimization of excavation technologies [2]. Such models can leverage modern computational tools like Discrete Element Method (DEM) simulations that can be coupled with automated design approaches like topology optimization to reduce the amount of prototyping and physical testing needed to realize useful tools.

ISRU↗

Classifier-guided sampling for discrete variable, discontinuous design space exploration: Convergence and computational performance

A classifier-guided sampling (CGS) method is introduced for solving engineering design optimization problems with discrete and/or continuous variables and continuous and/or discontinuous responses. The method merges concepts from metamodel-guided sampling and population-based optimization algorithms. The CGS method uses a Bayesian network classifier for predicting the performance of new designs based on a set of known observations or training points. Unlike most metamodeling techniques, however, the classifier assigns a categorical class label to a new design, rather than predicting the resulting response in continuous space, and thereby accommodates nondifferentiable and discontinuous functions of discrete or categorical variables. The CGS method uses these classifiers to guide a population-based sampling process towards combinations of discrete and/or continuous variable values with a high probability of yielding preferred performance. Accordingly, the CGS method is appropriate for discrete/discontinuous design problems that are ill-suited for conventional metamodeling techniques and too computationally expensive to be solved by population-based algorithms alone. In addition, the rates of convergence and computational properties of the CGS method are investigated when applied to a set of discrete variable optimization problems. Results show that the CGS method significantly improves the rate of convergence towards known global optima, on average, when compared to genetic algorithms.

42 ENGINEERING↗

A simple introduction to the SiMPL method for density-based topology optimization

We introduce a novel method for solving density-based topology optimization problems: Sigmoidal Mirror descent with a Projected Latent variable (SiMPL). The SiMPL method (pronounced as “the simple method”) optimizes a design using only first-order derivative information of the objective function. The bound constraints on the density field are enforced with the help of the (negative) Fermi–Dirac entropy, which is also used to define a non-symmetric distance function called a Bregman divergence on the set of admissible designs. This Bregman divergence leads to a simple update rule that is further simplified with the help of a so-called latent variable. Because the SiMPL method involves discretizing the latent variable, it produces a sequence of pointwise-feasible iterates, even when high-order finite elements are used in the discretization. Numerical experiments demonstrate that the method outperforms other popular first-order optimization algorithms. In conclusion, to outline the general applicability of the technique, we include examples with (self-load) compliance minimization and compliant mechanism optimization problems.

Calculus of Variations and Optimization↗

Implementation of Autonomous GPS Guidance and Control for Spacecraft Formation Flying

This paper presents the general relative orbit dynamics equations and GPS (Global Positioning System) orbit observational equations that have been developed for on-board control of spacecraft flying in formation. The approach to the implementation of the autonomous control for orbit acquisition and maintenance of spacecraft formation using GPS code pseudoranges are presented. As a practical application of the models and method provided in this paper, the orbit control of the Earth-Orbiter 1(EO-1) / Landsat 7 system has been designed, using the discrete-time linear optimal output feedback control. For the actuator of the on/off type reaction jets, the implementation problem of the pulse-amplitude modulation is also studied. Simulation results of autonomous orbit control and maintenance, for 3-dimensional initial orbit error, using optimal output feedback control are shown. These simulation results certified the feasibility of the implementation of the autonomous maintenance control for EO-1/Landsat 7 formation flying by means of the discrete-time linear optimal output feedback control.

Xing, Guang Q.↗

Optimal placement of excitations and sensors by simulated annealing

The optimal placement of discrete actuators and sensors is posed as a combinatorial optimization problem. Two examples for truss structures were used for illustration; the first dealt with the optimal placement of passive dampers along existing truss members, and the second dealt with the optimal placement of a combination of a set of actuators and a set of sensors. Except for the simplest problems, an exact solution by enumeration involves a very large number of function evaluations, and is therefore computationally intractable. By contrast, the simulated annealing heuristic involves far fewer evaluations and is best suited for the class of problems considered. As an optimization tool, the effectiveness of the algorithm is enhanced by introducing a number of rules that incorporate knowledge about the physical behavior of the problem. Some of the suggested rules are necessarily problem dependent.

Salama, Moktar↗

Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits

We extend Noise-Directed Adaptive Remapping (NDAR), a recently proposed heuristic meta-algorithm that leverages device noise as a computational resource, to optimization problems over discrete (integer) domains. While originally introduced for unconstrained binary optimization, the proposed generalization introduces additional gauge degrees of freedom at the logical level, such that the gauge transformation applied at each iteration is no longer unique, allowing tailoring to particular encodings or quantum hardware. We identify encoding-dependent requirements for NDAR beyond binary domains: feasibility of the noise attractor, existence of compatible gauge transformations that preserve an efficiently implementable circuit family, and a systematic way to select the transform to apply at each step. We analyze these criteria for qudit-native and for binary, one-hot, and domain-wall qubit encodings, using the Max-k-colorable subgraph problem as a running example. We demonstrate that these encodings can exhibit distinct advantages and tradeoffs when integrated within the NDAR framework, particularly in how noise-induced dynamics interact with the solution landscape and choice of encoding. Our results indicate that NDAR-guided noise considerations provide a new criterion for comparing device-level encoding choices for quantum optimization. Finally, we outline directions toward experimental realization in superconducting qudit devices and further algorithmic improvements.

Hadfield, Stuart [RIACS, Mtn. View] (ORCID:0000000↗