Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random search”

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

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

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

The computer for design and optimization

Computerized design using numerical optimization techniques is discussed and guidelines for writing analysis computer codes that can be readily coupled to optimization codes are presented. The following numerical optimization techniques are examined: random search, sequential unconstrained minimization, direct constrained optimization, and one-dimensional search. A number of design applications are considered including high speed airfoil lift maximization, the preliminary design of a wing, design of a planar tower for optimal geometry, and the conceptual design of a tactical fighter aircraft.

Vanderplaats, G. N.↗
NASA NTRS1980

System identification of large space structures

The paper deals with the problem of system identifiability for a linear dynamical system. Two theorems are given relating the sufficient condition of system identifiability for certain linear structures to the total number of inputs and outputs. The principle of least squares, that seeks the minimization of a cost function is employed to carry out the system identification process. To illustrate the concept of the paper, a structural model of a beam with point masses is examined. Parameter identification methods are studied and a random search technique is introduced.

Juang, J. N.↗
NASA NTRS1983

Parameter estimation in truss beams using Timoshenko beam model with damping

Truss beams with members having viscous damping are modeled with a Timoshenko beam. Procedures for deriving the equivalent bending rigidity, transverse shear rigidity, and damping are presented. Explicit expressions for these equivalent beam properties are obtained for a specific truss beam. The beam model thus established is then used to investigate the effect of damping in free vibration. Finally, the beam is employed in the estimation of structural parameters in a simply-supported truss beam using a random search algorithm.

Sun, C. T.↗
NASA NTRS1983

A design methodology for nonlinear systems containing parameter uncertainty

In the present design methodology for nonlinear systems containing parameter uncertainty, a generalized sensitivity analysis is incorporated which employs parameter space sampling and statistical inference. For the case of a system with j adjustable and k nonadjustable parameters, this methodology (which includes an adaptive random search strategy) is used to determine the combination of j adjustable parameter values which maximize the probability of those performance indices which simultaneously satisfy design criteria in spite of the uncertainty due to k nonadjustable parameters.

Young, G. E.↗
NASA NTRS1984

Maximum likelihood algorithm using an efficient scheme for computing sensitivities and parameter confidence intervals

Improved techniques for estimating airplane stability and control derivatives and their standard errors are presented. A maximum likelihood estimation algorithm is developed which relies on an optimization scheme referred to as a modified Newton-Raphson scheme with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort compared to integrating the analytically-determined sensitivity equations or using a finite difference scheme. An aircraft estimation problem is solved using real flight data to compare MNRES with the commonly used modified Newton-Raphson technique; MNRES is found to be faster and more generally applicable. Parameter standard errors are determined using a random search technique. The confidence intervals obtained are compared with Cramer-Rao lower bounds at the same confidence level. It is observed that the nonlinearity of the cost function is an important factor in the relationship between Cramer-Rao bounds and the error bounds determined by the search technique.

Murphy, P. C.↗
NASA NTRS1986

A methodology for airplane parameter estimation and confidence interval determination in nonlinear estimation problems

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. With the fitted surface, sensitivity information can be updated at each iteration with less computational effort than that required by either a finite-difference method or integration of the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, and thus provides flexibility to use model equations in any convenient format. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. The degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels and to predict the degree of agreement between CR bounds and search estimates.

Murphy, P. C.↗
NASA NTRS1990

A Boltzmann machine for the organization of intelligent machines

A three-tier structure consisting of organization, coordination, and execution levels forms the architecture of an intelligent machine using the principle of increasing precision with decreasing intelligence from a hierarchically intelligent control. This system has been formulated as a probabilistic model, where uncertainty and imprecision can be expressed in terms of entropies. The optimal strategy for decision planning and task execution can be found by minimizing the total entropy in the system. The focus is on the design of the organization level as a Boltzmann machine. Since this level is responsible for planning the actions of the machine, the Boltzmann machine is reformulated to use entropy as the cost function to be minimized. Simulated annealing, expanding subinterval random search, and the genetic algorithm are presented as search techniques to efficiently find the desired action sequence and illustrated with numerical examples.

Moed, Michael C.↗
NASA NTRS1991

Geography of cretaceous extinctions: Data base development

Data bases built from the source literature are plagued by problems of data quality. Unless the data acquisition is done by experts, working slowly, the data base may contain so much garbage that true signals and patterns cannot be detected. On the other hand, high quality data bases develop so slowly that satisfactory statistical analysis may never be possible due to the small sample sizes. Results of a test are presented of the opposite strategy: rapid data acquisition by non-experts with minimal control on data quality. A published list of 186 species and genera of fossil invertibrates of the latest Cretaceous Age (Maestrichtian) were located through a random search of the paleobiological and geological literature. The geographic location for each faunal list was then transformed electronically to Maestrichtian latitude and longitude and the lists were further digested to identify the genera occurring in each ten-degree, latitude-longitude block. The geographical lists were clustered using the Otsuka similarity coefficient and a standard unweight-pair-group method. The resulting clusters are remarkably consistent geographically, indicating that a strong biogeographic signal is visible despite low-quality data. A further test evaluated the geographic pattern of end-Cretaceaous extinctions. All genera in the data base were compared with Sepkoski's compendium of time ranges of genera to determine which of the reported genera survived the Cretaceous mass extinction. In turn, extinction rates for the ten-degree, latitude-longitude blocks were mapped. The resulting distribution is readily interpretable as a robust pattern of the geography of the mass extinction. The study demonstrates that a low-quality data base, built rapidly, can provide a basis for meaningful analysis of past biotic events.

Raup, D. M.↗
NASA NTRS1993

A Darwinian approach to control-structure design

Genetic algorithms (GA's), as introduced by Holland (1975), are one form of directed random search. The form of direction is based on Darwin's 'survival of the fittest' theories. GA's are radically different from the more traditional design optimization techniques. GA's work with a coding of the design variables, as opposed to working with the design variables directly. The search is conducted from a population of designs (i.e., from a large number of points in the design space), unlike the traditional algorithms which search from a single design point. The GA requires only objective function information, as opposed to gradient or other auxiliary information. Finally, the GA is based on probabilistic transition rules, as opposed to deterministic rules. These features allow the GA to attack problems with local-global minima, discontinuous design spaces and mixed variable problems, all in a single, consistent framework.

Zimmerman, David C.↗
NASA NTRS1992

Local design optimization for composite transport fuselage crown panels

Composite transport fuselage crown panel design and manufacturing plans were optimized to have projected cost and weight savings of 18 and 45 percent, respectively. These savings are close to those quoted as overall NASA Advanced Composite Technology (ACT) program goals. Three local optimization tasks were found to influence the cost and weight of fuselage crown panels. The effects are summarized of each task and the task associated with a design cost model is described in detail. Studies were performed to evaluate the relationship between manufacturing cost and design details. A design tool was developed to aid in these studies. The development of the design tool included combining cost and performance constraints with a random search optimization algorithm. The resulting software was used in a series of optimization studies that evaluated the sensitivity of design variables, guidelines, criteria, and material selection on cost. The effect of blending adjacent design points in a full scale panel subjected to changing load distributions and local variations was shown to be important. Technical issues and directions for future work were identified.

Swanson, G. D.↗
NASA NTRS1992

Local design optimization for composite transport fuselage crown panels

Composite transport fuselage crown panel design and manufacturing plans were optimized to have projected cost and weight savings of 18 percent and 45 percent, respectively. These savings are close to those quoted as overall NASA ACT program goals. Three local optimization tasks were found to influence the cost and weight of fuselage crown panels. This paper summarizes the effect of each task and describes in detail the task associated with a design cost model. Studies were performed to evaluate the relationship between manufacturing cost and design details. A design tool was developed to aid in these investigations. The development of the design tool included combining cost and performance constraints with a random search optimization algorithm. The resulting software was used in a series of optimization studies that evaluated the sensitivity of design variables, guidelines, criteria, and material selection on cost. The effect of blending adjacent design points in a full scale panel subjected to changing load distributions and local variations was shown to be important. Technical issues and directions for future work were identified.

Swanson, G. D.↗
NASA NTRS1985

An Algorithm for Efficient Maximum Likelihood Estimation and Confidence Interval Determination in Nonlinear Estimation Problems

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The algorithm was developed for airplane parameter estimation problems but is well suited for most nonlinear, multivariable, dynamic systems. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort. MNRES determines the sensitivities with less computational effort than using either a finite-difference method or integrating the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, thus eliminating algorithm reformulation with each new model and providing flexibility to use model equations in any format that is convenient. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. It is observed that the degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. The CR bounds were found to be close to the bounds determined by the search when the degree of nonlinearity was small. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels for the parameter confidence limits. The primary utility of the measure, however, was found to be in predicting the degree of agreement between Cramer-Rao bounds and search estimates.

Murphy, Patrick Charles↗
NASA NTRS2003

Comparison of Structural Optimization Techniques for a Nuclear Electric Space Vehicle

The purpose of this paper is to utilize the optimization method of genetic algorithms (GA) for truss design on a nuclear propulsion vehicle. Genetic Algorithms are a guided, random search that mirrors Darwin s theory of natural selection and survival of the fittest. To verify the GA s capabilities, other traditional optimization methods were used to compare the results obtained by the GA's, first on simple 2-D structures, and eventually on full-scale 3-D truss designs.

Benford, Andrew↗
NASA NTRS2004

Truss Optimization for a Manned Nuclear Electric Space Vehicle using Genetic Algorithms

The purpose of this paper is to utilize the genetic algorithm (GA) optimization method for structural design of a nuclear propulsion vehicle. Genetic algorithms provide a guided, random search technique that mirrors biological adaptation. To verify the GA capabilities, other traditional optimization methods were used to generate results for comparison to the GA results, first for simple two-dimensional structures, and then for full-scale three-dimensional truss designs.

Benford, Andrew↗
NASA NTRS1994

The sequence, and its evolutionary implications, of a Thermococcus celer protein associated with transcription

Through random search, a gene from Thermococcus celer has been identified and sequenced that appears to encode a transcription-associated protein (110 amino acid residues). The sequence has clear homology to approximately the last half of an open reading frame reported previously for Sulfolobus acidocaldarius [Langer, D. & Zillig, W. (1993) Nucleic Acids Res. 21, 2251]. The protein translations of these two archaeal genes in turn are homologs of a small subunit found in eukaryotic RNA polymerase I (A12.2) and the counterpart of this from RNA polymerase II (B12.6). Homology is also seen with the eukaryotic transcription factor TFIIS, but it involves only the terminal 45 amino acids of the archaeal proteins. Evolutionary implications of these homologies are discussed.

Non-NASA Center↗
NASA NTRS2007

Automated Knowledge Discovery From Simulators

A computational method, SimLearn, has been devised to facilitate efficient knowledge discovery from simulators. Simulators are complex computer programs used in science and engineering to model diverse phenomena such as fluid flow, gravitational interactions, coupled mechanical systems, and nuclear, chemical, and biological processes. SimLearn uses active-learning techniques to efficiently address the "landscape characterization problem." In particular, SimLearn tries to determine which regions in "input space" lead to a given output from the simulator, where "input space" refers to an abstraction of all the variables going into the simulator, e.g., initial conditions, parameters, and interaction equations. Landscape characterization can be viewed as an attempt to invert the forward mapping of the simulator and recover the inputs that produce a particular output. Given that a single simulation run can take days or weeks to complete even on a large computing cluster, SimLearn attempts to reduce costs by reducing the number of simulations needed to effect discoveries. Unlike conventional data-mining methods that are applied to static predefined datasets, SimLearn involves an iterative process in which a most informative dataset is constructed dynamically by using the simulator as an oracle. On each iteration, the algorithm models the knowledge it has gained through previous simulation trials and then chooses which simulation trials to run next. Running these trials through the simulator produces new data in the form of input-output pairs. The overall process is embodied in an algorithm that combines support vector machines (SVMs) with active learning. SVMs use learning from examples (the examples are the input-output pairs generated by running the simulator) and a principle called maximum margin to derive predictors that generalize well to new inputs. In SimLearn, the SVM plays the role of modeling the knowledge that has been gained through previous simulation trials. Active learning is used to determine which new input points would be most informative if their output were known. The selected input points are run through the simulator to generate new information that can be used to refine the SVM. The process is then repeated. SimLearn carefully balances exploration (semi-randomly searching around the input space) versus exploitation (using the current state of knowledge to conduct a tightly focused search). During each iteration, SimLearn uses not one, but an ensemble of SVMs. Each SVM in the ensemble is characterized by different hyper-parameters that control various aspects of the learned predictor - for example, whether the predictor is constrained to be very smooth (nearby points in input space lead to similar output predictions) or whether the predictor is allowed to be "bumpy." The various SVMs will have different preferences about which input points they would like to run through the simulator next. SimLearn includes a formal mechanism for balancing the ensemble SVM preferences so that a single choice can be made for the next set of trials.

Burl, Michael↗
NASA NTRS2013

Automated Long - Term Scheduling for the SOFIA Airborne Observatory

The NASA Stratospheric Observatory for Infrared Astronomy (SOFIA) is a joint US/German project to develop and operate a gyro-stabilized 2.5-meter telescope in a Boeing 747SP. SOFIA's first science observations were made in December 2010. During 2011, SOFIA accomplished 30 flights in the "Early Science" program as well as a deployment to Germany. The new observing period, known as Cycle 1, is scheduled to begin in 2012. It includes 46 science flights grouped in four multi-week observing campaigns spread through a 13-month span. Automation of the flight scheduling process offers a major challenge to the SOFIA mission operations. First because it is needed to mitigate its relatively high cost per unit observing time compared to space-borne missions. Second because automated scheduling techniques available for ground-based and space-based telescopes are inappropriate for an airborne observatory. Although serious attempts have been made in the past to solve part of the problem, until recently mission operations staff was still manually scheduling flights. We present in this paper a new automated solution for generating SOFIA long-term schedules that will be used in operations from the Cycle 1 observing period. We describe the constraints that should be satisfied to solve the SOFIA scheduling problem in the context of real operations. We establish key formulas required to efficiently calculate the aircraft course over ground when evaluating flight schedules. We describe the foundations of the SOFIA long-term scheduler, the constraint representation, and the random search based algorithm that generates observation and instrument schedules. Finally, we report on how the new long-term scheduler has been used in operations to date.

Civeit, Thomas↗
NASA NTRS1985

Optimum search strategy for randomly distributed CW transmitters

The relative probability of detecting randomly distributed CW transmitters as a function of the fraction of the sky which is searched (in a fixed time interval) is given. It is shown that the probability of detecting such a class of transmitters with a given receiving system is a maximum if the entire sky is searched, provided that the receiving system is sufficiently sensitive to detect the nearest transmitter in the allocated time and that the integration time - bandwidth product in a specified direction is greater than 8.

Gulkis, S.↗