Results for “Search algorithm” — Page 9

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 NTRS1985

Collection and analysis of NASA clean room air samples

The environment of the HALOE assembly clean room at NASA Langley Research Center is analyzed to determine the background levels of airborne organic compounds. Sampling is accomplished by pumping the clean room air through absorbing cartridges. For volatile organics, cartridges are thermally desorbed and then analyzed by gas chromatography and mass spectrometry, compounds are identified by searching the EPA/NIH data base using an interactive operator INCOS computer search algorithm. For semivolatile organics, cartridges are solvent entracted and concentrated extracts are analyzed by gas chromatography-electron capture detection, compound identification is made by matching gas chromatogram retention times with known standards. The detection limits for the semivolatile organics are; 0.89 ng cu m for dioctylphlhalate (DOP) and 1.6 ng cu m for polychlorinated biphenyls (PCB). The detection limit for volatile organics ranges from 1 to 50 parts per trillion. Only trace quantities of organics are detected, the DOP levels do not exceed 2.5 ng cu m and the PCB levels do not exceed 454 ng cu m.

Sheldon, L. S.↗

NASA NTRS1986

The design and application of a Transportable Inference Engine (TIE1)

A Transportable Inference Engine (TIE1) system has been developed by the author as part of the Interactive Experimenter Planning System (IEPS) task which is involved with developing expert systems in support of the Spacecraft Control Programs Branch at Goddard Space Flight Center in Greenbelt, Maryland. Unlike traditional inference engines, TIE1 is written in the C programming language. In the TIE1 system, knowledge is represented by a hierarchical network of objects which have rule frames. The TIE1 search algorithm uses a set of strategies, including backward chaining, to obtain the values of goals. The application of TIE1 to a spacecraft scheduling problem is described. This application involves the development of a strategies interpreter which uses TIE1 to do constraint checking.

Mclean, David R.↗

NASA NTRS1988

Material parameter measurements at high temperatures

Alternate fixtures of techniques for the measurement of the constitutive material parameters at elevated temperatures are presented. The technique utilizes scattered field data from material coated cylinders between parallel plates or material coated hemispheres over a finite size groundplane. The data acquisition is centered around the HP 8510B Network Analyzer. The parameters are then found from a numerical search algorithm using the Newton-Ralphson technique with the measured and calculated fields from these canonical scatters. Numerical and experimental results are shown.

Dominek, A.↗

NASA NTRS1989

Equilibrium gas flow computations. I - Accurate and efficient calculation of equilibrium gas properties

This paper treats the accurate and efficient calculation of thermodynamic properties of arbitrary gas mixtures for equilibrium flow computations. New improvements in the Stupochenko-Jaffe model for the calculation of thermodynamic properties of diatomic molecules are presented. A unified formulation of equilibrium calculations for gas mixtures in terms of irreversible entropy is given. Using a highly accurate thermo-chemical data base, a new, efficient and vectorizable search algorithm is used to construct piecewise interpolation procedures with generate accurate thermodynamic variable and their derivatives required by modern computational algorithms. Results are presented for equilibrium air, and compared with those given by the Srinivasan program.

Liu, Yen↗

NASA NTRS1988

Fast interpolation schemes for moving grids

Search algorithms are developed for efficiently locating interpolation points to facilitate transfer of data in moving grid and related problems. Applications in the construction of adaptive grids and in the solution of problems on composite grids are included.

Mastin, C. Wayne↗

NASA NTRS1986

The design and application of a Transportable Inference Engine (TIE1)

A Transportable Inference Engine (TIE1) system has been developed by the author as part of the Interactive Experimenter Planning System (IEPS) task which is involved with developing expert systems in support of the Spacecraft Control Programs Branch at Goddard Space Flight Center in Greenbelt, Maryland. Unlike traditional inference engines, TIE1 is written in the C programming language. In the TIE1 system, knowledge is represented by a hierarchical network of objects which have rule frames. The TIE1 search algorithm uses a set of strategies, including backward chaining, to obtain the values of goals. The application of TIE1 to a spacecraft scheduling problem is described. This application involves the development of a strategies interpreter which uses TIE1 to do constraint checking.

Mclean, David R.↗

NASA NTRS1991

Maximum life spur gear design

Optimization procedures allow one to design a spur gear reduction for maximum life and other end use criteria. A modified feasible directions search algorithm permits a wide variety of inequality constraints and exact design requirements to be met with low sensitivity to initial guess values. The optimization algorithm is described, and the models for gear life and performance are presented. The algorithm is compact and has been programmed for execution on a desk top computer. Two examples are presented to illustrate the method and its application.

Savage, M.↗

NASA NTRS1990

Parameter learning for performance adaptation

A parameter learning method is introduced and used to broaden the region of operability of the adaptive control system of a flexible space antenna. The learning system guides the selection of control parameters in a process leading to optimal system performance. A grid search procedure is used to estimate an initial set of parameter values. The optimization search procedure uses a variation of the Hooke and Jeeves multidimensional search algorithm. The method is applicable to any system where performance depends on a number of adjustable parameters. A mathematical model is not necessary, as the learning system can be used whenever the performance can be measured via simulation or experiment. The results of two experiments, the transient regulation and the command following experiment, are presented.

Peek, Mark D.↗

NASA NTRS1991

Maximum life spur gear design

Optimization procedures allow one to design a spur gear reduction for maximum life and other end use criteria. A modified feasible directions search algorithm permits a wide variety of inequality constraints and exact design requirements to be met with low sensitivity to initial guess values. The optimization algorithm is described, and the models for gear life and performance are presented. The algorithm is compact and has been programmed for execution on a desk top computer. Two examples are presented to illustrate the method and its application.

Savage, M.↗

NASA NTRS1991

On the theory of the synthesis of offset dual-shaped reflectors - Case examples

In an earlier paper by Galindo-Israel et al. (1987), the geometrical optics (GO) principles, constraints, and requirements of the dual- and single-offset-shaped reflector synthesis problem were collected and developed into a set of nonlinear first-order PDEs. An extension of the methods by which solutions to the PDEs can be obtained is presented, together with several case examples. These examples are independently analyzed by GO and physical optics diffraction methods. The starting point for the integration over each reflector can be taken on the outer rim, at the center, or at an intermediate point-the intermediate starting point being the more general case. The utility of the speed of this synthesis method is demonstrated. For example, the program utilized completes a synthesis in less than 45 s on a 386/20 personal computer and within a fraction of a second on a mainframe Cray. This makes practical the incorporation of the synthesis into a search algorithm that can optimize one or more parameters of the reflector system. As an example, the optimization of the mapping equations for low cross polarization is discussed.

Galindo-Israel, Victor↗

NASA NTRS1991

Spectroscopy of an unusual emission line M star

Moderate-resolution spectroscopy of an unusual late-type faint emission-line star, PC 0025 + 0047, is reported. A very strong (greater than 250 A equivalent width) an H-alpha emission line was detected by the present automated line search algorithm. The spectrum was found to have two unresolved emission lines (H-alpha and H-beta) near zero velocity, superposed on the absorption spectrum of a very red M dwarf which has strong K I, and relatively weak bands of TiO. From the weakness of the subordinate lines of Na I (8192 A) and other spectral features, it is inferred that it is definitely a cooler, and probably fainter, analog of LHS 2924. The strength of the emission lines indicates that PC 0025 + 0447 is very young and may be a fading predecessor brown drawf at an estimated M(bol) approaching 14m at a distance of about 60 pc.

Schneider, Donald P.↗

NASA NTRS1990

Assembly planning for large truss structures in space

The approach is based on a graph search algorithm. A relational data structure is used to represent a truss structure. There are four types of entities: units, faces, edges, and vertices. There are contain/contained relationships for every pair of entity types, as well as in-contact relationships between faces. A best-first algorithm constitutes the core of the planner. The cost function in the current implementation corresponds to a combination of the rigidity of the intermediate structures and the total distance to be traversed by the agent executing the assembly tasks.

Homem De Mello, L. S.↗

NASA NTRS1992

Using Derivatives Of Higher Order In Sensitivity Analysis

"What if" questions answered exactly, without using "increment-and-reevaluate" approach, and without finite differencing of system analysis, by use of sensitivity analysis to calculate first derivatives of behaviors of coupled systems with respect to design variables. If problem strongly nonlinear, efficiency improved by making derivatives of higher orders available to search algorithms. Extension effected by recursive application of same implicit function theorem that underlies previous method. Useful in design calculations for almost any system, including structures, machines, and distribution networks. Feedback control of processes improved by inclusion of derivative terms of higher order.

Sobieski, Jaroslaw↗

NASA NTRS1992

Optimal design of compact spur gear reductions

The optimal design of compact spur gear reductions includes the selection of bearing and shaft proportions in addition to gear mesh parameters. Designs for single mesh spur gear reductions are based on optimization of system life, system volume, and system weight including gears, support shafts, and the four bearings. The overall optimization allows component properties to interact, yielding the best composite design. A modified feasible directions search algorithm directs the optimization through a continuous design space. Interpolated polynomials expand the discrete bearing properties and proportions into continuous variables for optimization. After finding the continuous optimum, the designer can analyze near optimal designs for comparison and selection. Design examples show the influence of the bearings on the optimal configurations.

Savage, M.↗

NASA NTRS1992

Maximum life spiral bevel reduction design

Optimization is applied to the design of a spiral bevel gear reduction for maximum life at a given size. A modified feasible directions search algorithm permits a wide variety of inequality constraints and exact design requirements to be met with low sensitivity to initial values. Gear tooth bending strength and minimum contact ratio under load are included in the active constraints. The optimal design of the spiral bevel gear reduction includes the selection of bearing and shaft proportions in addition to gear mesh parameters. System life is maximized subject to a fixed backcone distance of the spiral bevel gear set for a specified speed reduction, shaft angle, input torque, and power. Design examples show the influence of the bearing lives on the gear parameters in the optimal configurations. For a fixed back-cone distance, optimal designs with larger shaft angles have larger service lives.

Savage, M.↗

NASA NTRS1992

Maximum life spiral bevel reduction design

Optimization is applied to the design of a spiral bevel gear reduction for maximum life at a given size. A modified feasible directions search algorithm permits a wide variety of inequality constraints and exact design requirements to be met with low sensitivity to initial values. Gear tooth bending strength and minimum contact ratio under load are included in the active constraints. The optimal design of the spiral bevel gear reduction includes the selection of bearing and shaft proportions in addition to gear mesh parameters. System life is maximized subject to a fixed back-cone distance of the spiral bevel gear set for a specified speed ratio, shaft angle, input torque, and power. Significant parameters in the design are: the spiral angle, the pressure angle, the numbers of teeth on the pinion and gear, and the location and size of the four support bearings. Interpolated polynomials expand the discrete bearing properties and proportions into continuous variables for gradient optimization. After finding the continuous optimum, a designer can analyze near optimal designs for comparison and selection. Design examples show the influence of the bearing lives on the gear parameters in the optimal configurations. For a fixed back-cone distance, optimal designs with larger shaft angles have larger service lives.

Savage, M.↗

NASA NTRS1992

A genetic algorithms approach for altering the membership functions in fuzzy logic controllers

Through previous work, a fuzzy control system was developed to perform translational and rotational control of a space vehicle. This problem was then re-examined to determine the effectiveness of genetic algorithms on fine tuning the controller. This paper explains the problems associated with the design of this fuzzy controller and offers a technique for tuning fuzzy logic controllers. A fuzzy logic controller is a rule-based system that uses fuzzy linguistic variables to model human rule-of-thumb approaches to control actions within a given system. This 'fuzzy expert system' features rules that direct the decision process and membership functions that convert the linguistic variables into the precise numeric values used for system control. Defining the fuzzy membership functions is the most time consuming aspect of the controller design. One single change in the membership functions could significantly alter the performance of the controller. This membership function definition can be accomplished by using a trial and error technique to alter the membership functions creating a highly tuned controller. This approach can be time consuming and requires a great deal of knowledge from human experts. In order to shorten development time, an iterative procedure for altering the membership functions to create a tuned set that used a minimal amount of fuel for velocity vector approach and station-keep maneuvers was developed. Genetic algorithms, search techniques used for optimization, were utilized to solve this problem.

Shehadeh, Hana↗