Search NASA⌕ Search

SEARCH · Search NASA

Results for “global 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 145 records · Page 8

Electronic Neural Networks

Viewgraphs on electronic neural networks for space station are presented. Topics covered include: electronic neural networks; electronic implementations; VLSI/thin film hybrid hardware for neurocomputing; computations with analog parallel processing; features of neuroprocessors; applications of neuroprocessors; neural network hardware for terrain trafficability determination; a dedicated processor for path planning; neural network system interface; neural network for robotic control; error backpropagation algorithm for learning; resource allocation matrix; global optimization neuroprocessor; and electrically programmable read only thin-film synaptic array.

Thakoor, Anil↗

Progress in multidisciplinary design optimization at NASA Langley

Multidisciplinary Design Optimization refers to some combination of disciplinary analyses, sensitivity analysis, and optimization techniques used to design complex engineering systems. The ultimate objective of this research at NASA Langley Research Center is to help the US industry reduce the costs associated with development, manufacturing, and maintenance of aerospace vehicles while improving system performance. This report reviews progress towards this objective and highlights topics for future research. Aerospace design problems selected from the author's research illustrate strengths and weaknesses in existing multidisciplinary optimization techniques. The techniques discussed include multiobjective optimization, global sensitivity equations and sequential linear programming.

Padula, Sharon L.↗

A statistical-based scheduling algorithm in automated data path synthesis

In this paper, we propose a new heuristic scheduling algorithm based on the statistical analysis of the cumulative frequency distribution of operations among control steps. It has a tendency of escaping from local minima and therefore reaching a globally optimal solution. The presented algorithm considers the real world constraints such as chained operations, multicycle operations, and pipelined data paths. The result of the experiment shows that it gives optimal solutions, even though it is greedy in nature.

Jeon, Byung Wook↗

Global cost and weight evaluation of fuselage keel design concepts

The Boeing program entitled Advanced Technology Composite Aircraft Structure (ATCAS) is focused on the application of affordable composite technology to pressurized fuselage structure of future aircraft. As part of this effort, a design study was conducted on the keel section of the aft fuselage. A design build team (DBT) approach was used to identify and evaluate several design concepts which incorporated different material systems, fabrication processes, structural configurations, and subassembly details. The design concepts were developed in sufficient detail to accurately assess their potential for cost and weight savings as compared with a metal baseline representing current wide body technology. The cost and weight results, along with an appraisal of performance and producibility risks, are used to identify a globally optimized keel design; one which offers the most promising cost and weight advantages over metal construction. Lastly, an assessment is given of the potential for further cost and weight reductions of the selected keel design during local optimization.

Flynn, B. W.↗

Global Cost and Weight Evaluation of Fuselage Side Panel Design Concepts

This report documents preliminary design trades conducted under NASA contracts NAS1 18889 (Advanced Technology Composite Aircraft Structures, ATCAS) and NAS1-19349 (Task 3, Pathfinder Shell Design) for a subsonic wide body commercial aircraft fuselage side panel section utilizing composite materials. Included in this effort were (1) development of two complete design concepts, (2) generation of cost and weight estimates, (3) identification of technical issues and potential design enhancements, and (4) selection of a single design to be further developed. The first design concept featured an open-section stringer stiffened skin configuration while the second was based on honeycomb core sandwich construction. The trade study cost and weight results were generated from comprehensive assessment of each structural component comprising the fuselage side panel section from detail fabrication through airplane final assembly. Results were obtained in three phases: (1) for the baseline designs, (2) after global optimization of the designs, and (3) the results anticipated after detailed design optimization. A critical assessment of both designs was performed to determine the risk associated with each concept, that is the relative probability of achieving the cost and weight projections. Seven critical technical issues were identified as the first step towards side panel detailed design optimization.

Polland, D. R.↗

Genetically Engineered Microelectronic Infrared Filters

A genetic algorithm is used for design of infrared filters and in the understanding of the material structure of a resonant tunneling diode. These two components are examples of microdevices and nanodevices that can be numerically simulated using fundamental mathematical and physical models. Because the number of parameters that can be used in the design of one of these devices is large, and because experimental exploration of the design space is unfeasible, reliable software models integrated with global optimization methods are examined The genetic algorithm and engineering design codes have been implemented on massively parallel computers to exploit their high performance. Design results are presented for the infrared filter showing new and optimized device design. Results for nanodevices are presented in a companion paper at this workshop.

Cwik, Tom↗

A Comparison of Two Path Planners for Planetary Rovers

The paper presents two path planners suitable for planetary rovers. The first is based on fuzzy description of the terrain, and genetic algorithm to find a traversable path in a rugged terrain. The second planner uses a global optimization method with a cost function that is the path distance divided by the velocity limit obtained from the consideration of the rover static and dynamic stability. A description of both methods is provided, and the results of paths produced are given which show the effectiveness of the path planners in finding near optimal paths. The features of the methods and their suitability and application for rover path planning are compared

Tarokh, M.↗

Three-Dimensional Stereoscopic Tracking Velocimetry and Experimental/Numerical Comparison of Directional Solidification

Measurement of three-dimensional (3-D) three-component velocity fields is of great importance in both ground and space experiments for understanding materials processing and fluid physics. The experiments in these fields most likely inhibit the application of conventional planar probes for observing 3-D phenomena. Here, we present the investigation results of stereoscopic tracking velocimetry (STV) for measuring 3-D velocity fields, which include diagnostic technology development, experimental velocity measurement, and comparison with analytical and numerical computation. STV is advantageous in system simplicity for building compact hardware and in software efficiency for continual near-real-time monitoring. It has great freedom in illuminating and observing volumetric fields from arbitrary directions. STV is based on stereoscopic observation of particles-Seeded in a flow by CCD sensors. In the approach, part of the individual particle images that provide data points is likely to be lost or cause errors when their images overlap and crisscross each other especially under a high particle density. In order to maximize the valid recovery of data points, neural networks are implemented for these two important processes. For the step of particle overlap decomposition, the back propagation neural network is utilized because of its ability in pattern recognition with pertinent particle image feature parameters. For the step of particle tracking, the Hopfield neural network is employed to find appropriate particle tracks based on global optimization. Our investigation indicates that the neural networks are very efficient and useful for stereoscopically tracking particles. As an initial assessment of the diagnostic technology performance, laminar water jets with and without pulsation are measured. The jet tip velocity profiles are in good agreement with analytical predictions. Finally, for testing in material processing applications, a simple directional solidification apparatus is built for experimenting with a metal analog of succinonitrile. Its 3-D velocity field at the liquid phase is then measured to be compared with those from numerical computation. Our theoretical, numerical, and experimental investigations have proven STV to be a viable candidate for reliably measuring 3-D flow velocities. With current activities are focused on further improving the processing efficiency, overall accuracy, and automation, the eventual efforts of broad experimental applications and concurrent numerical modeling validation will be vital to many areas in fluid flow and materials processing.

Lee, David↗

Partially Decentralized Control Architectures for Satellite Formations

In a partially decentralized control architecture, more than one but less than all nodes have supervisory capability. This paper describes an approach to choosing the number of supervisors in such au architecture, based on a reliability vs. cost trade. It also considers the implications of these results for the design of navigation systems for satellite formations that could be controlled with a partially decentralized architecture. Using an assumed cost model, analytic and simulation-based results indicate that it may be cheaper to achieve a given overall system reliability with a partially decentralized architecture containing only a few supervisors, than with either fully decentralized or purely centralized architectures. Nominally, the subset of supervisors may act as centralized estimation and control nodes for corresponding subsets of the remaining subordinate nodes, and act as decentralized estimation and control peers with respect to each other. However, in the context of partially decentralized satellite formation control, the absolute positions and velocities of each spacecraft are unique, so that correlations which make estimates using only local information suboptimal only occur through common biases and process noise. Covariance and monte-carlo analysis of a simplified system show that this lack of correlation may allow simplification of the local estimators while preserving the global optimality of the maneuvers commanded by the supervisors.

Carpenter, J. Russell↗

Low Temperature Performance of High-Speed Neural Network Circuits

Artificial neural networks, derived from their biological counterparts, offer a new and enabling computing paradigm specially suitable for such tasks as image and signal processing with feature classification/object recognition, global optimization, and adaptive control. When implemented in fully parallel electronic hardware, it offers orders of magnitude speed advantage. Basic building blocks of the new architecture are the processing elements called neurons implemented as nonlinear operational amplifiers with sigmoidal transfer function, interconnected through weighted connections called synapses implemented using circuitry for weight storage and multiply functions either in an analog, digital, or hybrid scheme.

artificial neural networks image processing signal↗

The Ground Flash Fraction Retrieval Algorithm Employing Differential Evolution: Simulations and Applications

The ability to estimate the fraction of ground flashes in a set of flashes observed by a satellite lightning imager, such as the future GOES-R Geostationary Lightning Mapper (GLM), would likely improve operational and scientific applications (e.g., severe weather warnings, lightning nitrogen oxides studies, and global electric circuit analyses). A Bayesian inversion method, called the Ground Flash Fraction Retrieval Algorithm (GoFFRA), was recently developed for estimating the ground flash fraction. The method uses a constrained mixed exponential distribution model to describe a particular lightning optical measurement called the Maximum Group Area (MGA). To obtain the optimum model parameters (one of which is the desired ground flash fraction), a scalar function must be minimized. This minimization is difficult because of two problems: (1) Label Switching (LS), and (2) Parameter Identity Theft (PIT). The LS problem is well known in the literature on mixed exponential distributions, and the PIT problem was discovered in this study. Each problem occurs when one allows the numerical minimizer to freely roam through the parameter search space; this allows certain solution parameters to interchange roles which leads to fundamental ambiguities, and solution error. A major accomplishment of this study is that we have employed a state-of-the-art genetic-based global optimization algorithm called Differential Evolution (DE) that constrains the parameter search in such a way as to remove both the LS and PIT problems. To test the performance of the GoFFRA when DE is employed, we applied it to analyze simulated MGA datasets that we generated from known mixed exponential distributions. Moreover, we evaluated the GoFFRA/DE method by applying it to analyze actual MGAs derived from low-Earth orbiting lightning imaging sensor data; the actual MGA data were classified as either ground or cloud flash MGAs using National Lightning Detection Network[TM] (NLDN) data. Solution error plots are provided for both the simulations and actual data analyses.

Koshak, William↗

Orbit Clustering Based on Transfer Cost

We propose using cluster analysis to perform quick screening for combinatorial global optimization problems. The key missing component currently preventing cluster analysis from use in this context is the lack of a useable metric function that defines the cost to transfer between two orbits. We study several proposed metrics and clustering algorithms, including k-means and the expectation maximization algorithm. We also show that proven heuristic methods such as the Q-law can be modified to work with cluster analysis.

combinatorial optimization↗

Kodiak: An Implementation Framework for Branch and Bound Algorithms

Recursive branch and bound algorithms are often used to refine and isolate solutions to several classes of global optimization problems. A rigorous computation framework for the solution of systems of equations and inequalities involving nonlinear real arithmetic over hyper-rectangular variable and parameter domains is presented. It is derived from a generic branch and bound algorithm that has been formally verified, and utilizes self-validating enclosure methods, namely interval arithmetic and, for polynomials and rational functions, Bernstein expansion. Since bounds computed by these enclosure methods are sound, this approach may be used reliably in software verification tools. Advantage is taken of the partial derivatives of the constraint functions involved in the system, firstly to reduce the branching factor by the use of bisection heuristics and secondly to permit the computation of bifurcation sets for systems of ordinary differential equations. The associated software development, Kodiak, is presented, along with examples of three different branch and bound problem types it implements.

Smith, Andrew P.↗

Evaluation of a Multizone Impedance Eduction Method

A computational study is used to evaluate the PyCHE impedance eduction method developed at the NASA Langley Research Center. This method combines an aeroacoustic duct propagation code based on numerical solution to the convected Helmholtz equation with a global optimizer that uses the Differential Evolution algorithm. The efficacy of this method is evaluated with acoustic pressure data simulated to represent that measured with one-zone, two-zone, and three-zone liners mounted in the NASA Langley Grazing Flow Impedance Tube. The PyCHE method has a normalized impedance error of approximately 0.2 for (uniform) one-zone liners with a length of at least 5”, and produces quite reasonable results for liners as short as 2”. Whereas the impedance of the liner has an effect on eduction accuracy, the amount of attenuation is shown to be the dominant parameter. Similar results are observed for two-zone liners, for which the impedance of each zone is unique. The two-zone results also indicate it is more difficult to accurately educe resistance than reactance, and a zone length of at least 6” (slightly longer than for uniform liners) is needed to limit the normalized error to 0.2. The PyCHE method is also demonstrated to successfully educe the impedances for each zone of a three-zone liner. These results are sufficiently encouraging to warrant the continued usage of the PyCHE impedance eduction method for single and multizone liners.

Jones, M. G.↗

Refinement of the Transition-edge Sensor Design for ATHENA X-IFU

The X-ray Integral Field Unit (X-IFU) instrument on the Advanced Telescope for High ENergy Astrophysics (ATHENA) is baselined to have 2376 transition-edge sensor (TES) microcalorimeter pixels in a single array. The required performance for X-IFU has been demonstrated on a kilo-pixel array of square TES’s with 50 m side length, and this is considered the baseline pixel design. However, over the last few years we have explored small modifications to this design in search of a globally optimized instrument performance. We have previously reported on investigations of extending the length of the TES’s and variations in the number of X-ray absorber support stems. Here we report on investigations of TES designs with a length of 50 m but narrower width. We will discuss the consequence of this on magnetic field sensitivity, resistive transition parameters, spectral performance, and ease of multiplexing. We will also discuss how the number and position of the absorber attachments influences the vibrational modes of the pixels, and the impact this may have on performance. Finally, we will present measurements of more substantial change options of our TES design, including more extreme TES geometries, the use of metal islands or etched holes in the silicon nitride membranes, and the position of wiring to minimize current-induced magnetic field effects. The exploration of all these changes to the design are not only useful for optimizing performance on X-IFU, but also guide our fundamental understanding of the key physics of TES microcalorimeters.

Nick Wakeham↗

P- and L-Band Retrieval of Subsurface Soil Moisture and Temperature Profiles as First-Order Polynomial Function

This paper demonstrates the potential use of P and L band passive measurements to determine root zone soil moisture (SM) and soil temperature(ST). SM and ST data have been taken as a function of depth during the NASA GSFC PLEX19 experiment in the summer of 2019 at Beltsville, MD, USA. Using these data, a coherent model has been used to compute H and V brightness temperatures at frequencies of 0.8 and 1.4 GHz with an observation angle of 35 degrees. These synthetic brightness data are then used to estimate the SM and ST profiles which are represented by linear polynomials. The inversion problem is formulated as a least square problem that is solved by a global optimization method known as the Adaptive Simulated Annealing(ASA) method. Four inversion examples having different SM and ST profiles are presented. Selected results show that the standard deviation between the retrieved and measured data is less than 0.077 cm3/cm3 for SM, and 2.245 °C for ST.

Ming Li↗

Foraging with MUSHROOMS: A Mixed-integer Linear Programming Scheduler for Multimessenger Target of Opportunity Searches with the Zwicky Transient Facility

Electromagnetic follow-up of gravitational-wave detections is very resource intensive, taking up hours of limited observation time on dozens of telescopes. Creating more efficient schedules for follow-up will lead to a commensurate increase in counterpart location efficiency without using more telescope time. Widely used in operations research and telescope scheduling, mixed-integer linear programming is a strong candidate to produce these higher-efficiency schedules, as it can make use of powerful commercial solvers that find globally optimal solutions to provided problems. We detail a new target-of-opportunity scheduling algorithm designed with Zwicky Transient Facility in mind that uses mixed-integer linear programming. We compare its performance to gwemopt, the tuned heuristic scheduler used by the Zwicky Transient Facility and other facilities during the third LIGO–Virgo gravitational-wave observing run. This new algorithm uses variable-length observing blocks to enforce cadence requirements and to ensure field observability, along with having a secondary optimization step to minimize slew time. We show that by employing a hybrid method utilizing both this scheduler and gwemopt, the previous scheduler used, in concert, we can achieve an average improvement in detection efficiency of 3%–11% over gwemopt alone for a simulated binary neutron star merger data set consistent with LIGO–Virgo's third observing run, highlighting the potential of mixed-integer target of opportunity schedulers for future multimessenger follow-up surveys.

B Parazin↗

Multi-Robot Assembly Scheduling for the Lunar Crater Radio Telescope on the Far-Side of the Moon

The Lunar Crater Radio Telescope (LCRT) is a pro- posed ultra-long-wavelength radio telescope to be constructed on the far side of the moon. The proposed telescope will be constructed by deploying a 1km wire mesh in a 3-5km crater using a team of wall-climbing DuAxel robots. In this work, we consider the problem of generating minimum-time assembly sequences for LCRT, using realistic models of travel speed and lighting. Specifically, we pose the assembly sequencing problem as a mixed-integer linear program (MILP), which we solve to global optimality using commercial solvers. We present methods for modeling time-varying travel and assembly times, based on variable lighting conditions (including crater shadowing), and show how such time-varying parameters can be incorporated into the MILP. Finally, we present numerical studies of our method, showing how makespan varies with the number of assembly robots.

Schwager, Mac↗