Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithms 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 1,513 records · Page 84

Turbopump Performance Improved by Evolutionary Algorithms

The development of design optimization technology for turbomachinery has been initiated using the multiobjective evolutionary algorithm under NASA's Intelligent Synthesis Environment and Revolutionary Aeropropulsion Concepts programs. As an alternative to the traditional gradient-based methods, evolutionary algorithms (EA's) are emergent design-optimization algorithms modeled after the mechanisms found in natural evolution. EA's search from multiple points, instead of moving from a single point. In addition, they require no derivatives or gradients of the objective function, leading to robustness and simplicity in coupling any evaluation codes. Parallel efficiency also becomes very high by using a simple master-slave concept for function evaluations, since such evaluations often consume the most CPU time, such as computational fluid dynamics. Application of EA's to multiobjective design problems is also straightforward because EA's maintain a population of design candidates in parallel. Because of these advantages, EA's are a unique and attractive approach to real-world design optimization problems.

Oyama, Akira↗

Exploring temporal community evolution: algorithmic approaches and parallel optimization for dynamic community detection

Abstract Dynamic (temporal) graphs are a convenient mathematical abstraction for many practical complex systems including social contacts, business transactions, and computer communications. Community discovery is an extensively used graph analysis kernel with rich literature for static graphs. However, community discovery in a dynamic setting is challenging for two specific reasons. Firstly, the notion of temporal community lacks a widely accepted formalization, and only limited work exists on understanding how communities emerge over time. Secondly, the added temporal dimension along with the sheer size of modern graph data necessitates new scalable algorithms. In this paper, we investigate how communities evolve over time based on several graph metrics under a temporal formalization. We compare six different algorithmic approaches for dynamic community detection for their quality and runtime. We identify that a vertex-centric (local) optimization method works as efficiently as the classical modularity-based methods. To its advantage, such local computation allows for the efficient design of parallel algorithms without incurring a significant parallel overhead. Based on this insight, we design a shared-memory parallel algorithm DyComPar , which demonstrates between 4 and 18 fold speed-up on a multi-core machine with 20 threads, for several real-world and synthetic graphs from different domains.

97 MATHEMATICS AND COMPUTING↗

Comparison of Multisine Peak Factor Minimization Algorithms for Aircraft System Identification

Two phase-optimized multisine peak factor minimization algorithms are presented and evaluated. The first algorithm minimizes peak factor by iteratively clipping the peaks of generated multisine signals. The second algorithm optimizes peak factor indirectly through minimization of an approximation of the infinity norm of the multisine. Algorithm performance was evaluated as a function of different signal properties, including the number of harmonics, harmonic spacing, and number of snow harmonics (extra harmonics included for further reduction of the peak factor). The two algorithms are compared against results obtained by minimizing peak factor directly using a simplex algorithm, which has been a common approach when designing phase-optimized multisines for system identification flight tests. Sample results show that the clipping and infinity norm algorithms produced multisine signals with comparable peak factors that were lower than that of the simplex algorithm. However, the clipping algorithm runs an order of magnitude faster than the other two algorithms, which also makes it practical to repeat the algorithm multiple times to achieve even lower peak factors.

system identification↗

Transform methods for precision continuum and control models of flexible space structures

An open loop optimal control algorithm is developed for general flexible structures, based on Laplace transform methods. A distributed parameter model of the structure is first presented, followed by a derivation of the optimal control algorithm. The control inputs are expressed in terms of their Fourier series expansions, so that a numerical solution can be easily obtained. The algorithm deals directly with the transcendental transfer functions from control inputs to outputs of interest, and structural deformation penalties, as well as penalties on control effort, are included in the formulation. The algorithm is applied to several structures of increasing complexity to show its generality.

Lupi, Victor D.↗

A new algorithm for general multiobjective optimization

Described is a new technique for converting a constrained optimization problem to an unconstrained one, and a new method for multiobjective optimization based on that technique. The technique transforms the objective functions into goal constraints. The goal constraints are appended to the set of behavior constraints and the envelope of all functions in the set is searched for an unconstrained minimum. The technique may be categorized as a SUMT algorithm. In multiobjective applications, the approach has the advantage of locating a compromise minimum without the need to optimize for each individual objective function separately. The constrained to unconstrained conversion is described, followed by a description of the multiobjective problem. Two example problems are presented to demonstrate the robustness of the method.

Sobieszczanski-Sobieski, Jaroslaw↗

A new algorithm for general multiobjective optimization

The paper describes a new technique for converting a constrained optimization problem to an unconstrained one, and a new method for multiobjective optimization based on that technique. The technique transforms the objective functions into goal constraints. The goal constraints are appended to the set of behavior constraints, and the envelope of all functions in the set is searched for an unconstrained minimum. The technique can be categorized as a SUMT algorithm. In multiobjective applications, the approach has the advantage of locating a compromise minimum without the need to optimize for each individual objective function separately. The constrained to unconstrained conversion is described, followed by a description of the multiobjective problem. Two example problems are presented to demonstrate the robustness of the method.

Sobieszczanski-Sobieski, Jaroslaw↗

Algorithm and Software for Calculating Optimal Regimes of the Process Water Supply System at the Kalininskaya NPP{sup 1}

An algorithm and software for calculating the optimal operating regimes of the process water supply system at the Kalininskaya NPP are described. The parameters of the optimal regimes are determined for time varying meteorological conditions and condensation loads of the NPP. The optimal flow of the cooling water in the turbines is determined computationally; a regime map with the data on the optimal water consumption distribution between the coolers and displaying the regimes with an admissible heat load on the natural cooling lakes is composed. Optimizing the cooling system for a 4000-MW NPP will make it possible to conserve at least 155,000 MW · h of electricity per year. The procedure developed can be used to optimize the process water supply systems of nuclear and thermal power plants.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Hardware-in-the-Loop Evaluation of an Advanced Distributed Energy Resource Management Algorithm

This paper presents the laboratory performance evaluation of voltage regulation under a new distributed energy resource management system (DERMS) algorithm via an advanced hardware-in-tbe-loop (HIL) platform. The HIL platform provides realistic testing in a laboratory environment, including the accurate modeling of a full-scale real-world distribution system from a utility partner, the DERMS software controller, and power hardware photovoltaic (PV) inverters. The new DERMS algorithm is developed based on online multiobjective optimization (OMOO) algorithms that perform fast dispatch of distributed solar PV simulated in a real-time digital simulator and real physical hardware devices. Experimental tests confirm the correct functioning of the HIL platform for evaluating controller algorithms and satisfactory voltage regulation performance of the developed OMOO algorithms.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Hardware-in-the-Loop Evaluation of an Advanced Distributed Energy Resource Management Algorithm: Preprint

This paper presents the laboratory performance evaluation of voltage regulation under a new distributed energy resource management system (DERMS) algorithm via an advanced hardware-in-tbe-loop (HIL) platform. The HIL platform provides realistic testing in a laboratory environment, including the accurate modeling of a full-scale real-world distribution system from a utility partner, the DERMS software controller, and power hardware photovoltaic (PV) inverters. The new DERMS algorithm is developed based on online multiobjective optimization (OMOO) algorithms that perform fast dispatch of distributed solar PV simulated in a real-time digital simulator and real physical hardware devices. Experimental tests confirm the correct functioning of the HIL platform for evaluating controller algorithms and satisfactory voltage regulation performance of the developed OMOO algorithms.

41 EE - Solar Energy Technologies Office (EE-4S)↗

A New Eclipse Algorithm for use in Spacecraft Trajectory Optimization

This paper presents a new eclipse algorithm, which determines if a spacecraft is in sunlight or shadow, that is simple to define, fast to compute, smooth and continuous in all regions external to the eclipsing body, and suitable for use in a spacecraft trajectory optimization problem. Details of the design evolution are presented, including the specifics of the algorithm's implementation in the trajectory design of NASA's Artemis I mission to a lunar DRO. Some alternate uses and discussion of future work is also presented.

Orion↗

Piloted simulation of an algorithm for onboard control of time-optimal intercept

A piloted simulation of algorithms for onboard computation of trajectories for time-optimal intercept of a moving target by an F-8 aircraft is described. The algorithms, use singular perturbation techniques, generate commands in the cockpit. By centering the horizontal and vertical needles, the pilot flies an approximation to a time-optimal intercept trajectory. Example simulations are shown and statistical data on the pilot's performance when presented with different display and computation modes are described.

Price, D. B.↗

An Optimal Estimation Aerosol Retrieval Algorithm for Lidar-only and Combined Lidar Polarimeter Remote Sensors

Global measurements of aerosol vertical profile, composition, concentration, and size distribution are very important due to aerosol impacts on air quality, climate, clouds, and ocean ecosystems. We have developed a lidar-only and combined lidar and polarimeter algorithm to retrieve vertically-resolved profiles of aerosol microphysical properties. The new retrieval system is modular in design. It consists of three modules, a vertically-resolved aerosol profile retrieval module for lidar data, an aerosol and cloud/ocean retrieval module for polarimeter data, and a combined retrieval module for both lidar and polarimeter measurements. In addition to performing optimal estimation retrievals on various data sources, we have designed the system so that it can be used to carry out aerosol retrieval performance trade studies for various lidar and polarimeter configurations. For example, the retrieval system can take inputs from attenuated backscatter lidar at two wavelengths (e.g. CALIPSO like instrument), aerosol backscattering measured at two wavelengths and and aerosol extinction measured at one wavelength (HSRL-1), or aerosol backscattering measured at three wavelengths and aerosol extinction measured at two wavelengths (HSRL-1) (HSRL-2). We have applied the lidar-only algorithm to both simulated data and various field campaign data (DISCOVER-AQ, CHARMS, TCAP, and ORACLES). For polarimeter-only modules, we have done the same for SABOR, TCAP, NAAMES, and ORACLES data. We have applied the combined retrieval algorithm to ORACLES data. The simulated retrieval studies show that the combined lidar+polarimeter retrieval provides much higher information content relative to their individual counterparts for retrieving effective radius, particle concentrations, and absorption properties.

Xu Liu↗

A Decision-Theoretic Approach to Autonomous Planetary Rover Control

The report discusses the: Decentralized Control of Markov Decision Processes. Study the complexity of decentralized control of Markov decision processes, and develop algorithms for finding optimal control policies. Scheduling Contract Algorithms. Develop an optimal method for scheduling runs of a contract anytime algorithm (one that takes the deadline as input) in situations where the deadline is unknown, multiple problem instances must be solved, and a multi-processor machine is available. Planetary Rover Control as a Markov Decision Process.Use the Markov decision process framework to formalize and solve problems in planetary rover control. Adaptive Peer Selection. Use reinforcement learning to maximize the expected down-load speed for a client in a peer-to-peer file sharing system.

Zilberstein, Shlomo↗

Aerodynamic Shape Optimization Using A Real-Number-Encoded Genetic Algorithm

A new method for aerodynamic shape optimization using a genetic algorithm with real number encoding is presented. The algorithm is used to optimize three different problems, a simple hill climbing problem, a quasi-one-dimensional nozzle problem using an Euler equation solver and a three-dimensional transonic wing problem using a nonlinear potential solver. Results indicate that the genetic algorithm is easy to implement and extremely reliable, being relatively insensitive to design space noise.

Holst, Terry L.↗

Overview and Software Architecture of the Copernicus Trajectory Design and Optimization System

The Copernicus Trajectory Design and Optimization System represents an innovative and comprehensive approach to on-orbit mission design, trajectory analysis and optimization. Copernicus integrates state of the art algorithms in optimization, interactive visualization, spacecraft state propagation, and data input-output interfaces, allowing the analyst to design spacecraft missions to all possible Solar System destinations. All of these features are incorporated within a single architecture that can be used interactively via a comprehensive GUI interface, or passively via external interfaces that execute batch processes. This paper describes the Copernicus software architecture together with the challenges associated with its implementation. Additionally, future development and planned new capabilities are discussed. Key words: Copernicus, Spacecraft Trajectory Optimization Software.

Williams, Jacob↗