Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 739 records · Page 41

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↗

Greedy Sampling and Incremental Surrogate Model-Based Tailoring of Aeroservoelastic Model Database for Flexible Aircraft

This paper presents a data analysis and modeling framework to tailor and develop linear parameter-varying (LPV) aeroservoelastic (ASE) model database for flexible aircrafts in broad 2D flight parameter space. The Kriging surrogate model is constructed using ASE models at a fraction of grid points within the original model database, and then the ASE model at any flight condition can be obtained simply through surrogate model interpolation. The greedy sampling algorithm is developed to select the next sample point that carries the worst relative error between the surrogate model prediction and the benchmark model in the frequency domain among all input-output channels. The process is iterated to incrementally improve surrogate model accuracy till a pre-determined tolerance or iteration budget is met. The methodology is applied to the ASE model database of a flexible aircraft currently being tested at NASA/AFRC for flutter suppression and gust load alleviation. Our studies indicate that the proposed method can reduce the number of models in the original database by 67%. Even so the ASE models obtained through Kriging interpolation match the model in the original database constructed directly from the physics-based tool with the worst relative error far below 1%. The interpolated ASE model exhibits continuously-varying gains along a set of prescribed flight conditions. More importantly, the selected grid points are distributed non-uniformly in the parameter space, a) capturing the distinctly different dynamic behavior and its dependence on flight parameters, and b) reiterating the need and utility for adaptive space sampling techniques for ASE model database compaction. The present framework is directly extendible to high-dimensional flight parameter space, and can be used to guide the ASE model development, model order reduction, robust control synthesis and novel vehicle design of flexible aircraft.

numerical analysi↗

Analysis and Application of Novel and Heritage Acceleration Limiting Algorithms for SLS on Ascent

National Aeronautics and Space Administration (NASA) is currently building the Space Launch System (SLS) Block-1 launch vehicle, to be used as the crewed heavy-lift vehicle for the Artemis series of missions. The SLS Block-1 guidance subsystem utilizes a nonlinear algorithm derived from Shuttle heritage for limiting the vehicle’s induced maximum axial acceleration during ascent flight, known as g-limiting. Even though g-limiting has demonstrated stability and robustness through several design analysis cycles and the extensive Shuttle flight history, there are no available documents that demonstrate that this algorithm has been proven stable through conventional controls stability analysis. This paper highlights the non-linear nature of g-limit, presents an alternative methodology to employ a linear version of this algorithm, performs assessment of selected linear gains using classical stability analysis and, conducts a comparison of both approaches through Six Degrees-of-Freedom (6-DOF) Monte Carlo (MC) simulations.

Jason Everett↗

Satellite-To-Satellite Imaging in Support of LEO Optical Navigation, Using the ASTERIA Cubesat

The Arcsecond Space Telescope Enabling Research in Astrophysics (ASTERIA) was a 6-unit CubeSat technology demonstration mission that was built at NASA’s Jet Propulsion Laboratory (JPL) and deployed from the International Space Station (ISS) on November 20th, 2017. After successfully completing its 90-day primary mission that demonstrated arcsecond-level line-of-sight pointing and focal plane thermal stability for exoplanet detection, it entered an extended mission performing onboard software demonstrations alongside science until end of mission in December 2019. At the end of its lifetime it was being used as a demonstration platform for several experiments, including low earth orbit (LEO) optical navigation operations. With its visible light astrometric camera and stable attitude control system, the ASTERIA spacecraft showed itself to be a capable platform for the imaging of geosynchronous satellites from LEO. This paper will describe the imagery attained in flight and also the image processing algorithms that were developed to render that imagery into navigation quality data. These algorithms dealt with hot pixel filtering, noise modeling, attitude registration, star signal rejection and satellite signal identification. Brightness prediction algorithms used for target selection will also be discussed.

Fesq, Lorraine↗

Local Scale (3-M) Soil Moisture Mapping Using SMAP and Planet Superdove

A capability for mapping meter-level resolution soil moisture with frequent temporal sampling over large regions is essential for quantifying local-scale environmental heterogeneity and eco-hydrologic behavior. However, available surface soil moisture (SSM) products generally involve much coarser grain sizes ranging from 30 m to several 10s of kilometers. Hence a new method is proposed to estimate 3-m resolution SSM using a combination of multi-sensor fusion, machine- learning (ML) and Cumulative Distribution Function (CDF) matching approaches. This method established favorable SSM correspondence between 3-m pixels and overlying 9-km grid cells from overlapping Planet SuperDove (PSD) observations and NASA Soil Moisture Active-Passive (SMAP) mission products. The resulting 3-m SSM predictions showed improved accuracy by reducing ab- solute bias and RMSE by ~0.01 cm3/cm3 over the original SMAP data in relation to in-situ soil moisture measurements for the Australian Yanco region, while preserving the high sampling frequency (1-3 day global revisit) and sensitivity to surface wetness (R 0.865) from SMAP. Heterogeneous soil moisture distributions varying with vegetation biomass gradients and irrigation regimes were generally captured within a selected study area. Further algorithm refinement and implementation for regional applications will allow for improvement in water resources management, precision agriculture, and disaster forecasts and responses.

soil moisture↗

Full-Spectrum-Analysis Isotope ID

FSAIsotopeID analyzes gamma ray spectra to identify radioactive isotopes (radionuclides). The algorithm fits the entire spectrum with combinations of pre-computed templates for a comprehensive set of radionuclides with varying thicknesses and compositions of shielding materials. The isotope identification algorithm is suitable for the analysis of spectra collected by gamma-ray sensors ranging from medium-resolution detectors, such a NaI, to high-resolution detectors, such as HPGe. In addition to analyzing static measurements, the isotope identification algorithm is applied for the radiation search applications. The search subroutine maintains a running background spectrum that is passed to the isotope identification algorithm, and it also selects temporal integration periods that optimize the responsiveness and sensitivity. Gain stabilization is supported for both types of applications.

Mitchell, Dean J.↗

Dark Energy Survey Year 1 Results: Cross-Correlation Redshifts in the DES -- Calibration of the Weak Lensing Source Redshift Distributions

We present the calibration of the Dark Energy Survey Year 1 (DES Y1) weak lensing source galaxy redshift distributions from clustering measurements. By cross-correlating the positions of source galaxies with luminous red galaxies selected by the redMaGiC algorithm we measure the redshift distributions of the source galaxies as placed into different tomographic bins. These measurements constrain any such shifts to an accuracy of $\sim0.02$ and can be computed even when the clustering measurements do not span the full redshift range. The highest-redshift source bin is not constrained by the clustering measurements because of the minimal redshift overlap with the redMaGiC galaxies. We compare our constraints with those obtained from $\texttt{COSMOS}$ 30-band photometry and find that our two very different methods produce consistent constraints.

79 ASTRONOMY AND ASTROPHYSICS↗

Apprentice for Event Generator Tuning

Apprentice is a tool developed for event generator tuning. It contains a range of conceptual improvements and extensions over the tuning tool Professor. Its core functionality remains the construction of a multivariate analytic surrogate model to computationally expensive Monte-Carlo event generator predictions. The surrogate model is used for numerical optimization in chi-square minimization and likelihood evaluation. Apprentice also introduces algorithms to automate the selection of observable weights to minimize the effect of mis-modeling in the event generators. We illustrate our improvements for the task of MC-generator tuning and limit setting.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Classification based anomaly detection

An example device includes processing circuitry and a memory. The memory includes instructions that cause the device to perform various functions. The functions include receiving datastreams from a plurality of sensors of a high performance computing system, classifying each datastream of the each sensor to one of a plurality of datastream models, selecting an anomaly detection algorithm from a plurality of anomaly detection algorithms for each datastream, determining parameters of the each anomaly detection algorithm, determining an anomaly threshold for each datastream, and generating an indication that the sensor associated with the datastream is acting anomalously.

Serebryakov, Sergey↗

Modern Approaches to Exact Diagonalization and Selected Configuration Interaction with the Adaptive Sampling CI Method

Recent advances in selected configuration interaction methods have made them competitive with the most accurate techniques available and, hence, creating an increasingly powerful tool for solving quantum Hamiltonians. In this work, we build on recent advances from the adaptive sampling configuration interaction (ASCI) algorithm. We show that a useful paradigm for generating efficient selected CI/exact diagonalization algorithms is driven by fast sorting algorithms, much in the same way iterative diagonalization is based on the paradigm of matrix vector multiplication. We present several new algorithms for all parts of performing a selected CI, which includes new ASCI search, dynamic bit masking, fast orbital rotations, fast diagonal matrix elements, and residue arrays. The ASCI search algorithm can be used in several different modes, which includes an integral driven search and a coefficient driven search. The algorithms presented here are fast and scalable, and we find that because they are built on fast sorting algorithms they are more efficient than all other approaches we considered. After introducing these techniques, we present ASCI results applied to a large range of systems and basis sets to demonstrate the types of simulations that can be practically treated at the full-CI level with modern methods and hardware, presenting double- and triple-ζ benchmark data for the G1 data set. The largest of these calculations is Si$_2$H$_6$ which is a simulation of 34 electrons in 152 orbitals. We also present some preliminary results for fast deterministic perturbation theory simulations that use hash functions to maintain high efficiency for treating large basis sets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Inelastic transient dynamic analysis of three-dimensional problems by BEM

A general direct boundary element formulation and its numerical implementation for solving transient dynamic problems of three-dimensional isotropic homogeneous or piecewise homogeneous solids involving material nonlinearities are presented. The algorithm produces accurate results for static nonlinear problems by using large time steps. When a large value of yield stress is selected, the incremental inelastic transient algorithm produces results identical to those obtained by elastodynamic analysis.

Ahmad, S.↗