Search NASA⌕ Search

SEARCH · Search NASA

Results for “Continuous optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Resilient Design of Continuous-time Distributed Optimization Algorithm in the Presence of Cyber-attacks

This paper presents a continuous-time resilient distributed optimization algorithm based on competitive interaction design method on connected graphs in the presence of adversaries. Here, the competitive interaction method allows us to design a network that protects the multi-agent systems from adversaries without requiring high network connectivity. In addition, the proposed algorithm does not require the global information about the number of adversaries. First, we show that the proposed distributed algorithm solves the resilient distributed optimization problem with no attack on the communication links. Second, we show that the proposed continuous-time distributed optimization algorithm on connected graphs converges to the small neighborhood of the optimal solution in the presence of cyber-attacks onto the communication channel. Simulations are presented to illustrate our theoretical results.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1982

Engineering calculations for communications systems planning

The single entry interference problem is treated for frequency sharing between the broadcasting satellite and intersatellite services near 23 GHz. It is recommended that very long (more than 120 longitude difference) intersatellite hops be relegated to the unshared portion of the band. When this is done, it is found that suitable orbit assignments can be determined easily with the aid of a set of universal curves. An attempt to develop synthesis procedures for optimally assigning frequencies and orbital slots for the broadcasting satellite service in region 2 was initiated. Several discrete programming and continuous optimization techniques are discussed.

Levis, C. A.↗
DOE OSTI2023

Not so HOT Triangulations

Here, we propose primal–dual mesh optimization algorithms that overcome shortcomings of the standard algorithm while retaining some of its desirable features. “Hodge-Optimized Triangulations” defines the “HOT energy” as a bound on the discretization error of the diagonalized Delaunay Hodge star operator. HOT energy is a natural choice for an objective function, but unstable for both mathematical and algorithmic reasons: it has minima for collapsed edges, and its extrapolation to non-regular triangulations is inaccurate and has unbounded minima. We propose a different extrapolation with a stronger theoretical foundation, and avoid extrapolation by recalculating the objective just beyond the flip threshold. We propose new objectives, based on normalizations of the HOT energy, with barriers to edge collapses and other undesirable configurations. We propose mesh improvement algorithms coupling these. When HOT optimization nearly collapses an edge, we actually collapse the edge. Otherwise, we use the barrier objective to update positions and weights and remove vertices. By combining discrete connectivity changes with continuous optimization, we more fully explore the space of possible meshes and obtain higher quality solutions.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

A survey of methods of feasible directions for the solution of optimal control problems

Three methods of feasible directions for optimal control are reviewed. These methods are an extension of the Frank-Wolfe method, a dual method devised by Pironneau and Polack, and a Zontendijk method. The categories of continuous optimal control problems are shown as: (1) fixed time problems with fixed initial state, free terminal state, and simple constraints on the control; (2) fixed time problems with inequality constraints on both the initial and the terminal state and no control constraints; (3) free time problems with inequality constraints on the initial and terminal states and simple constraints on the control; and (4) fixed time problems with inequality state space contraints and constraints on the control. The nonlinear programming algorithms are derived for each of the methods in its associated category.

Polak, E.↗
NASA NTRS1987

A method for nonlinear optimization with discrete design variables

A numerical method is presented for the solution of nonlinear discrete optimization problems. The applicability of discrete optimization to engineering design is discussed, and several standard structural optimization problems are solved using discrete design variables. The method uses approximation techniques to create subproblems suitable for linear mixed-integer programming methods. The method employs existing software for continuous optimization and integer programming.

Olsen, Gregory R.↗
DOE OSTI2021

Port and optimize the CEED software stack to Aurora/Frontier EA (ECP Milestone Report)

The goal of this milestone was to port the CEED software stack, including Nek, MFEM and libCEED to the Frontier and Aurora early access hardware, work on optimizing the performance on AMD and Intel GPUs, and demonstrate impact in CEED-enabled ECP applications. As part of this milestone, we also performed a number of other activities, including continued optimizations for CEED applications at scale on Summit, performance evaluation on non-ECP hardware, including the Fugaku’s A64FX chip and the NVIDIA A100 GPU architecture, exploring the use of just-in-time compilations in applications at scale and potential of mixed precision optimizations in the CEED discretization and solver algorithms, and more. During the milestone period, the CEED team released new versions of 6 of its packages, including major releases of MFEM, NekRS and OCCA. We also organized the fifth CEED Annual meeting (CEED5AM) which included nearly 100 researchers from national labs, universities and industry.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Fast, Dynamic, and Scalable Algorithms for Large-Scale Constrained Optimization

Scientists and engineers constantly aim to optimize an objective subject to physical, environmental, and/or resource constraints. The technique of using mathematical models to formulate and find real solutions of such problems is known as mathematical optimization, a process that has become invaluable for design and discovery in numerous scientific fields. This project has focused on the design, analysis, and implementation of high-performance computing algorithms for solving cutting-edge optimization problems. These include problems that involve (1) data uncertainties, such as those in the future supply, demand, and capacity of a given power system, (2) extreme numbers of alternatives, such as in the design of electrical power grids to avoid network vulnerabilities, and (3) real-time decisions, such as in the control of chemical reactors. The key features of the new algorithms are that they are fast, dynamic, and scalable to meet the computational requirements of scientists and researchers working to optimize large-scale, complex systems. The algorithms that have been designed, analyzed, and tested as part of the project can be characterized based on the types of optimization problems they have been designed to solve. Much of the work has focused on algorithms for solving large-scale constrained optimization problems. Contributions have also been made in the design of algorithms for unconstrained optimization, with some specialized methods for solving problems that have inherent nonsmoothness. Contributions have also been made in areas that have grown to prominence in the field over the five-year award period. These include the design of algorithms for solving large-scale stochastic optimization problems, such as those that arise in large-scale machine learning, and in complexity analyses for solving nonconvex problems, which has been a focal point of much recent work in continuous optimization. Overall, the project has supported work that has led to almost 30 articles that have been published or accepted to top journals in the field of mathematical optimization.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Piloted Evaluation of a Fault Recovery System for an Aircraft with Distributed Electric Propulsion

Electrified aircraft powertrains contain multiple tightly coupled subsystems, making them much more complex than traditional aircraft propulsion systems, both in terms of integration and control. Electrification enables aircraft to have multiple distributed thrust-producing fans that the flight control system can utilize for enhanced maneuverability, further increasing the control complexity. The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept aircraft that leverages this technology. SUSAN is a series/parallel partial hybrid electric single-aisle transport aircraft that takes advantage of its electrified powertrain to provide fuel burn and emissions benefits when compared to the state-of-the-art. Achieving these benefits requires an appropriately designed control architecture that coordinates the various powertrain and flight control subsystems. As such, the SUSAN aircraft is designed with a high level of automation, allowing it to properly manage coupled subsystems and react rapidly to failures and anomalies. To do this effectively, algorithms that perform component health management, fault detection, isolation, and accommodation, and continuous optimization, must be developed, tested, validated, and implemented. This paper describes a piloted evaluation of such an algorithm in scenarios with multiple fan failures, performed in a flight simulator, demonstrating failure recovery and continued safe operation up to the limits of the powertrain. These scenarios are subsequently related to certification requirements.

Electrified Aircraft Propulsion↗
NASA NTRS2025

Piloted Evaluation of a Fault Recovery System for an Aircraft with Distributed Electric Propulsion

Electrified aircraft powertrains contain multiple tightly coupled subsystems, making them much more complex than traditional aircraft propulsion systems, both in terms of integration and control. Electrification enables aircraft to have multiple distributed thrust-producing fans that the flight control system can utilize for enhanced maneuverability, further increasing the control complexity. The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept aircraft that leverages this technology. SUSAN is a series/parallel partial hybrid electric single-aisle transport aircraft that takes advantage of its electrified powertrain to provide fuel burn and emissions benefits when compared to the state-of-the-art. Achieving these benefits requires an appropriately designed control architecture that coordinates the various powertrain and flight control subsystems. As such, the SUSAN aircraft is designed with a high level of automation, allowing it to properly manage coupled subsystems and react rapidly to failures and anomalies. To do this effectively, algorithms that perform component health management, fault detection, isolation, and accommodation, and continuous optimization, must be developed, tested, validated, and implemented. This paper describes a piloted evaluation of such an algorithm in scenarios with multiple fan failures, performed in a flight simulator, demonstrating failure recovery and continued safe operation up to the limits of the powertrain. These scenarios are subsequently related to certification requirements.

Electrified Aircraft Propulsion↗
NASA NTRSDate not supplied

Piloted Evaluation of a Fault Recovery System for an Aircraft with Distributed Electric Propulsion

Electrified aircraft powertrains contain multiple tightly coupled subsystems, making them much more complex than traditional aircraft propulsion systems, both in terms of integration and control. Electrification enables aircraft to have multiple distributed thrust-producing fans that the flight control system can utilize for enhanced maneuverability, further increasing the control complexity. The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept aircraft that leverages this technology. SUSAN is a series/parallel partial hybrid electric single-aisle transport aircraft that takes advantage of its electrified powertrain to provide fuel burn and emissions benefits when compared to the state-of-the-art. Achieving these benefits requires an appropriately designed control architecture that coordinates the various powertrain and flight control subsystems. As such, the SUSAN aircraft is designed with a high level of automation, allowing it to properly manage coupled subsystems and react rapidly to failures and anomalies. To do this effectively, algorithms that perform component health management, fault detection, isolation, and accommodation, and continuous optimization, must be developed, tested, validated, and implemented. This paper describes a piloted evaluation of such an algorithm in scenarios with multiple fan failures, performed in a flight simulator, demonstrating failure recovery and continued safe operation up to the limits of the powertrain. These scenarios are subsequently related to certification requirements.

Electrified Aircraft Propulsion↗
NASA NTRS2002

Combinatorial Multiobjective Optimization Using Genetic Algorithms

The research proposed in this document investigated multiobjective optimization approaches based upon the Genetic Algorithm (GA). Several versions of the GA have been adopted for multiobjective design, but, prior to this research, there had not been significant comparisons of the most popular strategies. The research effort first generalized the two-branch tournament genetic algorithm in to an N-branch genetic algorithm, then the N-branch GA was compared with a version of the popular Multi-Objective Genetic Algorithm (MOGA). Because the genetic algorithm is well suited to combinatorial (mixed discrete / continuous) optimization problems, the GA can be used in the conceptual phase of design to combine selection (discrete variable) and sizing (continuous variable) tasks. Using a multiobjective formulation for the design of a 50-passenger aircraft to meet the competing objectives of minimizing takeoff gross weight and minimizing trip time, the GA generated a range of tradeoff designs that illustrate which aircraft features change from a low-weight, slow trip-time aircraft design to a heavy-weight, short trip-time aircraft design. Given the objective formulation and analysis methods used, the results of this study identify where turboprop-powered aircraft and turbofan-powered aircraft become more desirable for the 50 seat passenger application. This aircraft design application also begins to suggest how a combinatorial multiobjective optimization technique could be used to assist in the design of morphing aircraft.

Crossley, William A.↗
DOE OSTI2023

DOE Bioenergy Technologies Office (BETO) 2023 Project Peer Review: WBS 2.4.1.100 Bench Scale Research & Development

Bench Scale Integration develops and optimizes fermentation processes to produce bio-based fuels and chemicals for commercial scale-up. The project uses fermentation science to achieve high titers and production rates by, for example, manipulating how the microorganisms are fed biomass sugars and nutrients, modifying fermentation conditions (pH, temperature, aeration) or developing online control strategies for better fermentation operations and high titer, rates, and yield (TRY). For this period of performance, we continued our development of a commercial-ready 2,3-butanediol (BDO) fermentation from biomass sugars utilizing NREL's proprietary Zymomonas mobilis microorganism. The engineered Z. mobilis can use all the main sugars in corn stover biomass, which are glucose, xylose, and arabinose. BDO is a versatile, low-carbon chemical which can be catalytically upgraded to a variety of hydrocarbon fuels and chemicals. The project had three goals during this review period; evaluate the technical feasibility of using whole slurry pretreated corn stover to achieve the techno-economic analysis (TEA) performance goals, continue optimizing a liquor-based fed-batch fermentation process for high titer, and develop strategies to enable scale-up. After evaluating different iterations of a whole slurry fermentation that did not meet the TEA goals, a Go/No-Go decision was made to pivot to liquor-only with new TEA performance targets, the main one being 140 g/L titer. We successfully met this goal, producing 141 g/L BDO at 1 g/L-hr productivity and 84% process yield. This titer and productivity attracted industrial interest to scale the fermentation resulting in a Technology Commercialization Fund project award in 2022. We used an NREL developed near-infra red (NIR) spectroscopy method for rapid analysis which allowed for changes to aeration levels and sugar feeding during the fermentation to maximize BDO production. The NIR analysis can be done using a hand-held spectrometer, essentially taking the analysis on to the plant floor during scale-up and preliminary work shows the feasibility of using an online probe for continuous monitoring and control. The other scale-up tool is mapping oxygen transfer coefficient (kLa) and oxygen transfer rate (OTR) in various vessels to find conditions that match the optimized 500 mL vessels. Showing a correlation to the mapping work, which is done with water and a dissolved oxygen probe, can reduce the risk of failed fermentations during scale-up. Our end-of-project goal is to meet the design target BDO titer (140-150 g/L) from DMR corn stover liquor at 1000L or larger scale to demonstrate BDO process design case and transfer the technology to industrial fermentation stakeholders for commercialization.

2 3-butanediol↗
DOE OSTI2023

The Uniform Methods Project: Smart Thermostat Evaluation Protocol

A smart thermostat is an internet-connected device that controls home heating, ventilation, and air-conditioning (HVAC) equipment and can automatically adjust temperature set points to optimize performance and achieve energy savings. Smart thermostat features often include two way communication, occupancy detection (such as geofencing and occupancy sensors), schedule learning, and seasonal optimization algorithms. Smart thermostats can control most conventional HVAC systems, including central air conditioners, heat pumps, and forced air furnaces. Several types of residential utility programs offer smart thermostats as replacements measures. Working with smart thermostat vendors, utilities can offer separate optimization programs to produce energy savings beyond those achieved by installing a smart thermostat. From an evaluation perspective, smart thermostat programs have several noteworthy features. First, the energy savings from a smart thermostat may change over the life of the device. As a smart thermostat is connected to the internet, original equipment manufacturers can update the thermostat software to improve the thermostat's energy efficiency. Likewise, users can adjust the thermostat settings and schedules over time in response to changes in weather, thermal comfort, energy prices, or preferences for energy efficiency. Additionally, many thermostat manufacturers offer seasonal optimization programs that recommend changes or make minor, automated adjustments to the thermostat settings to improve energy efficiency. These opt-in programs are now standard offerings for many smart thermostat manufacturers and provided at no additional cost to users. The potential for software updates and continuous optimization and the evolving nature of user interactions mean future energy savings may differ from first-year savings and the energy savings of smart thermostats may need to be evaluated more than once. Second, smart thermostats often have small unit energy savings relative to a home's total energy consumption, especially in comparison to whole- home retrofit programs. This can make it difficult to detect the smart thermostat savings in billing or advanced metering infrastructure (AMI) meter consumption data. For example, as cooling loads in many regions average about 20% of annual electricity consumption, smart thermostat savings of 10% of cooling energy use would equate to a 2% reduction in home electricity consumption. Evaluators should use regression analysis of whole-home billing consumption or advanced metering infrastructure (AMI) meter consumption data to evaluate smart thermostat savings because, as explained at greater length below , these data are usually available to evaluators and regression can control for the impacts of weather and other potentially confounding factors on a home's energy consumption. Finally, as with other energy efficiency programs, participation in smart thermostat programs is self-selective. As discussed at greater length below , smart thermostat participants tend to be, among other things, younger, higher-income, and more likely to adopt electric vehicles (EVs) and internet connected devices than nonparticipants. These differences are often unobservable to the evaluator and correlated with a home's energy consumption, creating the potential for bias in estimating savings. Due to the small unit savings of thermostats, errors and biases from self-selection that may not be very consequential when evaluating a whole- home retrofits (e.g., ±2% of home electricity consumption) can have a major impact when evaluating the savings and cost-effectiveness of smart thermostat programs. A percentage point change in the estimated savings could affect the cost-effectiveness of a program. This means it is important for evaluators to assess and to minimize the potential for error from selection bias in estimating smart thermostat program savings. The Uniform Methods Project provides model protocols for determining energy savings and demand reductions that result from specific energy efficiency measures implemented through state and utility programs. In most cases, the measure protocols are based on a particular option identified by the International Performance Verification and Measurement Protocol ; however, this work provides a more detailed approach to implementing that option. Each chapter is written by technical experts in collaboration with their peers, reviewed by industry experts, and subject to public review and comment. The UMP protocols can be used by utilities, program administrators, public utility commissions, evaluators, and other stakeholders for both program planning and evaluation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS2001

Bell-Curve Based Evolutionary Strategies for Structural Optimization

Evolutionary methods are exceedingly popular with practitioners of many fields; more so than perhaps any optimization tool in existence. Historically Genetic Algorithms (GAs) led the way in practitioner popularity. However, in the last ten years Evolutionary Strategies (ESs) and Evolutionary Programs (EPS) have gained a significant foothold. One partial explanation for this shift is the interest in using GAs to solve continuous optimization problems. The typical GA relies upon a cumbersome binary representation of the design variables. An ES or EP, however, works directly with the real-valued design variables. For detailed references on evolutionary methods in general and ES or EP in specific see Back and Dasgupta and Michalesicz. We call our evolutionary algorithm BCB (bell curve based) since it is based upon two normal distributions.

Kincaid, Rex K.↗
DOE OSTI2026

Discrete versus continuous: Enhancing battery optimization in capacity expansion models

This study compares two battery modeling approaches for capacity expansion models: discrete-duration and continuous-duration formulations. In the discrete approach, battery duration is fixed, and power capacity is optimized. In the continuous approach, both power and energy capacities are decision variables, allowing storage duration to be optimized endogenously. Although both discrete-duration and continuous-duration battery formulations are used in long-term power system planning models, the literature has provided limited direct, systematic comparisons of their implications within a common modeling framework. To address this gap, this study implements both approaches in the Regional Energy Deployment System (ReEDS TM ) capacity expansion model using two resource adequacy methods, across a range of future system conditions, and with varying battery cost projections. Results show continuous-duration and high-resolution discrete approaches produce similar capacity expansion outcomes. The continuous formulation achieves faster runtimes compared to discrete-duration runs with many discrete-duration options. However, the discrete-duration approach allows users to choose to have limited fidelity for storage duration options, which in some cases can outperform the continuous formulation. The continuous formulation has the lowest overall system costs, indicating its ability to fine-tune storage duration to better meet specific system needs. This study's findings provide a side-by-side evaluation of discrete and continuous battery modeling approaches and offer guidance for improving the representation of real-world systems, flexibility, and computational efficiency for representing energy storage in long-term power system planning models.

25 ENERGY STORAGE↗
DOE OSTI2023

Fitting $\overline{ν}$ for Minor Pu Isotopes

After successful fitting of prompt ν for 235 U, 238 U, and 239 Pu(n,f) using CGMF, we have moved on to the minor plutonium isotopes. Minor isotopes pose a greater challenge both because there is less data available and we do not, by default, have parametrizations in CGMF already. Initially, we had planned to mitigate these challenges—and provide consistency within CGMF—by taking a stepped approach to the optimization. Continuing from the 239 Pu work, we would then fit 241Pu(n,f) $\overline{ν}$, where there is also a number of experimental measurements, keeping consistency between the parameters that are included in the calculation for 239 Pu and 241 Pu. With these parametrizations settled, we could consistently optimize 240 Pu(n,f) $\overline{ν}$. Following that step, we would move on to 242 Pu(n,f) (and increasing neutron number) and 238 Pu(n,f) (and decreasing neutron number). By including the fissioning systems in this manner, we should be able to minimize the unknown parameters in CGMF. We were also able to develop systematics for the CGMF input parameters along the Pu isotopic chain. However, after studies in the beginning of FY23, where we found reasonable agreement between CGMF and experimental prompt neutron multiplicities for 238−242 Pu, using a compound mass dependent parametrization from, and from discussions with I. Stetcu and P. Talou, we instead performed the evaluation of all five isotopes simultaneously. For all parameters in CGMF, they are either the same for each compound nucleus, or have a dependence on the compound mass. The details of these updates are given in. This report builds upon those details. In this short report, we first give an example of how we have updated CGMF to include 240 Pu(n,f) and 242 Pu(n,f), keeping consistency with the current 239 Pu and 241 Pu calculations, but without rigorous optimization (Sec. 2). Then, we will show in Section 3 what experimental data exist for the various isotopes to provide some insight into why 241 Pu and 239 Pu are used as anchor points. The evaluation is detailed in Section 4, and the comparison between CGMF calculations using the evaluated parameters and other prompt observables besides average neutron multiplicity are discussed in Section 2.2. Finally, we present conclusions and future work in Section 5.

07 ISOTOPE AND RADIATION SOURCES↗
NASA NTRS2013

Mixed Integer Programming and Heuristic Scheduling for Space Communication

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

Lee, Charles H.↗