Search NASA⌕ Search

SEARCH · Search NASA

Results for “binary optimal control”

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 19 records

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Binary optimal control by trust-region steepest descent

Abstract We present a trust-region steepest descent method for dynamic optimal control problems with binary-valued integrable control functions. Our method interprets the control function as an indicator function of a measurable set and makes set-valued adjustments derived from the sublevel sets of a topological gradient function. By combining this type of update with a trust-region framework, we are able to show by theoretical argument that our method achieves asymptotic stationarity despite possible discretization errors and truncation errors during step determination. To demonstrate the practical applicability of our method, we solve two optimal control problems constrained by ordinary and partial differential equations, respectively, and one topological optimization problem.

97 MATHEMATICS AND COMPUTING↗

Binary Quantum Control Optimization with Uncertain Hamiltonians

Optimizing the controls of quantum systems plays a crucial role in advancing quantum technologies. The time-varying noises in quantum systems and the widespread use of inhomogeneous quantum ensembles raise the need for high-quality quantum controls under uncertainties. In this paper, we consider a stochastic discrete optimization formulation of a discretized binary optimal quantum control problem involving Hamiltonians with predictable uncertainties. We propose a sample-based reformulation that optimizes both risk-neutral and risk-averse measurements of control policies, and solve these with two gradient-based algorithms using sum-up-rounding approaches. Furthermore, we discuss the differentiability of the objective function and prove upper bounds of the gaps between the optimal solutions to binary control problems and their continuous relaxations. We conduct numerical simulations on various sized problem instances based on two applications of quantum pulse optimization; we evaluate different strategies to mitigate the impact of uncertainties in quantum systems. In conclusion, we demonstrate that the controls of our stochastic optimization model achieve significantly higher quality and robustness compared with the controls of a deterministic model.

conditional value-at-risk (CVaR)↗

Binary Control Pulse Optimization for Quantum Systems

Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L 2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

IECON '87: Industrial applications of control and simulation; Proceedings of the 1987 International Conference on Industrial Electronics, Control, and Instrumentation, Cambridge, MA, Nov. 3, 4, 1987

Recent advances in control-system design and simulation are discussed in reviews and reports. Among the topics considered are fast algorithms for generating near-optimal binary decision programs, trajectory control of robot manipulators with compensation of load effects via a six-axis force sensor, matrix integrators for real-time simulation, a high-level control language for an autonomous land vehicle, and a practical engineering design method for stable model-reference adaptive systems. Also addressed are the identification and control of flexible-limb robots with unknown loads, adaptive control and robust adaptive control for manipulators with feedforward compensation, adaptive pole-placement controllers with predictive action, variable-structure strategies for motion control, and digital signal-processor-based variable-structure controls.

Hartley, Tom T.↗

H ∞ Control for Energy Dispatch in Autonomous Nanogrid With Communication Delays

This paper proposes an optimal controller and estimator for energy dispatch to balance the power supply and demand considering communication delays. The proposed algorithm involves modeling an autonomous nanogrid (ANG) consisting of distributed energy resources, energy storage systems, loads, an $H$ ∞ controller with a reference power modulation technique, and a state estimator. The ANG was developed to express the dynamic supply-demand energy balance of a nanogird system. Reference power modulation was designed to generate the desired ESS power based on the imbalanced energy. Random communication delays were modeled using a stochastic variable satisfying the Bernoulli random binary distribution. The optimal $H$ ∞ controller and estimator were developed using a linear matrix inequality approach to exponentially stabilize the closed-loop system. Simulations were performed using real daily demand forecasts obtained from the Korea Meteorological Administration to demonstrate the effectiveness of the proposed real-time optimization algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Exceptional enhancement of mechanical properties in high-entropy alloys via thermodynamically guided local chemical ordering

Understanding the local chemical ordering propensity in random solid solutions, and tailoring its strength, can guide the design and discovery of complex, paradigm-shifting multicomponent alloys. First, we present a simple thermodynamic framework, based solely on binary enthalpies of mixing, to select optimal alloying elements to control the nature and extent of chemical ordering in high-entropy alloys (HEAs). Next, we couple high-resolution electron microscopy, atom probe tomography, hybrid Monte-Carlo, special quasirandom structures, and density functional theory calculations to demonstrate how controlled additions of Al and Ti and subsequent annealing drive chemical ordering in nearly random equiatomic face-centered cubic CoFeNi solid solution. We establish that short-range ordered domains, the precursors of long-range ordered precipitates, inform mechanical properties. Specifically, a progressively increasing local order boosts the tensile yield strengths of the parent CoFeNi alloy by a factor of four while also substantially improving ductility, which breaks the so-called strength–ductility paradox. Finally, we validate the generality of our approach by predicting and demonstrating that controlled additions of Al, which has large negative enthalpies of mixing with the constituent elements of another nearly random body-centered cubic refractory NbTaTi HEA, also introduces chemical ordering and enhances mechanical properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Fast Dynamic Internal Predictive Power Scheduling Approach for Power Management in Microgrids: Preprint

This paper presents a Dynamic Internal Predictive Power Scheduling (DIPPS) approach for optimizing power management in microgrids, particularly focusing on external power exchanges among diverse prosumers. DIPPS utilizes a dynamic objective function with a time-varying binary parameter to control the timing of power transfers to the external grid, facilitated by efficient usage of energy storage for surplus renewable power. The microgrid power scheduling problem is modeled as a mixed-integer nonlinear programming (MINLP-PS) and subsequently transformed into a mixed-integer linear programming (MILPPS) optimization through McCormick's relaxation to reduce computational complexity. A predictive window window with 6 data points is solved at an average of 0.92s, a 97.6% improvement over the 38.27s required for the MINLP-PS formulation, implying the numerical feasibility of the DIPPS approach for real-time implementation. Finally, the approach is validated against a static objective using real-world load data across three case studies with different time-varying parameters, demonstrating the ability of DIPPS to optimize power exchanges and efficiently utilize distributed resources while shifting the external power transfers to specified time durations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Building Load Control Using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants

Aggregation of heating, ventilation, and air conditioning (HVAC) loads can provide reserves to absorb volatile renewable energy, especially solar photo-voltaic (PV) generation. In this paper, we decide HVAC control schedules under uncertain PV generation, using a distributionally robust chance-constrained (DRCC) building load control model under two typical ambiguity sets: the moment-based and Wasserstein ambiguity sets. We derive mixed integer linear programming (MILP) reformulations for DRCC problems under both sets. Especially, for the Wasserstein ambiguity set, we use the right-hand side (RHS) uncertainty to derive a more compact MILP reformulation than the commonly known MILP reformulations with big-M constants. All the results also apply to general individual chance constraints with RHS uncertainty. Furthermore, we propose an adjustable chance-constrained variant to achieve tradeoff between the operational risk and costs. We derive MILP reformulations under the Wasserstein ambiguity set and second-order conic programming (SOCP) reformulations under the moment-based set. Using real-world data, we conduct computational studies to demonstrate the efficiency of the solution approaches and the effectiveness of the solutions. Summary of Contribution: The problem studied in this paper is motivated by a building load control problem that uses the aggregation of heating, ventilation, and air conditioning (HVAC) loads as flexible reserves to absorb uncertain solar photovoltaic (PV) generation. The problem is formulated as distributionally robust chance-constrained (DRCC) programs with right-hand side (RHS) uncertainty. In addition, we propose a risk-adjustable variant of the DRCC programs, where the risk level, instead of being predetermined, is treated as a decision variable. The paper aims to provide tractable reformulations and solution algorithms for both the (general) DRCC and the (general) adjustable DRCC models with RHS uncertainty.

97 MATHEMATICS AND COMPUTING↗

Melt Stabilization of PbSnTe in a Magnetic Field

Both the experimental observation and numerical simulation indicate that the Bridgman growth of PbSnTe under the microgravity environment in space is still greatly influenced by buoyancy-induced convection. The application of a magnetic field during the semiconductor growth can dampen the convective flow in the metal-like melt. However, for Bridgman growth of PbSnTe on earth (with either vertical or horizontal configuration), both experimental observation and numerical modeling suggest that even with a strong magnetic furnace (5-Tesla constant axial magnetic field), the convective flow in the melt still cannot be sufficiently suppressed to reach the diffusion-controlled level. In order to completely dampen the buoyancy-induced convection on earth, estimates based on scaling analysis indicate that for common experimental conditions, an extremely high magnetic field is required, far beyond the capacity of the experimental apparatus currently available. Therefore, it is proposed that only the combination of microgravity environment and magnetic damping will produce the desired diffusion-controlled growth state for this particular material. The primary objectives of this study are to provide a quantitative understanding of the complex transport phenomena during solidification of non-dilute binarys, to furnish a numerical tool for furnace design and growth condition optimization, to provide estimates of the required magnetic field strength for low gravity growth, and to assess the role of magnetic damping for space and earth control of the double-diffusive convection. As an integral part of a NASA research program, our numerical simulation supports both the flight and ground-based experiments in an effort to bring together a complete picture of the complex physical phenomena involved in the crystal growth process. For Bridgman growth of PbSnTe under microgravity (with both vertical and horizontal configurations), the simulations suggest that a moderate axial magnetic field of only a few kilo-Gauss in strength could effectively eliminate buoyancy-induced convection in the melt and control solute segregation. Therefore, this work confirms the idea that the combination of microgravity environment and the magnetic damping will indeed be sufficient to produce the desired diffusion-controlled growth state for PbSnTe.

Fripp, Archibald L.↗

Real Time Optima Tracking Using Harvesting Models of the Genetic Algorithm

Tracking optima in real time propulsion control, particularly for non-stationary optimization problems is a challenging task. Several approaches have been put forward for such a study including the numerical method called the genetic algorithm. In brief, this approach is built upon Darwinian-style competition between numerical alternatives displayed in the form of binary strings, or by analogy to 'pseudogenes'. Breeding of improved solution is an often cited parallel to natural selection in.evolutionary or soft computing. In this report we present our results of applying a novel model of a genetic algorithm for tracking optima in propulsion engineering and in real time control. We specialize the algorithm to mission profiling and planning optimizations, both to select reduced propulsion needs through trajectory planning and to explore time or fuel conservation strategies.

Baskaran, Subbiah↗

Efficient data-driven models for prediction and optimization of geothermal power plant operations

Increasing the capacity of geothermal energy as a renewable resource calls for development and deployment of efficient control and optimization technologies for geothermal power plants. A data-driven prediction and optimization model is presented as a cost-effective and efficient alternative to physics-based approach. The model predicts power output and operational cost by propagating the influence of control and disturbance variables within an artificial neural network (ANN). Numerical experiments with simulated and field data from a real geothermal power plant are first used to demonstrate the prediction performance of the ANN model. The model is then adopted to maximize the net predicted power production by automatically adjusting the working fluid circulation rate. The optimization performance of the model in evaluated using a thermodynamic flowsheet simulation model. The workflow is applied to model and control the effect of ambient temperature on an air-cooled binary cycle power plant, which is complex and costly to perform using a physics-based predictive model. As a result, the performance of the method is demonstrated by applying it to both simulated and field datasets from a binary cycle geothermal power plant.

15 GEOTHERMAL ENERGY↗

Dual aggregation steering in bulk-heterojunction via solvent engineering toward efficient and stable binary organic solar cells

In high-performance organic solar cells (OSCs), efficient charge transport hinges on a well-optimized morphology of the photoactive layer, which depends critically on controlled aggregation and favorable interactions between donor and acceptor materials. In this work, we introduce a cascade solvent system comprising high-boiling-point ethylbenzene (EB) and low-boiling-point chloroform (CF) to finely tune the aggregation behavior of the D18 donor and L8-BO acceptor. The incorporation of EB not only promotes the H-aggregation of D18 and the J-aggregation of L8-BO but also facilitates the formation of ideal nanoscale phase separation, thereby suppressing bimolecular recombination. As a result, devices processed with the EB/CF solvent blend achieve a best power conversion efficiency (PCE) of 19.6 % and enhanced operational stability, outperforming those fabricated with pure CF (17.1 %). In conclusion, this study offers a reliable and effective strategy for optimizing donor and acceptor aggregation, providing a viable pathway toward higher-performance OSCs.

36 MATERIALS SCIENCE↗

Modeling the use of a binary mixture as a control scheme for two-phase thermal systems

Two-phase thermal loops using mechanical pumps, capillary pumps, or a combination of the two have been chosen as the main heat transfer systems for the space station. For these systems to operate optimally, the flow rate in the loop should be controlled in response to the vapor/liquid ratio leaving the evaporator. By substituting a mixture of two non-azeotropic fluids in place of the single fluid normally used in these systems, it may be possible to monitor the temperature of the exiting vapor and determine the vapor/liquid ratio. The flow rate would then be adjusted to maximize the load capability with minimum energy input. A FLUINT model was developed to study the system dynamics of a hybrid capillary pumped loop using this type of control and was found to be stable under all the test conditions.

Benner, S. M.↗

Predicting defects in laser powder bed fusion using in-situ thermal imaging data and machine learning

Variation in the local thermal history during the Laser Powder Bed Fusion (LPBF) process in Additive Manufacturing (AM) can cause micropore defects, which add to the uncertainty of the mechanical properties (e.g., fatigue life, tensile strength) of the built materials. In-situ sensing has been proposed for monitoring the AM process to minimize defects, but successful minimization requires establishing a quantitative relationship between the sensing data and the porosity, which is particularly challenging with a large number of variables (e.g., laser speed, power, scan path, powder property). Physics-based modeling can simulate such an in-situ sensing-porosity relationship, but it is computationally costly. In this work, we develop Machine Learning (ML) models that can use in-situ thermographic data to predict the micropore of LPBF stainless steel materials. This work considers two identified key features from the thermal histories: the time above the apparent melting threshold ($\tau$) and the maximum radiance ( T max ). These features are computed, stored for each voxel in the built material, and then used as inputs. The binary state of each voxel, either defective or normal, is the output. Different ML models are trained and tested for the binary classification task. In addition to using the thermal features of each voxel to predict its own state, the thermal features of neighboring voxels are also included as inputs. This is shown to improve the prediction accuracy, which is consistent with thermal transport physics around each voxel contributing to its final state. Among the models trained, the F1 scores on test sets reach above 0.96 for Random Forests. Feature importance analysis based on the ML models shows that T max is more important to the voxel state than $\tau$ . The analysis also finds that the thermal history of the voxels above the present voxel is more influential than those beneath it. Our study significantly extends the capability of using in-situ thermographic data to predict porosity in LPBF materials. Finally, since ML models are fast, they may play integral roles in the optimization and control of such AM technologies.

36 MATERIALS SCIENCE↗

Controlled precision QUBO-based algorithm to compute eigenvectors of symmetric matrices

We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix which is based on solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of symmetric matrices; It can compute the eigenvector/eigenvalue pair to essentially any arbitrary precision, and with minor modifications, can also solve the generalized eigenvalue problem. Performance is analyzed on small random matrices and selected larger matrices from practical applications.

97 MATHEMATICS AND COMPUTING↗

LSAFE: a Lightweight Static Analysis Framework for binary Executables

Static analysis is a widely used technique for analyzing various aspects of programs. However, as programs become more complex, static analysis tools require larger resources, such as CPU time and memory, to perform the same tasks. Moreover, the source code of programs may not always be accessible, requiring static analysis to be performed on the binary executable code directly. To overcome these challenges, we propose a lightweight static analysis framework called LSAFE, which constructs control flow graphs (CFGs) and data dependency graphs (DDGs) of target programs with optimized performance in terms of CPU and memory usage. We evaluated the proposed framework using both Spec benchmark programs and real-world industrial applications, and found that it outperformed Angr, an existing state-of-the-art static analysis tool. Additionally, we demonstrate a case study that utilizes the CFG generated by LSAFE to detect memory leaks.

Qu, Guangzhi↗

Quantum Adiabatic Algorithms and Large Spin Tunnelling

We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in this paper. The algorithm is applied to a random binary optimization problem (a version of the 3-Satisfiability problem) where the n-bit cost function is symmetric with respect to the permutation of individual bits. The evolution paths are produced, using the generic control Hamiltonians H (r) that preserve the bit symmetry of the underlying optimization problem. In the case where the ground state of H(0) coincides with the totally-symmetric state of an n-qubit system the algorithm dynamics is completely described in terms of the motion of a spin-n/2. We show that different control Hamiltonians can be parameterized by a set of independent parameters that are expansion coefficients of H (r) in a certain universal set of operators. Only one of these operators can be responsible for avoiding the tunnelling in the spin-n/2 system during the quantum adiabatic algorithm. We show that it is possible to select a coefficient for this operator that guarantees a polynomial complexity of the algorithm for all problem instances. We show that a successful evolution path of the algorithm always corresponds to the trajectory of a classical spin-n/2 and provide a complete characterization of such paths.

Boulatov, A.↗