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,279 records · Page 71

An n -material thresholding method for improving integerness of solutions in topology optimization

It is common in solving topology optimization problems to replace an integer-valued characteristic function design field with the material volume fraction field, a real-valued approximation of the design field that permits "fictitious" mixtures of materials during intermediate iterations in the optimization process. This is reasonable so long as one can interpolate properties for such materials and so long as the final design is integer valued. For this purpose, we present a method for smoothly thresholding the volume fractions of an arbitrary number of material phases which specify the design. This method is trivial for two-material design problems, for example, the canonical topology design problem of specifying the presence or absence of a single material within a domain, but it becomes more complex when three or more materials are used, as often occurs in material design problems. We take advantage of the similarity in properties between the volume fractions and the barycentric coordinates on a simplex to derive a thresholding, method which is applicable to an arbitrary number of materials. As we show in a sensitivity analysis, this method has smooth derivatives, allowing it to be used in gradient-based optimization algorithms. Finally, we present results, which show synergistic effects when used with Solid Isotropic Material with Penalty and Rational Approximation of Material Properties material interpolation functions, popular methods of ensuring integerness of solutions.

42 ENGINEERING↗

Uncertain characterization of reservoir fluids due to brittleness of equation of state regression

Equations of state (EoS) play a central role in modeling the phase equilibrium of fluid mixtures. Their parameterization involves fitting a model to experimental data, i.e., solving a nonlinear, non-convex, multivariate optimization problem. The latter requires one to select design variables, domains of definition for each variable, and weights assigned to individual measurements. We demonstrate that subjective choices of an optimization algorithm and an initial guess also impact the regression process. Consequently, EoS predictions are fundamentally uncertain even after the EoS tuning to a limited set of experimental data points. We demonstrate this observation for two hydrocarbon reservoir fluids, in which five properties of the heaviest carbon fraction are treated as design variables. While all the optimization algorithms and initial guesses match experimental data for the gas and liquid properties, the resulting EoS parameterizations lead to dramatically different predictions of the fluid’s thermophysical behavior in the unsampled pressure and temperature regions. In conclusion, we propose the probabilistic treatment of design variables to quantify the predictive uncertainty of the resulting fluid models.

15 GEOTHERMAL ENERGY↗

Computing the shape gradient of stellarator coil complexity with respect to the plasma boundary

Coil complexity is a critical consideration in stellarator design. The traditional two-step optimization approach, in which the plasma boundary is optimized for physics properties and the coils are subsequently optimized to be consistent with this boundary, can result in plasma shapes which cannot be produced with sufficiently simple coils. To address this challenge, we propose a method to incorporate considerations of coil complexity in the optimization of the plasma boundary. Coil complexity metrics are computed from the current potential solution obtained with the REGCOIL code (Landreman, Nucl. Fusion , vol. 57, 2017, 046003). While such metrics have previously been included in derivative-free fixed-boundary optimization (Drevlak et al. , Nucl. Fusion , vol. 59, 2018, 016010), we compute the local sensitivity of these metrics with respect to perturbations of the plasma boundary using the shape gradient (Landreman & Paul, Nucl. Fusion , vol. 58, 2018, 076023). We extend REGCOIL to compute derivatives of these metrics with respect to parameters describing the plasma boundary. In keeping with previous research on winding surface optimization (Paul et al. , Nucl. Fusion , vol. 58, 2018, 076015), the shape derivatives are computed with a discrete adjoint method. In contrast with the previous work, derivatives are computed with respect to the plasma surface parameters rather than the winding surface parameters. To further reduce the resolution required to compute the shape gradient, we present a more efficient representation of the plasma surface which uses a single Fourier series to describe the radial distance from a coordinate axis and a spectrally condensed poloidal angle. This representation is advantageous over the standard cylindrical representation used in the VMEC code (Hirshman & Whitson, Phys. Fluids , vol. 26, 1983, pp. 3553–3568), as it provides a uniquely defined poloidal angle, eliminating a null space in the optimization of the plasma surface. In comparison with previous spectral condensation methods (Hirshman & Breslau, Phys. Plasmas , vol. 5, 1998, p. 2664), the modified poloidal angle is obtained algebraically rather than through the solution of a nonlinear optimization problem. The resulting shape gradient highlights features of the plasma boundary that are consistent with simple coils and can be used to couple coil and fixed-boundary optimization.

Physics↗

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation

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.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stochastic DG Placement for Conservation Voltage Reduction Based on Multiple Replications Procedure

Conservation voltage reduction (CVR) and distributed-generation (DG) integration are popular strategies implemented by utilities to improve energy efficiency. This paper investigates the interactions between CVR and DG placement to minimize load consumption in distribution networks, while keeping the lowest voltage level within the predefined range. The optimal placement of DG units is formulated as a stochastic optimization problem considering the uncertainty of DG outputs and load consumptions. A sample average approximation algorithm-based technique is developed to solve the formulated problem effectively. A multiple replications procedure is developed to test the stability of the solution and calculate the confidence interval of the gap between the candidate solution and optimal solution. The proposed method has been applied to the IEEE 37-bus distribution test system with different scenarios. The numerical results indicate that the implementations of CVR and DG, if combined, can achieve significant energy savings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Modeling State Transition and Head-Dependent Efficiency Curve for Pumped Storage Hydro in Look-Ahead Dispatch

As one of the most widely installed utility-scale storage facilities, pumped storage hydro (PSH) plays an essential role in providing flexibility for power systems worldwide. Thus, to accurately quantify the flexibility of PSH units in operational optimization problems is important. The conventional PSH models in the literature rarely consider detailed state transitions due to their hourly-based settings. However, it becomes imperative for operational optimization on short-term intervals, especially with increasing shares of renewable energy in power systems. To this end, this paper presents a novel deterministic PSH model that considers the transition time and trajectory between three states of PSH units in look-ahead dispatch. Moreover, to better characterize the varying efficiency of PSH units with water head and flow rate, this paper proposes to model detailed headdependent efficiency curves (hereafter called input-output curves) in look-ahead dispatch, which encounters heavy computational burdens when short time intervals are applied. In this work, a zig-zag piece-wise linear approximation method is used for input-output curve modeling. This can enable an accurate quantification for variable efficiency and head dependence in a computationally effective manner. Here, numerical results are presented to show performances of the proposed PSH model in both flexibility quantification and computation time.

13 HYDRO ENERGY↗

Multicriteria optimization of the spatial dose distribution

Purpose: Treatment planning for radiation therapy involves trade-offs with respect to different clinical goals. Typically, the dose distribution is evaluated based on few statistics and dose–volume histograms. Particularly for stereotactic treatments, the spatial dose distribution represents further criteria, e.g., when considering the gradient between subregions of volumes of interest. The authors have studied how to consider the spatial dose distribution using a multicriteria optimization approach.Methods: The authors have extended a stepwise multicriteria optimization approach to include criteria with respect to the local dose distribution. Based on a three-dimensional visualization of the dose the authors use a software tool allowing interaction with the dose distribution to map objectives with respect to its shape to a constrained optimization problem. Similarly, conflicting criteria are highlighted and the planner decides if and where to relax the shape of the dose distribution.Results: To demonstrate the potential of spatial multicriteria optimization, the tool was applied to a prostate and meningioma case. For the prostate case, local sparing of the rectal wall and shaping of a boost volume are achieved through local relaxations and while maintaining the remaining dose distribution. For the meningioma, target coverage is improved by compromising low dose conformality toward noncritical structures. A comparison of dose–volume histograms illustrates the importance of spatial information for achieving the trade-offs.Conclusions: The results show that it is possible to consider the location of conflicting criteria during treatment planning. Particularly, it is possible to conserve already achieved goals with respect to the dose distribution, to visualize potential trade-offs, and to relax constraints locally. Hence, the proposed approach facilitates a systematic exploration of the optimal shape of the dose distribution.

61 RADIATION PROTECTION AND DOSIMETRY↗

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↗

Tradeoff methods in multiobjective insensitive design of airplane control systems

The latest results of an ongoing study of computer-aided design of airplane control systems are given. Constrained minimization algorithms are used, with the design objectives in the constraint vector. The concept of Pareto optimiality is briefly reviewed. It is shown how an experienced designer can use it to find designs which are well-balanced in all objectives. Then the problem of finding designs which are insensitive to uncertainty in system parameters are discussed, introducing a probabilistic vector definition of sensitivity which is consistent with the deterministic Pareto optimal problem. Insensitivity is important in any practical design, but it is particularly important in the design of feedback control systems, since it is considered to be the most important distinctive property of feedback control. Methods of tradeoff between deterministic and stochastic-insensitive (SI) design are described, and tradeoff design results are presented for the example of the a Shuttle lateral stability augmentation system. This example is used because careful studies have been made of the uncertainty in Shuttle aerodynamics. Finally, since accurate statistics of uncertain parameters are usually not available, the effects of crude statistical models on SI designs are examined.

Schy, A. A.↗

Flight-test guidance for airbreathing hypersonic vehicles

A guidance solution for aerospace planes is given based on a family of energy-heading extremal solutions that can be used for feedback implementations. Test conditions are developed as steady-cruise solutions by means of energy-heading extremal solutions to a time/fuel-range flight-optimization problem. Feedback charts are derived that give control as a function of energy and heading-to-go, and the reduced-order model is compared to numerically optimized point-mass solutions for flight optimization. The energy-heading model is shown to provide feedback-control charts that yield fuel-efficient turn/acceleration maneuvers with significant weight-change as compared to the point-mass solutions. Such variables as Mach number, dynamic pressure, and lift are found to influence the solutions significantly.

Cliff, Eugene M.↗

Newton modified barrier method in constrained optimization

In this paper, we develop and investigate the Newton method for solving constrained (non-smooth) optimization problems. This approach is based on the modified barrier functions (MBF) theory and on the global converging step-size version of the Newton method for smooth unconstrained optimization. Due to the excellent properties of the MBF near primal-dual solution, the Newton modified barrier method (NMBM) has a better rate of convergence, better complexity bound, and is much more stable in the final stage of the computational process than the methods which are based on the classical barrier functions (CBF).

Polyak, R.↗

MESSENGER at Mercury: Early Orbital Operations

The MErcury Surface, Space ENvironment, GEochemistry, and Ranging (MESSENGER) spacecraft, launched in August 2004 under NASA's Discovery Program, was inserted into orbit about the planet Mercury in March 2011. MESSENGER's three flybys of Mercury in 2008-2009 marked the first spacecraft visits to the innermost planet since the Mariner 10 flybys in 1974-1975. The unprecedented orbital operations are yielding new insights into the nature and evolution of Mercury. The scientific questions that frame the MESSENGER mission led to the mission measurement objectives to be achieved by the seven payload instruments and the radio science experiment. Interweaving the full set of required orbital observations in a manner that maximizes the opportunity to satisfy all mission objectives and yet meet stringent spacecraft pointing and thermal constraints was a complex optimization problem that was solved with a software tool that simulates science observations and tracks progress toward meeting each objective. The final orbital observation plan, the outcome of that optimization process, meets all mission objectives. MESSENGER's Mercury Dual Imaging System is acquiring a global monochromatic image mosaic at better than 90% coverage and at least 250 m average resolution, a global color image mosaic at better than 90% coverage and at least 1 km average resolution, and global stereo imaging at better than 80% coverage and at least 250 m average resolution. Higher-resolution images are also being acquired of targeted areas. The elemental remote sensing instruments, including the Gamma-Ray and Neutron Spectrometer and the X-Ray Spectrometer, are being operated nearly continuously and will establish the average surface abundances of most major elements. The Visible and Infrared Spectrograph channel of MESSENGER's Mercury Atmospheric and Surface Composition Spectrometer is acquiring a global map of spectral reflectance from 300 to 1450 nm wavelength at a range of incidence and emission angles. Targeted areas have been selected for spectral coverage into the ultraviolet with the Ultraviolet and Visible Spectrometer (UVVS). MESSENGER's Mercury Laser Altimeter is acquiring topographic profiles when the slant range to Mercury's surface is less than 1800 km, encompassing latitudes from 20 deg. S to the north pole. Topography over the remainder of the southern hemisphere will be derived from stereo imaging, radio occultations, and limb profiles. MESSENGER's radio science experiment is determining Mercury's gravity field from Doppler signals acquired during frequent downlinks. MESSENGER's Magnetometer is measuring the vector magnetic field both within Mercury's magnetosphere and in Mercury's solar wind environment at an instrument sampling rate of up to 20 samples/s. The UVVS is determining the three-dimensional, time-dependent distribution of Mercury's exospheric neutral and ionic species via their emission lines. During each spacecraft orbit, the Energetic Particle Spectrometer measures energetic electrons and ions, and the Fast Imaging Plasma Spectrometer measures the energies and mass per charge of thermal plasma components, both within Mercury's magnetosphere and in Mercury's solar-wind environment. The primary mission observation sequence will continue for one Earth year, until March 2012. An extended mission, currently under discussion with NASA, would add a second year of orbital observations targeting a set of focused follow-on questions that build on observations to date and take advantage of the more active Sun expected during 2012-2013. MESSENGER's total primary mission cost, projected at $446 M in real-year dollars, is comparable to that of Mariner 10 after adjustment for inflation.

mercury↗

MESSENGER at Mercury: Early Orbital Operations

The MErcury Surface, Space ENvironment, GEochemistry, and Ranging (MESSENGER) spacecraft, launched in August 2004 under NASA's Discovery Program, was inserted into orbit about the planet Mercury in March 2011. MESSENGER's three flybys of Mercury in 2008-2009 marked the first spacecraft visits to the innermost planet since the Mariner 10 flybys in 1974-1975. The unprecedented orbital operations are yielding new insights into the nature and evolution of Mercury. The scientific questions that frame the MESSENGER mission led to the mission measurement objectives to be achieved by the seven payload instruments and the radio science experiment. Interweaving the full set of required orbital observations in a manner that maximizes the opportunity to satisfy all mission objectives and yet meet stringent spacecraft pointing and thermal constraints was a complex optimization problem that was solved with a software tool that simulates science observations and tracks progress toward meeting each objective. The final orbital observation plan, the outcome of that optimization process, meets all mission objectives. MESSENGER's Mercury Dual Imaging System is acquiring a global monochromatic image mosaic at better than 90%coverage and at least 250 m average resolution, a global color image mosaic at better than 90%coverage and at least 1 km average resolution, and global stereo imaging at better than 80%coverage and at least 250 m average resolution. Higher-resolution images are also being acquired of targeted areas. The elemental remote sensing instruments, including the Gamma-Ray and Neutron Spectrometer and the X-Ray Spectrometer, are being operated nearly continuously and will establish the average surface abundances of most major elements. The Visible and Infrared Spectrograph channel of MESSENGER's Mercury Atmospheric and Surface Composition Spectrometer is acquiring a global map of spectral reflectance from 300 to 1450 nm wavelength at a range of incidence and emission angles. Targeted areas have been selected for spectral coverage into the ultraviolet with the Ultraviolet and Visible Spectrometer (UVVS). MESSENGER's Mercury Laser Altimeter is acquiring topographic profiles when the slant range to Mercury's surface is less than 1800 km, encompassing latitudes from 201S to the north pole. Topography over the remainder of the southern hemisphere will be derived from stereo imaging, radio occultations, and limb profiles. MESSENGER's radio science experiment is determining Mercury's gravity field from Doppler signals acquired during frequent downlinks. MESSENGER's Magnetometer is measuring the vector magnetic field both within Mercury's magnetosphere and in Mercury's solar wind environment at an instrument sampling rate of up to 20 samples/s. The UVVS is determining the three-dimensional, time-dependent distribution of Mercury's exospheric neutral and ionic species via their emission lines. During each spacecraft orbit, the Energetic Particle Spectrometer measures energetic electrons and ions, and the Fast Imaging Plasma Spectrometer measures the energies and mass per charge of thermal plasma components, both within Mercury's magnetosphere and in Mercury's solar-wind environment. The primary mission observation sequence will continue for one Earth year, until March 2012. An extended mission, currently under discussion with NASA, would add a second year of orbital observations targeting a set of focused follow-on questions that build on observations to date and take advantage of the more active Sun expected during 2012-2013. MESSENGER's total primary mission cost, projected at $446 M in real-year dollars, is comparable to that of Mariner 10 after adjustment for inflation.

Planetary Science↗

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↗

Curved Finite Elements and Curve Approximation

The approximation of parameterized curves by segments of parabolas that pass through the endpoints of each curve segment arises naturally in all quadratic isoparametric transformations. While not as popular as cubics in curve design problems, the use of parabolas allows the introduction of a geometric measure of the discrepancy between given and approximating curves. The free parameters of the parabola may be used to optimize the fit, and constraints that prevent overspill and curve degeneracy are introduced. This leads to a constrained optimization problem in two varibles that can be solved quickly and reliably by a simple method that takes advantage of the special structure of the problem. For applications in the field of computer-aided design, the given curves are often cubic polynomials, and the coefficient may be calculated in closed form in terms of polynomial coefficients by using a symbolic machine language so that families of curves can be approximated with no further integration. For general curves, numerical quadrature may be used, as in the implementation where the Romberg quadrature is applied. The coefficient functions C sub 1 (gamma) and C sub 2 (gamma) are expanded as polynomials in gamma, so that for given A(s) and B(s) the integrations need only be done once. The method was used to find optimal constrained parabolic approximation to a wide variety of given curves.

Baart, M. L.↗

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↗