Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

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 1,531 records · Page 85

A Classification of G -invariant Shallow Neural Networks

When trying to fit a deep neural network (DNN) to a G-invariant target function with G a group, it only makes sense to constrain the DNN to be G-invariant as well. However, there can be many different ways to do this, thus raising the problem of “G-invariant neural architecture design”: What is the optimal Ginvariant architecture for a given problem? Before we can consider the optimization problem itself, we must understand the search space, the architectures in it, and how they relate to one another. In this paper, we take a first step towards this goal; we prove a theorem that gives a classification of all G-invariant single-hidden-layer or “shallow” neural network (G-SNN) architectures with ReLU activation for any finite orthogonal group G, and we prove a second theorem that characterizes the inclusion maps or “network morphisms” between the architectures that can be leveraged during neural architecture search (NAS). The proof is based on a correspondence of every G-SNN to a signed permutation representation of G acting on the hidden neurons; the classification is equivalently given in terms of the first cohomology classes of G, thus admitting a topological interpretation. The G-SNN architectures corresponding to nontrivial cohomology classes have, to our knowledge, never been explicitly identified in the literature previously. Using a code implementation, we enumerate the G-SNN architectures for some example groups G and visualize their structure. Lastly, we prove that architectures corresponding to inequivalent cohomology classes coincide in function space only when their weight matrices are zero, and we discuss the implications of this for NAS.

Agrawal, Devanshu↗

Weak Convergence and Fluid Limits in Optimal Time-to-Empty Queueing Control Problems

We consider a class of controlled queue length processes, in which the control allocates each server's effort among the several classes of customers requiring its service. Served customers are routed through the network according to (prescribed) routing probabilities. In the fluid rescaling, X{sup n}(t) = 1/nX(nt) , we consider the optimal control problem of minimizing the integral of an undiscounted positive running cost until the first time that X{sup n}=0. Our main result uses weak convergence ideas to show that the optimal value functions V{sup n} of the stochastic control problems for X{sup n}(t) converge (as n{yields}{infinity}) to the optimal value V of a control problem for the limiting fluid process. This requires certain equicontinuity and boundedness hypotheses on (V{sup n}). We observe that these are essentially the same hypotheses that would be needed for the Barles-Perthame approach in terms of semicontinuous viscosity solutions. Sufficient conditions for these equicontinuity and boundedness properties are briefly discussed.

97 MATHEMATICS AND COMPUTING↗

Gas Reliability Analysis Integrated Library (GRAIL)

The Gas Reliability Analysis Integrated Library (GRAIL) is a prototype computational tool for solving a class of intra-day model-predictive control problems for a simplified network model of midstream natural gas pipeline systems. The model accurately resolves dynamic gas flows through long pipes using a non-ideal gas equation of state. It can be used to provide optimal intra-day flow schedules as well as spatiotemporal economic values of natural gas while ensuring that pipeline hydraulic limitations, compressor station constraints, operational factors, and pre-existing shipping contracts are satisfied. The inputs to the code are a model of the pipeline system as well as time-series data that specify boundary conditions on the network and time-dependent constraints on the optimal control problem. The outputs are time-series data that provide an approximately optimal solution of flows, pressures, compressor settings, and sensitivities to the objective function.

Zlotnik, Anatoly↗

Acceleration of quantum optimal control theory algorithms with mixing strategies

We propose the use of mixing strategies to accelerate the convergence of the common iterative algorithms utilized in quantum optimal control theory (QOCT). We show how the nonlinear equations of QOCT can be viewed as a 'fixed-point' nonlinear problem. The iterative algorithms for this class of problems may benefit from mixing strategies, as it happens, e.g., in the quest for the ground-state density in Kohn-Sham density-functional theory. We demonstrate, with some numerical examples, how the same mixing schemes utilized in this latter nonlinear problem may significantly accelerate the QOCT iterative procedures.

97 MATHEMATICS AND COMPUTING↗

Balancing Power Absorption and Structural Loading for an Asymmetric Heave Wave-Energy Converter in Regular Waves

The aim of this paper is to maximize the power-to-load ratio of the Berkeley Wedge: a one-degree-of-freedom, asymmetrical, energy-capturing, floating breakwater of high performance that is relatively free of viscosity effects. Linear hydrodynamic theory was used to calculate bounds on the expected time-averaged power (TAP) and corresponding surge restraining force, pitch restraining torque, and power take-off (PTO) control force when assuming that the heave motion of the wave energy converter remains sinusoidal. This particular device was documented to be an almost-perfect absorber if one-degree-of-freedom motion is maintained. The success of such or similar future wave energy converter technologies would require the development of control strategies that can adapt device performance to maximize energy generation in operational conditions while mitigating hydrodynamic loads in extreme waves to reduce the structural mass and overall cost. This paper formulates the optimal control problem to incorporate metrics that provide a measure of the surge restraining force, pitch restraining torque, and PTO control force. The optimizer must now handle an objective function with competing terms in an attempt to maximize power capture while minimizing structural and actuator loads. A penalty weight is placed on the surge restraining force, pitch restraining torque, and PTO actuation force, thereby allowing the control focus to be placed either on power absorption or load mitigation. Thus, in achieving these goals, a per-unit gain in TAP would not lead to a greater per-unit demand in structural strength, hence yielding a favorable benefit-to-cost ratio. Demonstrative results in the form of TAP, reactive TAP, and the amplitudes of the surge restraining force, pitch restraining torque, and PTO control force are shown for the Berkeley Wedge example.

16 TIDAL AND WAVE POWER↗

Balancing Power Absorption and Structural Loading for an Assymmetric Heave Wave-Energy Converter in Regular Waves: Preprint

The aim of this paper is to maximize the power-to-load ratio of the Berkeley Wedge: a one-degree-of-freedom, asymmetrical, energy-capturing, floating breakwater of high performance that is relatively free of viscosity effects. Linear hydrodynamic theory was used to calculate bounds on the expected time-averaged power (TAP) and corresponding surge restraining force, pitch restraining torque, and power take-off (PTO) control force when assuming that the heave motion of the wave energy converter remains sinusoidal. This particular device was documented to be an almost-perfect absorber if one-degree-of-freedom motion is maintained. The success of such or similar future wave energy converter technologies would require the development of control strategies that can adapt device performance to maximize energy generation in operational conditions while mitigating hydrodynamic loads in extreme waves to reduce the structural mass and overall cost. This paper formulates the optimal control problem to incorporate metrics that provide a measure of the surge restraining force, pitch restraining torque, and PTO control force. The optimizer must now handle an objective function with competing terms in an attempt to maximize power capture while minimizing structural and actuator loads. A penalty weight is placed on the surge restraining force, pitch restraining torque, and PTO actuation force, thereby allowing the control focus to be placed either on power absorption or load mitigation. Thus, in achieving these goals, a per-unit gain in TAP would not lead to a greater per-unit demand in structural strength, hence yielding a favorable benefit-to-cost ratio. Demonstrative results in the form of TAP, reactive TAP, and the amplitudes of the surge restraining force, pitch restraining torque, and PTO control force are shown for the Berkeley Wedge example.

16 TIDAL AND WAVE POWER↗

Near-Optimal Solutions for Day-Ahead Unit Commitment

Given the difficulty and the time pressure of solving unit commitment problems, near -optimal solutions (those with 0.1 or 0.001% optimality gaps) are often used in practice. The choice in which of the near -optimal solutions is used, however, is random. We investigate the impact of solution choice on the revenues obtained by generator owners across a variety of pricing schemes and problem instances.

market-clearing↗

Distributed Rules-Based Deconfliction of ADMS Applications: Part 1: Requirements & Decomposition

This work introduces a rules-based deconfliction methodology for resolving conflicting device control commands issued by advanced power applications considering a range of technical, economic, environmental, and social objectives. The methodology is designed to serve as one of multiple alternative implementations (along with application cooperation and global optimization) for the numerical component of the Deconfliction Pipeline. Development of the methodology is divided into two parts. This first document introduces the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem is decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. Selection of the optimal number of decompositions of the deconfliction problem should be made based on a tradeoff analysis between computational speed and global optimality. This second document will define an initial set of technical, economic, and environmental criteria, as well as thirty specific qualitative rules that are used as part of the deconfliction methodology to eliminate non-viable setpoint alternatives. The deconfliction optimization problem is converted into a ranking of individual discrete setpoints, which are scored by the extent to which they satisfy specific decision criteria. The ranking is determined through the concepts of deconfliction exclusivity, priority, and preference. Several multi-criteria decision-making frameworks are examined with the simple multi-attribute rating technique exploiting ranks (SMARTER) recommended as a simple implementation alternative that aligns with the steps of the rules-based deconfliction methodology.

97 MATHEMATICS AND COMPUTING↗

Large-scale optimal control of interconnected natural gas and electrical transmission systems

We present a detailed optimal control model that captures spatiotemporal interactions between gas and electric transmission networks. We use the model to study flexibility and economic opportunities provided by coordination. A large-scale case study in the Illinois system reveals that coordination can enable the delivery of significantly larger amounts of natural gas to the power grid. In particular, under a coordinated setting, gas-fired generators act as distributed demand response resources that can be controlled by the gas pipeline operator. This enables more efficient control of pressures and flows in space and time and overcomes delivery bottlenecks. We demonstrate that the additional flexibility not only can benefit the gas operator but can also lead to more efficient power grid operations and results in increased revenue for gas-fired power plants. We also use the optimal control model to analyze computational issues arising in these complex models. We demonstrate that the interconnected Illinois system with full physical resolution gives rise to a highly nonlinear optimal control problem with 4400 differential and algebraic equations and 1040 controls that can be solved with a state-of-the-art sparse optimization solver. (C) 2016 Elsevier Ltd. All rights reserved.

Chiang, Nai-Yuan↗

Distributed Rules-Based Deconfliction of ADMS Applications - Part 2: Conceptual Implementation

This work introduces a rules-based deconfliction methodology for resolving conflicting device control commands issued by advanced power applications considering a range of technical, economic, environmental, and social objectives. The methodology is designed to serve as one of multiple alternative implementations (along with application cooperation and global optimization) for the numerical component of the Deconfliction Pipeline. Development of the methodology is divided into two parts. The first document previously defined the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem was decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. It was recommended that selection of the optimal number of decompositions of the deconfliction problem be made based on a tradeoff analysis between computational speed and global optimality. This second document defines an initial set of technical, economic, and environmental criteria, as well as thirty specific qualitative rules that are used as part of the deconfliction methodology to eliminate non-viable setpoint alternatives. The deconfliction optimization problem is converted into a ranking of individual discrete setpoints, which are scored by the extent to which they satisfy specific decision criteria. The ranking is determined through the concepts of deconfliction exclusivity, priority, and preference. Several multi-criteria decision-making frameworks are examined with the simple multi-attribute rating technique exploiting ranks (SMARTER) recommended as a simple implementation alternative that aligns with the steps of the rules-based deconfliction methodology.

97 MATHEMATICS AND COMPUTING↗

The use of multi-objective optimization to improve the design process of nuclear power plant systems

Multi-objective optimization is proposed to address the problem of design optimality in the nuclear power plant design process. This is done via the creation/development of the Optimization and Preference Tool for the Improvement of Nuclear Systems (OPTIONS). This work details applications of multi-objective optimization methods (in Python 3) to two different nuclear system design problems: the flash-Rankine power conversion system (PCS) of the I 2 S-LWR and the Passive Endothermic Reaction Cooling System (PERCS) attached to a standard PWR primary system (in RELAP5). The PCS design problem is first solved for three configurations using a specific particle swarm optimization method, achieving a thermodynamic efficiency of 34.81%. A new method, the Mixed-Integer Non-dominated Sorting Genetic Algorithm (MI-NSGA), is created and then used, solving a PCS superstructure of 22 configurations and achieving an efficiency of 35.63%. Finally, the OPTIONS tool is used to optimize the PERCS, improving cost, core temperature control, and cooling longevity.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Algebraic Multigrid Preconditioners for Multiphase Flow in Porous Media

Multiphase flow is a critical process in a wide range of applications, including carbon sequestration, contaminant remediation, and groundwater management. Typically, this process is modeled by a nonlinear system of partial differential equations derived by considering the mass conservation of each phase (e.g., oil, water), along with constitutive laws for the relationship of phase velocity to phase pressure. In this study, we develop and study efficient solution algorithms for solving the algebraic systems of equations derived from a fully coupled and time-implicit treatment of models of multiphase flow. We explore the performance of several preconditioners based on algebraic multigrid (AMG) for solving the linearized problem, including “black-box” AMG applied directly to the system, a new version of constrained pressure residual multigrid (CPR-AMG) preconditioning, and a new preconditioner derived using an approximate Schur complement arising from the block factorization of the Jacobian. Finally, we show that the new methods are the most robust with respect to problem character, as determined by varying effects of capillary pressures, and we show that the block factorization preconditioner both is efficient and scales optimally with problem size.

97 MATHEMATICS AND COMPUTING↗

Optimal Eco-Driving Control of Connected and Autonomous Vehicles Through Signalized Intersections

This article focuses on the speed planning problem for connected and automated vehicles (CAVs) communicating to traffic lights. The uncertainty of traffic signal timing for signalized intersections on the road is considered. The eco-driving problem is formulated as a data-driven chance-constrained robust optimization problem. Effective red-light duration (ERD) is defined as a random variable, and describes the feasible passing time through the signalized intersections. Usually, the true probability distribution for ERD is unknown. Consequently, a data-driven approach is adopted to formulate chance constraints based on empirical sample data. This incorporates robustness into the eco-driving control problem with respect to uncertain signal timing. Dynamic programming (DP) is employed to solve the optimization problem. The simulation results demonstrate that the proposed method can generate optimal speed reference trajectories with 40% less vehicle fuel consumption, while maintaining the arrival time at a similar level compared to a modified intelligent driver model (IDM). The proposed control approach significantly improves the controller's robustness in the face of uncertain signal timing, without requiring to know the distribution of the random variable a priori.

33 ADVANCED PROPULSION SYSTEMS↗

Generalized Modular Representation Framework for the Synthesis of Extractive Separation Systems

In this work, a systematic process synthesis and intensification method is presented for extractive separation based on the Generalized Modular Representation Framework (GMF). GMF employs a mass/heat exchange module-based superstructure representation, incorporating detailed thermodynamic model, to investigate conventional or intensified process options for nonideal azeotropic separation without a pre-postulation of plausible unit/flowsheet configurations. Orthogonal Collocation is also applied to enhance GMF representation to obtain intra-module operation information and module dimensionality estimation while maintaining model size compactness. Furthermore, entrainer selection, process synthesis, design, and intensification are examined within a single mixed-integer nonlinear optimization (MINLP) problem. A case study on the separation of ethanol-water mixture is presented to highlight the potential of the proposed approach in deriving optimal and verifiable extractive separation systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adjoint sensitivity analysis of an ultrawideband antenna

The frequency domain finite element method using H(curl)-conforming finite elements is a robust technique for full-wave analysis of antennas. As computers become more powerful, it is becoming feasible to not only predict antenna performance, but also to compute sensitivity of antenna performance with respect to multiple parameters. This sensitivity information can then be used for optimization of the design or specification of manufacturing tolerances. In this paper we review the Adjoint Method for sensitivity calculation, and apply it to the problem of optimizing a Ultrawideband antenna.

42 ENGINEERING↗

Enhanced Power Grid Maintenance Planning and Quantum-Inspired Combinatorial Prospects

Efficient and reliable scheduling of maintenance for power generation and transmission infrastructure is essential for minimizing operational costs and ensuring grid stability. This paper introduces an integrated optimization framework for coordinated maintenance scheduling of generators and transmission lines under resource and reliability constraints. The model minimizes a composite cost function including maintenance and generation costs, as well as penalties for delayed maintenance, while satisfying N−1 security constraints, operational limits, and crew availability. Case studies on the IEEE 300-bus test system demonstrate the effectiveness of the proposed approach in producing feasible and cost-effective maintenance schedules. To address scalability and combinatorial complexity, the model is mapped into a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling exploration of solution approaches based on Quantum Imaginary Time Evolution (QITE). While the QUBO reformulation provides a foundation for future quantum-inspired optimization, this study focuses primarily on the development and demonstration of the classical optimization framework and illustrates the potential applicability of QITE in large-scale maintenance scheduling.

Chen, Yang [ORNL] (ORCID:0000000271693874)↗

A backward SDE method for uncertainty quantification in deep learning

Here, we develop a backward stochastic differential equation based probabilistic machine learning method, which formulates a class of stochastic neural networks as a stochastic optimal control problem. An efficient stochastic gradient descent algorithm is introduced with the gradient computed through a backward stochastic differential equation. Convergence analysis for stochastic gradient descent optimization and numerical experiments for applications of stochastic neural networks are carried out to validate our methodology in both theory and performance.

97 MATHEMATICS AND COMPUTING↗

LLGOMAX: Enhancing Industry-Standard Tools for AC Optimal Unit Commitment (CRADA Final Report)

This was a collaborative effort between Lawrence Livermore National Security, LLC ("LLNS"), as manager and operator of Lawrence Livermore National Laboratory ("LLNL") and ECCO International Inc. ("Participant"). The team designed and implemented a new approach for the Security-Constrained Alternating-Current Unit Commitment (SCACUC) problem. The SCACUC problem is a mathematical optimization problem that decides which generating units should be online and how much power should be produced (and consumed) at each point of the power grid. The decisions are made so as to minimize the total cost of supplying electricity while respecting technical constraints of the power grid, both under normal and emergency conditions. The team developed a solution for SCACUC as specified in the ARPA-E Grid Optimization Competition (GOC) Challenge 3, which put forth a forward-looking version of the problem, which many features not present in today’s electricity market specifications for SCACUC.

24 POWER TRANSMISSION AND DISTRIBUTION↗