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 757 records · Page 42

Toward cities without slums: Topology and the spatial evolution of neighborhoods

The world is urbanizing quickly with nearly 4 billion people presently living in urban areas, about 1 billion of them in slums. Achieving sustainable development from rapid urbanization relies critically on creating cities without slums. We show that it is possible to diagnose systematically the central physical problem of slums—the lack of spatial accesses and related services—using a topological analysis of neighborhood maps and resolved by finding solutions to a sequence of constrained optimization problems. We set up the problem by showing that the built environment of any city can be decomposed into two types of networked spaces—accesses and places—and prove that these spaces display universal topological characteristics. We then show that while the neighborhoods of developed cities express the same common topology, urban slums fall into a different topological class. We demonstrate that it is always possible to find solutions that grow a street network in existing slums, providing universal accesses at minimal disruption and cost. We then show how elaborations of this procedure that include local preferences and reduce travel distances between places result from additional access construction. These methods are presently taking effect in neighborhoods in Cape Town (South Africa) and Mumbai (India), demonstrating their practical feasibility and emphasizing their role as a platform to enable communities and local governments to combine technical knowledge with local aspirations into contextually appropriate urban sustainable development solutions.

99 GENERAL AND MISCELLANEOUS↗

Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Model Implementation (PART 1)

We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l 1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.

25 ENERGY STORAGE↗

Dynamic Modeling, Trajectory Optimization, and Linear Control of Cable-Driven Parallel Robots for Automated Panelized Building Retrofits

The construction industry faces a growing need for automation to reduce costs, improve accuracy and productivity, and address labor shortages. One area that stands to benefit significantly from automation is panelized prefabricated building envelope retrofits, which can improve a building’s energy efficiency in heating and cooling interior spaces. In this paper, we propose using cable-driven parallel robots (CDPRs), which can effectively lift and handle large objects, to install these panels. However, implementing CDPRs presents significant challenges because of their nonlinear dynamics, complex trajectory planning, and precise control requirements. To tackle these challenges, this work focuses on a new application of established control and trajectory optimization theories in a CDPR simulation of a building envelope retrofit under real-world conditions. We first model the dynamics of CDPRs, highlighting the critical role of damping in system behavior. Building on this dynamic model, we formulate a trajectory optimization problem to generate feasible and efficient motion plans for the robot under operational and environmental constraints. Given the high precision required in the construction industry, accurately tracking the optimized trajectory is essential. However, challenges such as partial observability and external vibrations complicate this task. To address these issues, a Linear Quadratic Gaussian control framework is applied, enabling the robot to track the optimized trajectories with precision. Simulation results show that the proposed controller enables precise end effector positioning with errors under 4 mm, even in the presence of external wind disturbances. Through comprehensive simulations, our approach allows for an in-depth exploration of the system’s nonlinear dynamics, trajectory optimization, and control strategies under controlled yet highly realistic conditions. The results demonstrate the feasibility of CDPRs for automating panel installation and provide insights into their practical deployment.

CDPR↗

Introducing the target-matrix paradigm for mesh optimization via node-movement.

A general-purpose algorithm for mesh optimization via node movement, known as the Target-Matrix Paradigm, is introduced. The algorithm is general purpose in that it can be applied to a wide variety of mesh and element types, and to various commonly recurring mesh optimization problems such as shape improvement, and to more unusual problems like boundary-layer preservation with sliver removal, high-order mesh improvement, and edge-length equalization. The algorithm can be considered to be a direct optimization method in which weights are automatically constructed to enable definitions of application-specific mesh quality. The high-level concepts of the paradigm have been implemented in the Mesquite mesh-improvement library, along with a number of concrete algorithms that address mesh quality issues such as those shown in the examples of the present paper.

99 GENERAL AND MISCELLANEOUS↗

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗

A dual mesh method with adaptivity for stress-constrained topology optimization

This paper is concerned with the topological optimization of elastic structures, with the goal of minimizing the compliance and/or mass of the structure, subject to a stress constraint. It is well known that depending upon the geometry and the loading conditions, the stress field can exhibit singularities, if these singularities are not adequately resolved, the topological optimization process will be ineffective. For computational efficiency, adaptive mesh refinement is required to adequately resolve the stress field. This poses a challenge for the traditional Solid Isotropic Material with Penalization (SIMP) method that employs a one-to-one correspondence between the finite element mesh and the optimization design variables because as the mesh is refined, the optimization process must somehow be re-started with a new set of design variables. The proposed solution here is a dual mesh approach, one finite element mesh defines the material distribution, a second finite element mesh is used for the computation of the displacement and stress fields. This allows for stress-based adaptive mesh refinement without modifying the definition of the optimization design variables. A second benefit of this dual mesh approach is that there is no need to apply a filter to the design variables to enforce a length scale, instead the length scale is determined by the design mesh. This reduces the number of design variables and allows the designer to apply spatially varying length scale if desired. The efficacy of this dual mesh approach is established via several stress-constrained topology optimization problems.

36 MATERIALS SCIENCE↗

Learning-Accelerated ADMM for Distributed DC Optimal Power Flow

We suggest a novel data-driven method to accelerate the convergence of Alternating Direction Method of Multipliers (ADMM) for solving distributed DC optimal power flow (DC-OPF) where lines are shared between independent network partitions. Using previous observations of ADMM trajectories for a given system under varying load, the method trains a recurrent neural network (RNN) to predict the converged values of dual and consensus variables. Given a new realization of system load, a small number of initial ADMM iterations is taken as input to infer the converged values and directly inject them into the iteration. We empirically demonstrate that the online injection of these values into the ADMM iteration accelerates convergence by a significant factor for partitioned 14-, 118-and 2848-bus test systems under differing load scenarios. The proposed method has several advantages: it maintains the security of private decision variables inherent in consensus ADMM; inference is fast and so may be used in online settings; RNN-generated predictions can dramatically improve time to convergence but, by construction, can never result in infeasible ADMM subproblems; it can be easily integrated into existing software implementations. While we focus on the ADMM formulation of distributed DC-OPF in this paper, the ideas presented are naturally extended to other distributed optimization problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A multi-objective optimization approach to optimal sensor location problem in $\mathrm{IGCC}$ power plants

Integrated Gasification Combined Cycle (IGCC) power plants provide a cleaner and more efficient way to obtain energy from coal. In order to operate an IGCC power plant in a safe and stable manner, several input and output process parameters need to be monitored. However, due to economic and operational constraints, it is infeasible to place sensors at every input and output process parameter location. Hence, it becomes important to select the most effective sensor locations which lead to maximum information gain about the plant conditions. Practical issues present in an IGCC power plant, such as harsh physical conditions and variability in process parameters, make the optimal sensor location problem an especially complicated one. Further, sensors can have multiple objectives and they can produce uncertainties due to measurement errors. Here this work considers hybrid hardware and virtual sensing for advanced power systems with multiple objectives. In order to solve this real world large scale problem, we use a novel algorithm called Better Optimization of Nonlinear Uncertain Systems (BONUS). BONUS works in probability distribution space and avoids sampling for each optimization and derivative calculations iterations. A new algorithm for multi-objective optimization is also developed specifically for problem. The result of this nonlinear stochastic multi-objective problem is the non-dominated, or Pareto set, which provides trade-offs between various objectives like observability, cost, and thermal efficiency. This is the first attempt at solving the problem of optimal sensor deployment in advanced power plants, with consideration of hybrid hardware and virtual sensing and incorporation of uncertainty with multiple objectives.

01 COAL, LIGNITE, AND PEAT↗

Machine learning-based ethylene concentration estimation, real-time optimization and feedback control of an experimental electrochemical reactor

With the increase in electricity supply from clean energy sources, electrochemical reduction of carbon dioxide (CO 2 ) has received increasing attention as an alternative source of carbon-based fuels. As CO 2 reduction is becoming a stronger alternative for the clean production of chemicals, the need to model, optimize and control the electrochemical reduction of the CO 2 process becomes inevitable. However, on one hand, a first-principles model to represent the electrochemical CO 2 reduction has not been fully developed yet because of the complexity of its reaction mechanism, which makes it challenging to define a precise state-space model for the control system. On the other hand, the unavailability of efficient concentration measurement sensors continues to challenge our ability to develop feedback control systems. Gas chromatography (GC) is the most common equipment for monitoring the gas product composition, but it requires a period of time to analyze the sample, which means that GC can provide only delayed measurements during the operation. Moreover, the electrochemical CO 2 reduction process is catalyzed by a fast-deactivating copper catalyst and undergoes a selectivity shift from the product-of-interest at the later stages of experiments, which can pose a challenge for conventional control methods. To this end, machine learning (ML) techniques provide a potential approach to overcome those difficulties due to their demonstrated ability to capture the dynamic behavior of a chemical process from data. Motivated by the above considerations, we propose a machine learning-based modeling methodology that integrates support vector regression and first-principles modeling to capture the dynamic behavior of an experimental electrochemical reactor; this model, together with limited gas chromatography measurements, is employed to predict the evolution of gas-phase ethylene concentration. The model prediction is directly used in a proportional-integral (PI) controller that manipulates the applied potential to regulate the gas-phase ethylene concentration at energy-optimal set-point values computed by a real-time process optimizer (RTO). Specifically, the RTO calculates the operation set-point by solving an optimization problem to maximize the economic benefit of the reactor. Finally, suitable compensation methods are introduced to further account for the experimental uncertainties and handle catalyst deactivation. The proposed modeling, optimization, and control approaches are the first demonstration of active control for a CO 2 electrolyzer and contribute to the automation and scale-up efforts for electrified manufacturing of fuels and chemicals starting from CO 2 .

42 ENGINEERING↗

Design optimization methods for high-performance research reactor core design

Typical objectives of high-performance research reactors include neutron scattering, materials irradiation, and isotope production. The creation of a core that optimizes these multiple objectives often presents a multidimensional (i.e., in design space), multiobjective optimization problem. The developed systematic approach discussed herein draws on response surface methodology to validate and leverage a surrogate model to serve in place of high-fidelity computational analyses. Optimization and design analysis methods leverage this surrogate model to provide a flexible tool for generating optimized designs and understanding the impact of design decisions on desired metrics. In applications to High Flux Isotope Reactor (HFIR) low-enriched uranium (LEU) core designs, neutronic, isotopic evolution, and thermal hydraulic analyses are used to generate key performance and safety metrics for assessing the feasibility and fitness of given designs. Three optimized designs that determine different desired metrics and constraints (e.g., key metric weighting and fabrication constraints) are presented, providing potential design options that satisfy the requirements for HFIR’s conversion from high enriched uranium to LEU fuel.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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↗

Online accelerator optimization with a machine learning-based stochastic algorithm

Abstract Online optimization is critical for realizing the design performance of accelerators. Highly efficient stochastic optimization algorithms are needed for many online accelerator optimization problems in order to find the global optimum in the non-linear, coupled parameter space. In this study, we propose to use the multi-generation Gaussian process optimizer for online accelerator optimization and demonstrate that the algorithm is significantly more efficient than other stochastic algorithms that are commonly used in the accelerator community.

Zhang, Zhe (ORCID:0000000281430381)↗

TH-E-BRF-01: Exploiting Tumor Shrinkage in Split-Course Radiotherapy

Purpose: In split-course radiotherapy, a patient is treated in several stages separated by weeks or months. This regimen has been motivated by radiobiological considerations. However, using modern image-guidance, it also provides an approach to reduce normal tissue dose by exploiting tumor shrinkage. In this work, we consider the optimal design of split-course treatments, motivated by the clinical management of large liver tumors for which normal liver dose constraints prohibit the administration of an ablative radiation dose in a single treatment. Methods: We introduce a dynamic tumor model that incorporates three factors: radiation induced cell kill, tumor shrinkage, and tumor cell repopulation. The design of splitcourse radiotherapy is formulated as a mathematical optimization problem in which the total dose to the liver is minimized, subject to delivering the prescribed dose to the tumor. Based on the model, we gain insight into the optimal administration of radiation over time, i.e. the optimal treatment gaps and dose levels. Results: We analyze treatments consisting of two stages in detail. The analysis confirms the intuition that the second stage should be delivered just before the tumor size reaches a minimum and repopulation overcompensates shrinking. Furthermore, it was found that, for a large range of model parameters, approximately one third of the dose should be delivered in the first stage. The projected benefit of split-course treatments in terms of liver sparing depends on model assumptions. However, the model predicts large liver dose reductions by more than a factor of two for plausible model parameters. Conclusion: The analysis of the tumor model suggests that substantial reduction in normal tissue dose can be achieved by exploiting tumor shrinkage via an optimal design of multi-stage treatments. This suggests taking a fresh look at split-course radiotherapy for selected disease sites where substantial tumor regression translates into reduced target volumes.

60 APPLIED LIFE SCIENCES↗

An MLIR-based Compiler Flow for System-Level Design and Hardware Acceleration

The generation of custom hardware accelerators for applications implemented within high-level productive programming frameworks requires considerable manual effort. To automate this process, we introduce \sodaopt, a compiler tool that extends the MLIR infrastructure. \sodaopt automatically searches, outlines, tiles, and pre-optimizes relevant code regions to generate high-quality accelerators through high-level synthesis. \sodaopt can support any high-level programming framework and domain-specific language that interface with the MLIR infrastructure. By leveraging MLIR, \sodaopt solves compiler optimization problems with specialized abstractions. Backend synthesis tools connect to \sodaopt through progressive intermediate representation lowerings. \sodaopt interfaces to a design space exploration engine to identify the combination of compiler optimization passes and options that provides high-performance generated designs for different backends and targets. We demonstrate the practical applicability of the compilation flow by exploring the automatic generation of accelerators for deep neural networks operators outlined at arbitrary granularity and by combining outlining with tiling on large convolution layers. Experimental results with kernels from the PolyBench benchmark show that \sodaopt high-level optimizations improve execution delays of synthesized accelerators up to 60x. We also show that for the selected kernels, our solution outperforms the current of state-of-the art in more than 70% of the benchmarks and provides better average speedup in 55% of them.

Bohm Agostini, Nicolas↗

Conceptual Design of Integrated Energy Systems with Market Interaction Surrogate Models

Most integrated energy system (IES) optimization frameworks employ the price-taker approximation, which ignores important interactions with market and can result in overestimated economic values. In this work, we pro-pose a machine learning surrogate-assisted optimization framework to quantify the IES/market interactions and thus go beyond price taker. We use time series clustering to generate representative IES operation profiles for the IES optimization problem and use machine learning surrogate models to predict the IES/market interaction. We quantify the accuracy of the time series clustering and surrogate models in a case study to optimally retrofit a nuclear power plant with polymer electrolyte membrane electrolyzer to co-produce electricity and hydrogen.

Chen, Xinhe↗

Conceptual Design of Integrated Energy Systems with Market Interaction Surrogate Models

Most integrated energy system (IES) optimization frameworks employ the price-taker approximation, which ignores important interactions with the market and can result in overestimated economic values. In this work, we propose a machine learning surrogate-assisted optimization framework to quantify IES/market interactions and thus go beyond price-taker. We use time series clustering to generate representative IES operation profiles for the optimization problem and use machine learning surrogate models to predict the IES/market interaction. We quantify the accuracy of the time series clustering and surrogate models in a case study to optimally retrofit a nuclear power plant with a polymer electrolyte membrane electrolyzer to co-produce electricity and hydrogen.

Chen, Xinhe↗

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗

Incorporating Wind Energy in Power System Restoration Planning

Wind energy is rapidly growing. While wind brings us clean and inexpensive energy, its inherent variability and uncertainty present challenges for the power grid. In particular, employing wind energy for power system restoration is very challenging. A fast and reliable restoration plays a vital role to achieve the self-healing power grid. This paper develops a novel offline restoration planning tool for harnessing wind energy to enhance grid resilience. The Wind-for-Restoration problem is formulated as a stochastic mixed-integer linear programming problem with generated wind energy scenarios. The problem is then decomposed into two stages and solved with the integer Lshaped algorithm. Numerical experiments have been conducted through different case studies using the modified IEEE 57-bus system. The developed tool can provide the scheduled wind power at each restoration time. The impact of wind energy is investigated from the aspects of location and inertia capability, as well as wind penetration, fluctuation, and uncertainty. Moreover, a dynamic response validation tool is developed to validate the results of optimization problem in a dynamic simulation software. Finally, simulation results demonstrate that the optimal wind harnessing strategy can help improve system restoration process and enhance system resilience.

17 WIND ENERGY↗