Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete 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 775 records · Page 43

Use of multiple discrete wall jets for delaying boundary layer separation

The effectiveness of a spanwise array of small discrete blowing nozzles in preventing separation of a turbulent boundary layer was investigated experimentally. The spacing, axial location, and momentum flux of the nozzles were varied in a systematic way, and overall performance was measured for each combination. Extensive mean velocity profiles were measured for one selected combination. Overall diffusion achieved before separation was correlated successfully with a momentum flux excess parameter, and in terms of this parameter discrete nozzles, when advantageously placed, were found to perform somewhat better than an optimally placed two-dimensional jet slot.

Mclean, J. D.↗

Dual methods and approximation concepts in structural synthesis

Approximation concepts and dual method algorithms are combined to create a method for minimum weight design of structural systems. Approximation concepts convert the basic mathematical programming statement of the structural synthesis problem into a sequence of explicit primal problems of separable form. These problems are solved by constructing explicit dual functions, which are maximized subject to nonnegativity constraints on the dual variables. It is shown that the joining together of approximation concepts and dual methods can be viewed as a generalized optimality criteria approach. The dual method is successfully extended to deal with pure discrete and mixed continuous-discrete design variable problems. The power of the method presented is illustrated with numerical results for example problems, including a metallic swept wing and a thin delta wing with fiber composite skins.

Fleury, C.↗

Control-System Design Program

Control-theory design package, Optimal Regulator Algorithms for Control of Linear Systems (ORACLS), developed to aid in design of controllers and optimal filters for systems modeled by linear, time-invariant differential and difference equations. Optimal linear quadratic regulator theory, Linear-Quadratic-Gaussian (LQG) problem, most widely accepted method of determining optimal control policy. Provides for solution to time-in-variant continuous or discrete LQG problems. Attractive to control-system designer providing rigorous tool for dealing with multi-input and multi-output dynamic systems in continuous and discrete form. CDO version written in FORTRAN IV. VAX version written in FORTRAN 77.

Frisch, Harold P.↗

Flutter suppression control law synthesis for the Active Flexible Wing model

The Active Flexible Wing Project is a collaborative effort between the NASA Langley Research Center and Rockwell International. The objectives are the validation of methodologies associated with mathematical modeling, flutter suppression control law development and digital implementation of the control system for application to flexible aircraft. A flutter suppression control law synthesis for this project is described. The state-space mathematical model used for the synthesis included ten flexible modes, four control surface modes and rational function approximation of the doublet-lattice unsteady aerodynamics. The design steps involved developing the full-order optimal control laws, reducing the order of the control law, and optimizing the reduced-order control law in both the continuous and the discrete domains to minimize stochastic response. System robustness was improved using singular value constraints. An 8th order robust control law was designed to increase the symmetric flutter dynamic pressure by 100 percent. Preliminary results are provided and experiences gained are discussed.

Mukhopadhyay, Vivek↗

Flutter suppression control law synthesis for the active flexible wing model

The Active Flexible Wing Project is a collaborative effort between the NASA Langley Research Center and Rockwell International. The objectives are the validation of methodologies associated with mathematical modeling, flutter suppression control law development and digital implementation of the control system for application to flexible aircraft. A flutter suppression control law synthesis for this project is described. The state-space mathematical model used for the synthesis included ten flexible modes, four control surface modes and rational function approximation of the doublet-lattice unsteady aerodynamics. The design steps involved developing the full-order optimal control laws, reducing the order of the control law, and optimizing the reduced-order control law in both the continuous and the discrete domains to minimize stochastic response. System robustness was improved using singular value constraints. An 8th order robust control law was designed to increase the symmetric flutter dynamic pressure by 100 percent. Preliminary results are provided and experiences gained are discussed.

Mukhopadhyay, Vivek↗

Sensor/actuator placement for flexible space structures

A new approach for the placement of sensors and actuators in the active control of flexible space structures is developed. The approach converts the discrete nature of the sensor and actuator positioning problem to a nonlinear programming optimization through approximation of the control forces and output measurements by spatially continuous functions. The locations of the sensors and actuators are optimized in order to move the transmission zeros of the system farther to the left of the imaginary axis. The criterion for sensor/actuator placement can be quite useful for optimal regulation and tracking problems, as well as for low-authority controller designs. Two performance metrics are considered for the optimization and are applied to the sensor/actuator positioning of a large-order flexible space structure.

Maghami, P. G.↗

Advanced technology for a satellite multichannel demultiplexer/demodulator

Satellite on-board processing is needed to efficiently service multiple users while at the same time minimizing earth station complexity. The processing satellite receives a wideband uplink at 30 GHz and down-converts it to a suitable intermediate frequency. A multichannel demultiplexer then separates the composite signal into discrete channels. Each channel is then demodulated by bulk demodulators, with the baseband signals routed to the downlink processor for retransmission to the receiving earth stations. This type of processing circumvents many of the difficulties associated with traditional bent-pipe repeater satellites. Uplink signal distortion and interference are not retransmitted on the downlink. Downlink power can be allocated in accordance with user needs, independent of uplink transmissions. This allows the uplink users to employ different data rates as well as different modulation and coding schemes. In addition, all downlink users have a common frequency standard and symbol clock on the satellite, which is useful for network synchronization in time division multiple access schemes. The purpose of this program is to demonstrate the concept of an optically implemented multichannel demultiplexer (MCD). A proof-of-concept (POC) model has been developed which has the ability to receive a 40 MHz wide composite signal consisting of up to 1000 40 kHz QPSK modulated channels and perform the demultiplexing process. In addition a set of special test equipment (STE) has been configured to evaluate the performance of the POC model. The optical MCD is realized as an acousto-optic spectrum analyzer utilizing the capability of Bragg cells to perform the required channelization. These Bragg cells receive an optical input from a laser source and an RF input (the signal). The Bragg interaction causes optical output diffractions at angles proportional to the RF input frequency. These discrete diffractions are optically detected and output to individual demodulators for baseband conversion. Optimization of the MCD design was conducted in order to achieve a compromise between two opposing sources of signal degradation: adjacent channel interference and intersymbol interference. The system was also optimized to allow simple, inexpensive ground stations communications with the MCD. These design goals led to the realization of a POC MCD which demonstrates the demultiplexing function with minimal signal degradation. Performance evaluation results using the STE equipment indicate that the dynamic range of the demultiplexer in the presence of adjacent and multiple channel loading is 40 - 50 dB. Measured bit error rate (BER) probabilities varied from the predicted theoretical results by one dB or less. The performance of the proof-of-concept model indicate that the development of a space qualified optically implemented MCD are feasible. The advantages to such an implementation include reduced size, weight and power and increased reliability when compared with electronic approaches. All of these factors are critical to on-board satellite processors. Further optimization can be conducted which trade ground station complexity and MCD performance to achieve desired system results.

Abramovitz, Irwin J.↗

Optimal realizable filters and the minimum Euclidean distance principle

Minimizing a Euclidean distance in the complex plane optimizes a wide class of correlation metrics for filters implemented on realistic devices. The algorithm searches over no more than two real scalars (gain and phase). It unifies a variety of previous solutions for special cases (e.g., a maximum signal-to-noise ratio with colored noise and a real filter and a maximum correlation intensity with no noise and a coupled filter). It extends optimal partial information filter theory to arbitrary spatial light modulators (fully complex, coupled, discrete, finite contrast ratio, and so forth), additive input noise (white or colored), spatially nonuniform filter modulators, and additive correlation detection noise (including signal dependent noise).

Juday, Richard D.↗

Domain decomposition for aerodynamic and aeroacoustic analyses, and optimization

The overarching theme was the domain decomposition, which intended to improve the numerical solution technique for the partial differential equations at hand; in the present study, those that governed either the fluid flow, or the aeroacoustic wave propagation, or the sensitivity analysis for a gradient-based optimization. The role of the domain decomposition extended beyond the original impetus of discretizing geometrical complex regions or writing modular software for distributed-hardware computers. It induced function-space decompositions and operator decompositions that offered the valuable property of near independence of operator evaluation tasks. The objectives have gravitated about the extensions and implementations of either the previously developed or concurrently being developed methodologies: (1) aerodynamic sensitivity analysis with domain decomposition (SADD); (2) computational aeroacoustics of cavities; and (3) dynamic, multibody computational fluid dynamics using unstructured meshes.

Baysal, Oktay↗

A Queue Simulation Tool for a High Performance Scientific Computing Center

The NASA Center for Computational Sciences (NCCS) at the Goddard Space Flight Center provides high performance highly parallel processors, mass storage, and supporting infrastructure to a community of computational Earth and space scientists. Long running (days) and highly parallel (hundreds of CPUs) jobs are common in the workload. NCCS management structures batch queues and allocates resources to optimize system use and prioritize workloads. NCCS technical staff use a locally developed discrete event simulation tool to model the impacts of evolving workloads, potential system upgrades, alternative queue structures and resource allocation policies.

Spear, Carrie↗

Electric Propulsion System Selection Process for Interplanetary Missions

The disparate design problems of selecting an electric propulsion system, launch vehicle, and flight time all have a significant impact on the cost and robustness of a mission. The effects of these system choices combine into a single optimization of the total mission cost, where the design constraint is a required spacecraft neutral (non-electric propulsion) mass. Cost-optimal systems are designed for a range of mass margins to examine how the optimal design varies with mass growth. The resulting cost-optimal designs are compared with results generated via mass optimization methods. Additional optimizations with continuous system parameters address the impact on mission cost due to discrete sets of launch vehicle, power, and specific impulse. The examined mission set comprises a near-Earth asteroid sample return, multiple main belt asteroid rendezvous, comet rendezvous, comet sample return, and a mission to Saturn.

Landau, Damon↗

Hybrid Optimization Software Suite

The hybrid optimization software suite (HOSS) is a general purpose fully 2D/3D parallel combined finite discrete element (FDEM) code that can be used to simulate problems involving fracture and fragmentation processes, large deformation and large rotations, discrete particle systems, solid-fluid interaction in hydro fracture problems, etc. HOSS uses a hybrid approach that combines finite-element and discrete-element methods with a novel computational fluid dynamics solver. The finite-element method is often used to analyze a material or object and how it responds to stress. The discrete-element method analyzes stresses and displacements in a volume containing a large number of particles, such as grains of sand. Fluid dynamics analyzes the fluid flow inside, around, or through solid domains. With these processes combined, HOSS represents a paradigm shift when it comes to generating accurate simulations of material deformations and failure. HOSS can perform the following: Resolves problems that consist of millions of deforming fracturing, and interacting solid particles; Requires no coupling—it naturally integrates with all regimes of fluid flow; Resolves all regimes of fluid flow, such as Stokes, low/high Reynolds, subsonic/transonic/supersonic/hypersonic, compressible/incompressible, viscid/inviscid, Newtonian/Non-Newtonian and turbulent/laminar flow; Combines all flow regimes in the same solver; Numerically stable for all flow regimes; Naturally combines different flow regimes in the same problem; Possesses material library for fluid behavior; Naturally matches fluid solver to solid solver; Includes non-inertial Eulerian formulation for fluids; Uses highly efficient parallel computing based on the Virtual Parallel Machine, thus enabling easy porting between different parallel architectures, including possible future architectures; Designed specifically for multi-physics problems in research and industry in virtual experimentation format, thereby complementing both theoretical-computational and experimental tools; Can be extended to address millions of deforming solid particles immersed in fluid flowing at all regimes; Can be extended to address biological applications, such as modeling bone fracture or red blood cells in blood plasma

Knight, Earl E.↗

Efficient Active Learning for Gaussian Process Classification by Error Reduction

Active learning sequentially selects the best instance for labeling by optimizing an acquisition function to enhance data/label efficiency. The selection can be either from a discrete instance set (pool-based scenario) or a continuous instance space (query synthesis scenario). In this work, we study both active learning scenarios for Gaussian Process Classification (GPC). The existing active learning strategies that maximize the Estimated Error Reduction (EER) aim at reducing the classification error after training with the new acquired instance in a onestep-look-ahead manner. The computation of EER-based acquisition functions is typically prohibitive as it requires retraining the GPC with every new query. Moreover, as the EER is not smooth, it can not be combined with gradient-based optimization techniques to efficiently explore the continuous instance space for query synthesis. To overcome these critical limitations, we develop computationally efficient algorithms for EER-based active learning with GPC. Further, we derive the joint predictive distribution of label pairs as a one-dimensional integral, as a result of which the computation of the acquisition function avoids retraining the GPC for each query, remarkably reducing the computational overhead. We also derive the gradient chain rule to efficiently calculate the gradient of the acquisition function, which leads to the first query synthesis active learning algorithm implementing EER-based strategies. Our experiments clearly demonstrate the computational efficiency of the proposed algorithms. We also benchmark our algorithms on both synthetic and real-world datasets, which show superior performance in terms of sampling efficiency compared to the existing state-of-the-art algorithms.

97 MATHEMATICS AND COMPUTING↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗

Optimal Allocation of Water Resources Using a Two-Stage Stochastic Programming Method with Interval and Fuzzy Parameters

Efficient water allocation is one of the most prominent issues in water resources management. In this research, a two-stage interval-parameter stochastic fuzzy programming with type 2 membership functions was used to allocate water resources optimally to different users under uncertainty. This method can handle uncertainties expressed as probability distributions, discrete intervals, and fuzzy sets. The model considers treated wastewater as an allocable water resource in a scenario, in addition to water that is extracted from wellheads, springs, and qanats. Moreover, the loss rate of water during distribution, surplus water in the reservoir in the previous and the next period, and treated wastewater parameters have been incorporated into the model. This model was applied to a case study of water resources allocation within a multi-user and multi-reservoir context in the Zarand region of Kerman, Iran. The results indicate that reasonable solutions have been generated, in the form of interval and fuzzy information under different scenarios that could help managers provide optimal water resources allocation plans. The results also demonstrate that establishing a wastewater treatment station increases the system net benefits, surplus water in wellheads for the next period, and system reliability (level of satisfying the fuzzy goal and constraints), and decreases encountering water shortages.

58 GEOSCIENCES↗

Modeling the Nuclear Fuel Cycle

A review of existing nuclear fuel cycle systems analysis codes was performed to determine if any existing codes meet technical and functional requirements defined for a U.S. national program supporting the global and domestic assessment, development and deployment of nuclear energy systems. The program would be implemented using an interconnected architecture of different codes ranging from the fuel cycle analysis code, which is the subject of the review, to fundamental physical and mechanistic codes. Four main functions are defined for the code: (1) the ability to characterize and deploy individual fuel cycle facilities and reactors in a simulation, while discretely tracking material movements, (2) the capability to perform an uncertainty analysis for each element of the fuel cycle and an aggregate uncertainty analysis, (3) the inclusion of an optimization engine able to optimize simultaneously across multiple objective functions, and (4) open and accessible code software and documentation to aid in collaboration between multiple entities and facilitate software updates. Existing codes, categorized as annualized or discrete fuel tracking codes, were assessed according to the four functions and associated requirements. These codes were developed by various government, education and industrial entities to fulfill particular needs. In some cases, decisions were made during code development to limit the level of detail included in a code to ease its use or to focus on certain aspects of a fuel cycle to address specific questions. The review revealed that while no two of the codes are identical, they all perform many of the same basic functions. No code was able to perform defined function 2 or several requirements of functions 1 and 3. Based on this review, it was concluded that the functions and requirements will be met only with development of a new code, referred to as GENIUS.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Self-Driving Telescopes: Autonomous Scheduling of Astronomical Observation Campaigns with Offline Reinforcement Learning

Modern astronomical experiments are designed to achieve multiple scientific goals, from studies of galaxy evolution to cosmic acceleration. These goals require data of many different classes of night-sky objects, each of which has a particular set of observational needs. These observational needs are typically in strong competition with one another. This poses a challenging multi-objective optimization problem that remains unsolved. The effectiveness of Reinforcement Learning (RL) as a valuable paradigm for training autonomous systems has been well-demonstrated, and it may provide the basis for self-driving telescopes capable of optimizing the scheduling for astronomy campaigns. Simulated datasets containing examples of interactions between a telescope and a discrete set of sky locations on the celestial sphere can be used to train an RL model to sequentially gather data from these several locations to maximize a cumulative reward as a measure of the quality of the data gathered. We use simulated data to test and compare multiple implementations of a Deep Q-Network (DQN) for the task of optimizing the schedule of observations from the Stone Edge Observatory (SEO). We combine multiple improvements on the DQN and adjustments to the dataset, showing that DQNs can achieve an average reward of 87%+-6% of the maximum achievable reward in each state on the test set. This is the first comparison of offline RL algorithms for a particular astronomical challenge and the first open-source framework for performing such a comparison and assessment task.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Block-oriented modeling of superstructure optimization problems

We present a novel software framework for modeling large-scale engineered systems as mathematical optimization problems. A key motivating feature in such systems is their hierarchical, highly structured topology. Existing mathematical optimization modeling environments do not facilitate the natural expression and manipulation of hierarchically structured systems. Rather, the modeler is forced to "flatten" the system description, hiding structure that may be exploited by solvers, and obfuscating the system that the modeling environment is attempting to represent. To correct this deficiency, we propose a Python-based "block-oriented" modeling approach for representing the discrete components within the system. Our approach is an extension of the Pyomo library for specifying mathematical optimization problems. Through the use of a modeling components library, the block-oriented approach facilitates a clean separation of system superstructure from the details of individual components. This approach also naturally lends itself to expressing design and operational decisions as disjunctive expressions over the component blocks. By expressing a mathematical optimization problem in a block-oriented manner, inherent structure (e.g., multiple scenarios) is preserved for potential exploitation by solvers. In particular, we show that block-structured mathematical optimization problems can be straightforwardly manipulated by decomposition-based multi-scenario algorithmic strategies, specifically in the context of the PySP stochastic programming library. We illustrate our block-oriented modeling approach using a case study drawn from the electricity grid operations domain: unit commitment with transmission switching and N - 1 reliability constraints. Finally, we demonstrate that the overhead associated with block-oriented modeling only minimally increases model instantiation times, and need not adversely impact solver behavior. (C) 2013 Elsevier Ltd. All rights reserved.

Friedman, Z↗