Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm selection”

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 523 records · Page 29

Hierarchical Modeling to Enhance Spectrophotometry Measurements—Overcoming Dynamic Range Limitations for Remote Monitoring of Neptunium

A robust hierarchical model has been demonstrated for monitoring a wide range of neptunium concentrations (0.75–890 mM) and varying temperatures (10–80 °C) using chemometrics and feature selection. The visible–near infrared electronic absorption spectrum (400–1700 nm) of monocharged neptunyl dioxocation (Np(V) = NpO2+) includes many bands, which have molar absorption coefficients that differ by nearly 2 orders of magnitude. The shape, position, and intensity of these bands differ with chemical interactions and changing temperature. These challenges make traditional quantification by univariate methods unfeasible. Measuring Np(V) concentration over several orders of magnitude would typically necessitate cells with varying path length, optical switches, and/or multiple spectrophotometers. Alternatively, the differences in the molar extinction coefficients for multiple absorption bands can be used to quantify Np(V) concentration over 3 orders of magnitude with a single optical path length (1 mm) and a hierarchical multivariate model. In this work, principal component analysis was used to distinguish the concentration regime of the sample, directing it to the relevant partial least squares regression submodels. Each submodel was optimized with unique feature selection filters that were selected by a genetic algorithm to enhance predictions. Through this approach, the percent root mean square error of prediction values were ≤1.05% for Np(V) concentrations and ≤4% for temperatures. This approach may be applied to other nuclear fuel cycle and environmental applications requiring real-time spectroscopic measurements over a wide range of conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Measuring Young Stars in Space and Time. I. The Photometric Catalog and Extinction Properties of N44

In order to better understand the role of high-mass stellar feedback in regulating star formation in giant molecular clouds, we carried out a Hubble Space Telescope (HST) Treasury Program Measuring Young Stars in Space and Time (MYSST) targeting the star-forming complex N44 in the Large Magellanic Cloud (LMC). Using the F555W and F814W broadband filters of both the ACS and WFC3/UVIS, we built a photometric catalog of 461,684 stars down to m {sub F555W} ≃ 29 mag and m {sub F814W} ≃ 28 mag, corresponding to the magnitude of an unreddened 1 Myr pre-main-sequence star of ≈ 0.09 M {sub ☉} at the LMC distance. In this first paper we describe the observing strategy of MYSST and the data reduction procedure and present the photometric catalog. We identify multiple young stellar populations tracing the gaseous rim of N44's superbubble, together with various contaminants belonging to the LMC field population. We also determine the reddening properties from the slope of the elongated red clump (RC) feature by applying the machine-learning algorithm RANSAC, and we select a set of upper-main-sequence stars as primary probes to build an extinction map, deriving a relatively modest median extinction A {sub F555W} ≃ 0.77 mag. The same procedure applied to the RC provides A {sub F555W} ≃ 0.68 mag.

47 OTHER INSTRUMENTATION↗

Consideration of computer limitations in implementing on-line controls

A formal statement of the optimal control problem which includes the interval of dicretization as an optimization parameter, and extend this to include selection of a control algorithm as part of the optimization procedure, is formulated. The performance of the scalar linear system depends on the discretization interval. Discrete-time versions of the output feedback regulator and an optimal compensator, and the use of these results in presenting an example of a system for which fast partial-state-feedback control better minimizes a quadratic cost than either a full-state feedback control or a compensator, are developed.

Roberts, G. K.↗

Continued research on selected parameters to minimize community annoyance from airplane noise

Results from continued research on selected parameters to minimize community annoyance from airport noise are reported. First, a review of the initial work on this problem is presented. Then the research focus is expanded by considering multiobjective optimization approaches for this problem. A multiobjective optimization algorithm review from the open literature is presented. This is followed by the multiobjective mathematical formulation for the problem of interest. A discussion of the appropriate solution algorithm for the multiobjective formulation is conducted. Alternate formulations and associated solution algorithms are discussed and evaluated for this airport noise problem. Selected solution algorithms that have been implemented are then used to produce computational results for example airports. These computations involved finding the optimal operating scenario for a moderate size airport and a series of sensitivity analyses for a smaller example airport.

Frair, L.↗

Structural dynamic analysis on a parallel computer - The finite element machine

Recent and prospective advances in parallel multiple introduction multiple data (MIMD) computers offer significant improvements in the range of structural problems that can be solved, as well as the speed of solutions. These improvements have their basis in the effective selection and implementation of algorithms exploiting parallel computation. Attention is presently given to the solution of the transient response calculations of an experimental MIMD computer designated the 'Finite Element Machine', including its algorithm and its results for representative one- and two-dimensional dynamic response test problems. A factor of 6.5 is noted for the computational speed improvement.

Storaasli, O.↗

Real time identification of large space structures

Identification of frequencies, damping ratios, and mode shapes of large space structures (LSSs) are examined in real time. Real time processing allows for quick updates of model processing after a reconfiguration of structural failure. Recursive lattice least squares (RLLS) was selected as the baseline algorithm for the identification. Simulation results on a one dimensional LSS demonstrated that it provides good estimates, was not ill-conditioned in the presence of under-excited modes, allowed activity by a supervisory control system which prevented damage to the LSS or excessive drift, and was capable of real-time processing for typical LSS models. A suboptimal version of RLLS, which is equivalent to simulated parallel processing, was derived. A NASTRAN model of the dual keel U.S. space station was used to demonstrate the input/identification algorithm package in a more realistic simulation. Because the first eight flexible modes were very close together, the identification was much more difficult than in the simple examples. Even so, the model was accurately identified in real time.

Voss, Janice E.↗

Automatically reconfigurable control for rapid retargeting of flexible pointing systems

A reconfigurable nonlinear control system design methodology is proposed to automatically correct computed slew torque commands of space-based pointing systems for the effects of slew-induced structural deformations. The possibility of forcing an elastic structure, such as that of a space-based instrument frame, to deform in a preselected way in response to rapid slews is demonstrated. To accomplish this, a supervisory controller must select a pair of algorithms, one for structural counterexcitation and the other for slew torque correction. It is shown how the reachability and subsequent tracking of the appropriate 'slow manifold', where the control algorithms are valid, can be ensured by a fast tracking loop, with time-varying gain dependent only on the commanded angular acceleration.

Dwyer, Thomas A. W., III↗

Neuromorphic learning of continuous-valued mappings from noise-corrupted data

The effect of noise on the learning performance of the backpropagation algorithm is analyzed. A selective sampling of the training set is proposed to maximize the learning of control laws by backpropagation, when the data have been corrupted by noise. The training scheme is applied to the nonlinear control of a cart-pole system in the presence of noise. The neural computation provides the neurocontroller with good noise-filtering properties. In the presence of plant noise, the neurocontroller is found to be more stable than the teacher. A novel perspective on the application of neural network technology to control engineering is presented.

Troudet, T.↗

Ceramic component reliability with the restructured NASA/CARES computer program

The Ceramics Analysis and Reliability Evaluation of Structures (CARES) integrated design program on statistical fast fracture reliability and monolithic ceramic components is enhanced to include the use of a neutral data base, two-dimensional modeling, and variable problem size. The data base allows for the efficient transfer of element stresses, temperatures, and volumes/areas from the finite element output to the reliability analysis program. Elements are divided to insure a direct correspondence between the subelements and the Gaussian integration points. Two-dimensional modeling is accomplished by assessing the volume flaw reliability with shell elements. To demonstrate the improvements in the algorithm, example problems are selected from a round-robin conducted by WELFEP (WEakest Link failure probability prediction by Finite Element Postprocessors).

Powers, Lynn M.↗

Multi-agent planning and scheduling, execution monitoring and incremental rescheduling: Application to motorway traffic

This article describes a planning method applicable to agents with great perception and decision-making capabilities and the ability to communicate with other agents. Each agent has a task to fulfill allowing for the actions of other agents in its vicinity. Certain simultaneous actions may cause conflicts because they require the same resource. The agent plans each of its actions and simultaneously transmits these to its neighbors. In a similar way, it receives plans from the other agents and must take account of these plans. The planning method allows us to build a distributed scheduling system. Here, these agents are robot vehicles on a highway communicating by radio. In this environment, conflicts between agents concern the allocation of space in time and are connected with the inertia of the vehicles. Each vehicle made a temporal, spatial, and situated reasoning in order to drive without collision. The flexibility and reactivity of the method presented here allows the agent to generate its plan based on assumptions concerning the other agents and then check these assumptions progressively as plans are received from the other agents. A multi-agent execution monitoring of these plans can be done, using data generated during planning and the multi-agent decision-making algorithm described here. A selective backtrack allows us to perform incremental rescheduling.

Mourou, Pascal↗

Ceramic component reliability with the restructured NASA/CARES computer program

The Ceramics Analysis and Reliability Evaluation of Structures (CARES) integrated design program on statistical fast fracture reliability and monolithic ceramic components is enhanced to include the use of a neutral data base, two-dimensional modeling, and variable problem size. The data base allows for the efficient transfer of element stresses, temperatures, and volumes/areas from the finite element output to the reliability analysis program. Elements are divided to insure a direct correspondence between the subelements and the Gaussian integration points. Two-dimensional modeling is accomplished by assessing the volume flaw reliability with shell elements. To demonstrate the improvements in the algorithm, example problems are selected from a round-robin conducted by WELFEP (WEakest Link failure probability prediction by Finite Element Postprocessors).

Powers, Lynn M.↗

Spacecraft attitude determination accuracy from mission experience

This paper summarizes a compilation of attitude determination accuracies attained by a number of satellites supported by the Goddard Space Flight Center Flight Dynamics Facility. The compilation is designed to assist future mission planners in choosing and placing attitude hardware and selecting the attitude determination algorithms needed to achieve given accuracy requirements. The major goal of the compilation is to indicate realistic accuracies achievable using a given sensor complement based on mission experience. It is expected that the use of actual spacecraft experience will make the study especially useful for mission design. A general description of factors influencing spacecraft attitude accuracy is presented. These factors include determination algorithms, inertial reference unit characteristics, and error sources that can affect measurement accuracy. Possible techniques for mitigating errors are also included. Brief mission descriptions are presented with the attitude accuracies attained, grouped by the sensor pairs used in attitude determination. The accuracies for inactive missions represent a compendium of missions report results, and those for active missions represent measurements of attitude residuals. Both three-axis and spin stabilized missions are included. Special emphasis is given to high-accuracy sensor pairs, such as two fixed-head star trackers (FHST's) and fine Sun sensor plus FHST. Brief descriptions of sensor design and mode of operation are included. Also included are brief mission descriptions and plots summarizing the attitude accuracy attained using various sensor complements.

Brasoveanu, D.↗

The development of lossless data compression technology for remote sensing applications

Lossless data compression has been studied for many NASA missions to achieve the benefit of increased science return, reduced onboard memory requirement, station contact time and communication bandwidth. This paper first addresses the requirement for onboard applications and provides rational for the selection of the Rice algorithm among other available techniques. A top-level description of the Rice algorithm will be given, along with some new capabilities already implemented in both software and hardware VLSI forms. The paper then addresses systems issues important for onboard implementation including sensor calibration, error propagation and data packetization. The latter part of the paper provides several case study examples drawn from a broad spectrum of science instruments including the thematic mapper, x-ray telescope, gamma-ray spectrometer, and acousto-optical spectrometer.

Yeh, Pen-Shu↗

Scheduling Software for Complex Scenarios

Preparing a vehicle and its payload for a single launch is a complex process that involves thousands of operations. Because the equipment and facilities required to carry out these operations are extremely expensive and limited in number, optimal assignment and efficient use are critically important. Overlapping missions that compete for the same resources, ground rules, safety requirements, and the unique needs of processing vehicles and payloads destined for space impose numerous constraints that, when combined, require advanced scheduling. Traditional scheduling systems use simple algorithms and criteria when selecting activities and assigning resources and times to each activity. Schedules generated by these simple decision rules are, however, frequently far from optimal. To resolve mission-critical scheduling issues and predict possible problem areas, NASA historically relied upon expert human schedulers who used their judgment and experience to determine where things should happen, whether they will happen on time, and whether the requested resources are truly necessary.

Source record↗

Discrete Data Transfer Technique for Fluid-Structure Interaction

This paper presents a general three-dimensional algorithm for data transfer between dissimilar meshes. The algorithm is suitable for applications of fluid-structure interaction and other high-fidelity multidisciplinary analysis and optimization. Because the algorithm is independent of the mesh topology, we can treat structured and unstructured meshes in the same manner. The algorithm is fast and accurate for transfer of scalar or vector fields between dissimilar surface meshes. The algorithm is also applicable for the integration of a scalar field (e.g., coefficients of pressure) on one mesh and injection of the resulting vectors (e.g., force vectors) onto another mesh. The author has implemented the algorithm in a C++ computer code. This paper contains a complete formulation of the algorithm with a few selected results.

Samareh, Jamshid A.↗

NASA Global Precipitation Mission Ground Validation Implementation

The Global Precipitation Mission (GPM; core-satellite launch 2013) will provide Ka/Ku-band dual-frequency precipitation radar (DPR) and accompanying passive microwave radiometer-diagnosed precipitation estimates over a latitude range of 65 N to 65 S. The extended latitudinal domain of GPM coverage combined with requirements to detect (and in the case of liquid, estimate) liquid and frozen precipitation rates for values ranging from several hundred to just a few tenths of a millimeter per hour present new challenges to the development of physically-based satellite precipitation retrieval algorithms. On regional scales select national and international resources such as existing calibrated radar and rain gauge networks can provide basic datasets that enable direct statistical validation of GPM core-satellite reflectivitys and core/constellation rain rate measurements. Near-term planned field campaign involvements include Finland/Baltic Sea (fall 2010; joint CloudSat,GPM, and European study of precipitation in low-altitude melting layers and snowfall in the vicinity of the Helsinki testbed), central Oklahoma (spring 2011; joint with DOE ARM- precipitation retrievals over a mid-latitude continental land surface), and the Great Lakes region (winter 2011-12, snowfall retrieval).

Petersen, Walter A.↗

Rapid Calculation of Spacecraft Trajectories Using Efficient Taylor Series Integration

A variable-order, variable-step Taylor series integration algorithm was implemented in NASA Glenn's SNAP (Spacecraft N-body Analysis Program) code. SNAP is a high-fidelity trajectory propagation program that can propagate the trajectory of a spacecraft about virtually any body in the solar system. The Taylor series algorithm's very high order accuracy and excellent stability properties lead to large reductions in computer time relative to the code's existing 8th order Runge-Kutta scheme. Head-to-head comparison on near-Earth, lunar, Mars, and Europa missions showed that Taylor series integration is 15.8 times faster than Runge- Kutta on average, and is more accurate. These speedups were obtained for calculations involving central body, other body, thrust, and drag forces. Similar speedups have been obtained for calculations that include J2 spherical harmonic for central body gravitation. The algorithm includes a step size selection method that directly calculates the step size and never requires a repeat step. High-order Taylor series integration algorithms have been shown to provide major reductions in computer time over conventional integration methods in numerous scientific applications. The objective here was to directly implement Taylor series integration in an existing trajectory analysis code and demonstrate that large reductions in computer time (order of magnitude) could be achieved while simultaneously maintaining high accuracy. This software greatly accelerates the calculation of spacecraft trajectories. At each time level, the spacecraft position, velocity, and mass are expanded in a high-order Taylor series whose coefficients are obtained through efficient differentiation arithmetic. This makes it possible to take very large time steps at minimal cost, resulting in large savings in computer time. The Taylor series algorithm is implemented primarily through three subroutines: (1) a driver routine that automatically introduces auxiliary variables and sets up initial conditions and integrates; (2) a routine that calculates system reduced derivatives using recurrence relations for quotients and products; and (3) a routine that determines the step size and sums the series. The order of accuracy used in a trajectory calculation is arbitrary and can be set by the user. The algorithm directly calculates the motion of other planetary bodies and does not require ephemeris files (except to start the calculation). The code also runs with Taylor series and Runge-Kutta used interchangeably for different phases of a mission.

Scott, James R.↗

Quantifying Traversability of Terrain for a Mobile Robot

A document presents an updated discussion on a method of autonomous navigation for a robotic vehicle navigating across rough terrain. The method involves, among other things, the use of a measure of traversability, denoted the fuzzy traversability index, which embodies the information about the slope and roughness of terrain obtained from analysis of images acquired by cameras mounted on the robot. The improvements presented in the report focus on the use of the fuzzy traversability index to generate a traversability map and a grid map for planning the safest path for the robot. Once grid traversability values have been computed, they are utilized for rejecting unsafe path segments and for computing a traversalcost function for ranking candidate paths, selected by a search algorithm, from a specified initial position to a specified final position. The output of the algorithm is a set of waypoints designating a path having a minimal-traversal cost.

Howard, Ayanna↗