Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal algorithms”

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 865 records · Page 48

Spot-Scanning Proton Arc (SPArc) Therapy: The First Robust and Delivery-Efficient Spot-Scanning Proton Arc Therapy

Purpose: To present a novel robust and delivery-efficient spot-scanning proton arc (SPArc) therapy technique. Methods and Materials: A SPArc optimization algorithm was developed that integrates control point resampling, energy layer redistribution, energy layer filtration, and energy layer resampling. The feasibility of such a technique was evaluated using sample patients: 1 patient with locally advanced head and neck oropharyngeal cancer with bilateral lymph node coverage, and 1 with a nonmobile lung cancer. Plan quality, robustness, and total estimated delivery time were compared with the robust optimized multifield step-and-shoot arc plan without SPArc optimization (Arc{sub multi-field}) and the standard robust optimized intensity modulated proton therapy (IMPT) plan. Dose-volume histograms of target and organs at risk were analyzed, taking into account the setup and range uncertainties. Total delivery time was calculated on the basis of a 360° gantry room with 1 revolutions per minute gantry rotation speed, 2-millisecond spot switching time, 1-nA beam current, 0.01 minimum spot monitor unit, and energy layer switching time of 0.5 to 4 seconds. Results: The SPArc plan showed potential dosimetric advantages for both clinical sample cases. Compared with IMPT, SPArc delivered 8% and 14% less integral dose for oropharyngeal and lung cancer cases, respectively. Furthermore, evaluating the lung cancer plan compared with IMPT, it was evident that the maximum skin dose, the mean lung dose, and the maximum dose to ribs were reduced by 60%, 15%, and 35%, respectively, whereas the conformity index was improved from 7.6 (IMPT) to 4.0 (SPArc). The total treatment delivery time for lung and oropharyngeal cancer patients was reduced by 55% to 60% and 56% to 67%, respectively, when compared with Arc{sub multi-field} plans. Conclusion: The SPArc plan is the first robust and delivery-efficient proton spot-scanning arc therapy technique, which could potentially be implemented into routine clinical practice.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Expert systems and their use in augmenting design optimization

The challenging requirements that are evolving for future aircraft demand that each design be optimally integrated, for the penalties imposed by nonoptimal performance are significant. Classic numerical optimization algorithms have been and will continue to be important tools for aircraft designers. These methods are, however, limited to certain categories of aircraft design variables, leaving the remainder to be determined by the user. A method that makes use of knowledge-based expert systems offers the potential for aiding the conceptual design process in a way that is similar to that of numerical optimization, except that it would address discrete, discontinuous, abstract, or any other unoptimized aspect of vehicle design and integration. Other unique capabilities such as automatic discovery and learning in design may also be achievable in the near term. This paper discusses current practice in conceptual aircraft design and knowledge-based systems, and how knowledge-based systems can be used in conceptual design.

Kidwell, G. H.↗

On Estimating the Phase of Periodic Waveform in Additive Gaussian Noise, Part 2

Motivated by advances in signal processing technology that support more complex algorithms, a new look is taken at the problem of estimating the phase and other parameters of a periodic waveform in additive Gaussian noise. The general problem was introduced and the maximum a posteriori probability criterion with signal space interpretation was used to obtain the structures of optimum and some suboptimum phase estimators for known constant frequency and unknown constant phase with an a priori distribution. Optimal algorithms are obtained for some cases where the frequency is a parameterized function of time with the unknown parameters and phase having a joint a priori distribution. In the last section, the intrinsic and extrinsic geometry of hypersurfaces is introduced to provide insight to the estimation problem for the small noise and large noise cases.

Rauch, L. L.↗

GET-Solar (Generation forecasting and parameter Estimation Tool for Solar) [SWR-20-115]

GET-Solar (Generation forecasting and parameter Estimation Tool for Solar) can be used to estimate behind the meter (BTM) solar generation from limited datasets. Using distributed sets of diverse solar sites, but with close spatial proximity, and/or limited historical PV generation information can be used to generate of solar profiles. This is useful for applications where partial solar generation data is available, and on-site irradiance data is not available. GET-Solar calculates PV technical data parameters and calculates output by modeling shading and cloud cover impacts. Clear sky irradiance profiles are used to calculate base generation profiles on which the local shading and cloud cover layers are added. In order to arrive at clear sky generation data, PV mounting information like panel tilt and and angle is needed. For cases where PV mounting information is missing, panel tilt and azimuth angle can be estimated using a non-linear optimization algorithm. GET-Solar can also be used for forecasting applications where historical PV data is available to estimate local shading at various solar positions. This overall framework can be used for estimation of solar parameters, and assisting in analyzing and modeling diverse sets of DER where solar generation is also present in utility meter data. GET-Solar has been developed in Python and uses the Pyomo optimization language.

Abraham, Sherin Ann↗

Analytical formulation of optimum rotor interdisciplinary design with a three-dimensional wake

An analytical formulation of optimum rotor interdisciplinary design is presented. A finite-state aeroelastic rotor model, coupling generalized dynamic wake with blade finite elements, is applied to perform the optimum rotor blade design for improved aerodynamic performance and vehicle vibration, while a feasible direction nonlinear optimizer, CONMIN, provides the optimization algorithm. The approach features a systematic rotor aeroelastic model which offers an efficient analytical tool, and retains necessary aerodynamic and blade dynamic building blocks for a sufficient rotor dynamic response analysis. The formulation is well suited for an efficient design sensitivity computation without resorting to finite difference, and thus provides a practical design tool. The results show improved rotor aerodynamic performance and reduced hub vibratory loads for the optimized blade as compared to the advanced rotor of reference design.

He, Chengjian↗

Automation of the ICME Workflow Incorporating Material Digital Twins at Different Length Scales Within a Robust Information Management System

Recent successes in Integrated Computational Materials Engineering (ICME) have demonstrated the potential in designing ‘fit-for-purpose’ materials for a given application in a cost and time efficient manner. However, the material design process must contain a level of judicious automation in the material decision process; that is implementing some optimization algorithms to truly enable the benefits of ICME, particularly when considering materials at multiple length and time scales. Furthermore, the ability to effectively store developed material models, experimental data used for validation, and link models at multiple length and time scales must be implemented to ensure traceability across the material design process, such that the data gathered can be leveraged towards efficient material design. To enable such an optimization scheme a robust framework must exist: (1) that can capture changes made at a given length scale, (2) automatically propagate changes upstream to the highest scale, and (3) evaluate the material’s performance at the structural level. In this work, a developed framework for tracking material changes, automatically running the necessary simulations to determine the properties at the next highest scale, and saving each iteration of the design process to maintain the application’s digital thread is presented for polymer matrix composites (PMCs). The Automated Information Management Across Organizations and Scales (AIMAOS) program offers users an interactive graphical user interface (GUI) for defining constituent materials, building lamina and laminates, and applying effective laminate properties to finite element and composite optimization third party software. At each length scale, the necessary input files are automatically written, and subsequent analysis tools are called to solve for effective properties at the next scale, which are then read by the AIMAOS tool and displayed to the user. As changes are made to the material at lower length scales, information is automatically propagated upstream to higher length scales, and changes made are automatically tracked and versioned to maintain traceability during the design process. The AIMAOS tools serves as the first step in enabling optimized design of composites from the nano to the macroscale for a given application.

Brandon L Hearley↗

Extreme-Scale Algorithms & Software Resilience (EASIR) Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures

This project addresses both communication-avoiding algorithms, and reproducible floating-point computation. Communication, i.e. moving data, either between levels of memory or processors over a network, is much more expensive per operation than arithmetic (measured in time or energy), so we seek algorithms that greatly reduce communication. We developed many new algorithms for both dense and sparse, and both direct and iterative linear algebra, attaining new communication lower bounds, and getting large speedups in many cases. We also extended this work in several ways: (1) We minimize writes separately from reads, since writes may be much more expensive than reads on emerging memory technologies, like Flash, sometimes doing asymptotically fewer writes than reads. (2) We extend the lower bounds and optimal algorithms to arbitrary algorithms that may be expressed as perfectly nested loops accessing arrays, where the array subscripts may be arbitrary affine functions of the loop indices (eg A(i), B(i,j+k, k+3*m-7, …) etc.). (3) We extend our communication-avoiding approach to some machine learning algorithms, such as support vector machines. This work has won a number of awards. We also address reproducible floating-point computation. We define reproducibility to mean getting bitwise identical results from multiple runs of the same program, perhaps with different hardware resources or other changes that should ideally not change the answer. Many users depend on reproducibility for debugging or correctness. However, dynamic scheduling of parallel computing resources, combined with nonassociativity of floating point addition, makes attaining reproducibility a challenge even for simple operations like summing a vector of numbers, or more complicated operations like the Basic Linear Algebra Subprograms (BLAS). We describe an algorithm that computes a reproducible sum of floating point numbers, independent of the order of summation. The algorithm depends only on a subset of the IEEE Floating Point Standard 754-2008, uses just 6 words to represent a “reproducible accumulator,” and requires just one read-only pass over the data, or one reduction in parallel. New instructions based on this work are being considered for inclusion in the future IEEE 754-2018 floating-point standard, and new reproducible BLAS are being considered for the next version of the BLAS standard.

97 MATHEMATICS AND COMPUTING↗

Link Design and Planning for Mars Reconnaissance Orbiter (MRO) Ka-band (32 GHz) Telecom Demonstration

NASA is planning an engineering telemetry demonstration with Mars Reconnaissance Orbiter (MRO). Capabilities of Ka-band (32 GHz) for use with deep space mission are demonstrated using the link optimization algorithms and weather forecasting. Furthermore, based on the performance of previous deep space missions with Ka-band downlink capabilities, experiment plans are developed for telemetry operations during superior solar conjunction. A general overview of the demonstration is given followed by a description of the mission planning during cruise, the primary science mission and superior conjunction. As part of the primary science mission planning the expected data return for various data optimization methods is calculated. These results indicate that, given MRO's data rates, a link optimized to use of at most two data rates, subject to a minimum availability of 90%, performs almost as well as a link with no limits on the number of data rates subject to the same minimum availability.

Ka-band↗

Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In the case of convex polygon in E{sup 2} a simple Point-in-Polygon test is of the O(N) complexity and the optimal algorithm is of O(log N) computational complexity. In the E{sup 3} case, the complexity is O(N) even for the convex polyhedron as no ordering is defined. New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to O(1) run-time complexity. The presented approach is simple to implement. Due to the principle of duality, dual problems, e.g. line-convex polygon, line clipping, can be solved in a similarly.

97 MATHEMATICS AND COMPUTING↗

New method to design stellarator coils without the winding surface

Finding an easy-to-build coils set has been a critical issue for stellarator design for decades. Conventional approaches assume a toroidal 'winding' surface, but a poorly chosen winding surface can unnecessarily constrain the coil optimization algorithm, This article presents a new method to design coils for stellarators. Each discrete coil is represented as an arbitrary, closed, one-dimensional curve embedded in three-dimensional space. A target function to be minimized that includes both physical requirements and engineering constraints is constructed. The derivatives of the target function with respect to the parameters describing the coil geometries and currents are calculated analytically. A numerical code, named flexible optimized coils using space curves (FOCUS), has been developed. Furthermore, applications to a simple stellarator configuration, W7-X and LHD vacuum fields are presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Resilient Operation of Networked Community Microgrids with High Solar Penetration

This project, funded by the US Department of Energy’s Solar Energy Technologies Office (SETO), focused on the operation of microgrids as a coordinated network. The primary objective, which was successfully achieved, was to develop both control strategies and hardware solutions to support the resilient and efficient operation of networked microgrids with high solar penetration. The work was structured around the following four main tasks: • Development of distributed and scalable optimization algorithms for AC-coupled networked microgrids. • Design and implementation of a novel DC interconnection hardware to enable precise power exchange between microgrids. • Laboratory operational validation of the developed technologies using 480 V testbeds and commercially available hardware. • Field operational validation of the complete solution in Adjuntas, Puerto Rico, interconnecting two kW-scale, split-phase microgrids of Casa Pueblo’s microgrids. This project addressed multiple technical challenges across the domains of optimization, control, hardware interconnection, and protection. One of its key contributions was delivering tangible, real-world solutions for networking microgrids. In contrast to purely theoretical or simulation-based work, this project included full-scale hardware operational validation both in the lab and in the field. The work conducted as part of this project—in collaboration with the University of Puerto Rico; the University of Tennessee, Knoxville; the University of Central Florida; and Casa Pueblo—has advanced the state of the art in networked microgrids. Key contributions include the development of distributed control strategies, practical solutions for real-world implementation challenges, and the introduction of a novel DC interlink approach for microgrid interconnection. The project featured both laboratory and field validation using commercial off-the-shelf components. The field deployment successfully validated that a group of microgrids can operate in a coordinated manner, enabling precise power flow between systems and mutual support during extreme events. This project resulted in 15 journal publications and 15 conference papers; 5 graduate students and 15 undergraduate students were supported. The codes of distributed optimization and forecasting were made open-source through OSTI.gov for distributed optimization and forecasting. All the publications are available in the ORNL-hosted project landing page. The DC interlink with state-of-charge balancing control was operationally validated in Adjuntas by interconnecting two real-world, 240 V split-phase microgrids. To the best knowledge of the team, this represents the first operational validation of AC microgrids interconnected via DC-interlinks. As a culmination of this project, a follow-on grant was awarded to support the technology transfer of the distributed optimization framework to a commercial microgrid controller, Stellar Edge, developed by the California-based company New Sun Road.

14 SOLAR ENERGY↗

High-dimensional Data-driven Energy optimization for Multi-Modal Transit Agencies (HD-EMMA) (Final Technical Report)

Public bus transit services in the U.S. are responsible for at least 19.7 million metric tons of CO 2 emission annually. Electric vehicles (EVs) can have a much lower environmental impact than comparable internal combustion engine vehicles (ICEVs), especially in urban areas. Unfortunately, EVs are also much more expensive than ICEVs. As a result, many public transit agencies can afford only mixed fleets of transit vehicles, consisting of EVs, hybrids (HEVs), and ICEVs. Transit agencies that operate such mixed fleets of vehicles face a challenging optimization problem: these agencies need to decide which vehicles are assigned to serving which transit trips. Since the advantage of EVs over ICEVs varies depending on the route and time of day (e.g., the benefit of EVs is higher in slower traffic with frequent stops and lower on highways), the assignment can have a significant effect on energy use and, hence, environmental impact. Through this project, we have developed reference data about energy collections and constructed a set of machine learning models that can accurately predict the energy consumption for the whole fleet at the level of each trip. We have used these models to develop a scheduling and assignment strategy that can rotate the different vehicle types across the transit agencies’ routes. The optimization algorithm ensures that the vehicles are matched to trips considering weather patterns, expected congestion, and road gradients to minimize the overall energy usage. We list the key observations from our project for other practitioners below. Details are available in the report, and the list of source code and our publications are included in the appendix. 1. We have demonstrated the feasibility of collecting, merging and analyzing large volumes of high-resolution real-world telemetry data from a mixed vehicle fleet. To mitigate the inherent noise of the recorded GPS points, the team developed an algorithm that filters data and maps the points onto a street. The algorithm considers previous and subsequent location measurements and different characteristics of nearby streets to determine how likely the vehicle travels on them. Then, the team segmented the time series into disjoint contiguous samples based on adjacent road segments and repeated the outlier detection and removal. For each data point, the team added features corresponding to elevation changes within the samples, weather features, such as temperature, and traffic data, such as speed ratio between actual speed and free-flow speed. 2. We have developed two forms of machine learning models that be used to understand and analyze the energy operations of a mixed vehicle transit fleet. The micro prediction model provides estimates of instantaneous energy prediction for all types of buses (diesel, hybrid, and electric). Such a model is important in evaluating the energy impacts of real-time bus operation strategies, but it is challenging due to diversified driving cycles of transit buses. The model can help the drivers understand the impact of their driving behaviors and short-term congestions. The macro prediction models estimate average energy consumption across the whole trip considering the features: distance traveled, various road-type features, elevation change, day of the week, time of day, various weather features (temperature, humidity, etc.), and traffic features (speed ratio and jam factor). 3. We have demonstrated that it is possible to transfer the machine learning models we have developed in this project to other teams and cities by using inductive transfer learning. We also showed that the performance of the macro energy prediction models can be improved using a multi-task learning approach where the learning parameters are shared between the models being developed for different vehicle types. The advantage of this approach is improved learning performance as the models can exploit common spatio-temporal and environmental characteristics. 4. Finally, we have developed trip and vehicle assignment and scheduling algorithms that use the energy prediction models and develop a trip to vehicle type (diesel, electric, hybrid) assignment for the whole operation to reduce overall emissions and cost. We have shown through simulations that the proposed algorithms can save $\$$ 48,910 in energy costs and 175 metric tons of CO 2 emission annually for CARTA.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Numerically efficient algorithm for model development of high-order systems

A technique for estimating transfer functions in partial fraction expansion form from frequency response data for a high-order system is presented. The problem formulation avoids many of the numerical difficulties associated with high-order polynomials and has the advantage of having the option to fix the camping and frequency of a mode, if known, during the estimation process. The resulting transfer function(s) may be converted to Jordan-Form time domain equations directly. During the implementation of this technique, a frequency and amplitude normalizing window was developed that maximized the efficiency of the optimization algorithm. The combination of estimating the transfer function in factored form, the ability to fix preciously determined parameters and the effectiveness of the normalizing window led to a progressive approach to synthesizing transfer functions from frequency response data for high-order systems.

Parada, L. O.↗

Hybrid Simulation Framework

HYBRID is a modeling toolset to assess the economic viability of Nuclear-Renewable Integrated Energy Systems (N-R IES). The frameworks enabling this toolset are INL’s RAVEN, its CashFlow plugin and the Modelica language. The toolset includes sample RAVEN workflows performing economic assessments. These workflows consist of: generation of stochastic time series and application of probabilistic analysis and optimization algorithms (RAVEN); a library of Modelica models representing the physical behavior of N-R IES; and the CashFlow plugin mapping physical performance to economic performance. The toolset allows assembling existing and new models such as nuclear reactors, renewable energy sources, energy storage, gas turbines, industrial processes, etc. into an N-R IES. The toolset workflows evaluate the dynamics of the N-R IES responding to stochastic conditions (electricity demand, price, etc.) and optimize the dispatch economics as well as N-R IES capacity planning.

Epiney, Aaron↗

Cost-optimized energy storage operation for a grid-connected solar PV system at community and individual scales

This study provides a comparative analysis of grid-connected PV-integrated battery storage at individual and community scales. The paper addresses the challenge of managing energy demand-generation mismatch by using a battery energy storage optimization algorithm, which minimizes operational costs while accounting for battery degradation. Also, this work introduces a broader evaluation basis that includes seasonal variability, grid exchange smoothness, and scalability across different battery capacities. Results show that community-scale storage more effectively dampens grid exchange power fluctuations and reduces system costs, particularly with moderate price differences between electricity buying and selling prices and low battery capacities. The paper also analyzes the impacts of static control versus cost-optimized battery system management. Here, it is shown that the gap in system costs between the cost-optimized and static control scenarios widens as the price difference increases.

25 ENERGY STORAGE↗

Performance optimization for rotors in hover and axial flight

Performance optimization for rotors in hover and axial flight is a topic of continuing importance to rotorcraft designers. The aim of this Phase 1 effort has been to demonstrate that a linear optimization algorithm could be coupled to an existing influence coefficient hover performance code. This code, dubbed EHPIC (Evaluation of Hover Performance using Influence Coefficients), uses a quasi-linear wake relaxation to solve for the rotor performance. The coupling was accomplished by expanding of the matrix of linearized influence coefficients in EHPIC to accommodate design variables and deriving new coefficients for linearized equations governing perturbations in power and thrust. These coefficients formed the input to a linear optimization analysis, which used the flow tangency conditions on the blade and in the wake to impose equality constraints on the expanded system of equations; user-specified inequality contraints were also employed to bound the changes in the design. It was found that this locally linearized analysis could be invoked to predict a design change that would produce a reduction in the power required by the rotor at constant thrust. Thus, an efficient search for improved versions of the baseline design can be carried out while retaining the accuracy inherent in a free wake/lifting surface performance analysis.

Quackenbush, T. R.↗

Optimization of rotor performance in hover and axial flight using a free wake analysis

Performance optimization for rotors in hover and axial flight is a topic of continuing importance to rotorcraft designers. The aim of this effort was to demonstrate that a numerical performance optimization algorithm could be coupled to an existing free wake hover code. This code, dubbed EHPIC (Evaluation of Hover Performacne using Influence Coefficients), uses a quasi-linear wake relaxation to solve for the rotor performance. The coupling was accomplished by expanding of the matrix of linearized influence coefficients in EHPIC to accommodate design variables and by deriving new coefficients for linearized equations governing perturbations in power and thrust. These coefficients formed the input to a linear optimization analysis, which used the flow tangency conditions on the blade and in the wake to impose equality constraints on the expanded system of equations; user-specified inequality constraints were also employed to bound the changes in the design. It was found that this locally linearized analysis could be invoked to predict a design change that would produce a reduction in the power required by the rotor at constant thrust. Thus, an efficient search for improved versions of the baseline design can be carried out while retaining the accuracy inherent in a free wake/lifting surface performance analysis. A variety of sample problems were undertaken to demonstrate the success of this approach in reducing the power required at a specified thrust for several representative rotor configurations in hover and axial flight.

Quackenbush, T. R.↗

Optimal flight trajectories in the presence of windshear, 1984-86

Optimal flight trajectories were determined in the presence of windshear and guidance schemes were developed for near optimum flight in a windshear. This is a wind characterized by sharp change in intensity and direction over a relatively small region of space. This problem is important in the takeoff and landing of both civilian airplanes and military airplanes and is key to aircraft saftey. The topics covered in reference to takeoff problems are: equations of motion, problem formulation, algorithms, optimal flight trajectories, advanced guidance schemes, simplified guidance schemes, and piloting strategies.

Miele, A.↗