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 703 records · Page 39

Landsat Ecosystem Disturbance Adaptive Processing System (LEDAPS)

The Landsat Ecosystem Disturbance Adaptive Processing System (LEDAPS) project is creating a record of forest disturbance and regrowth for North America from the Landsat satellite record, in support of the carbon modeling activities. LEDAPS relies on the decadal Landsat GeoCover data set supplemented by dense image time series for selected locations. Imagery is first atmospherically corrected to surface reflectance, and then change detection algorithms are used to extract disturbance area, type, and frequency. Reuse of the MODIS Land processing system (MODAPS) architecture allows rapid throughput of over 2200 MSS, TM, and ETM+ scenes. Initial ("Beta") surface reflectance products are currently available for testing, and initial continental disturbance products will be available by the middle of 2006.

Masek, Jeffrey G.↗

Efficient Spectral Endmember Detection Onboard the EO-1 Spacecraft

Spaceflight and planetary exploration place severe constraints on the available bandwidth for downlinking large hyperspectral images. In addition, communications with spacecraft often occur intermittently, so mission-relevant hyperspectral data must wait for analysis on the ground before it can inform spacecraft activity planning. Onboard endmember detection can help alleviate these problems. It enables novelty detection and target identification for scheduling follow-up activities such as additional observation by narrow field of view instruments. Additionally, endmember analysis can facilitate data summary for downlink. This work describes a planned experiment of selective downlink by the EO-1 autonomous spacecraft. Here an efficient superpixel endmember detection algorithm keeps to the limited computational constraints of the flight processor. Tests suggest the procedure could enable significant improvements in downlink efficiency.

Endmember Detection↗

Investigation of Spiral Bevel Gear Condition Indicator Validation via AC-29-2C Combining Test Rig Damage Progression Data with Fielded Rotorcraft Data

This is the final of three reports published on the results of this project. In the first report, results were presented on nineteen tests performed in the NASA Glenn Spiral Bevel Gear Fatigue Test Rig on spiral bevel gear sets designed to simulate helicopter fielded failures. In the second report, fielded helicopter HUMS data from forty helicopters were processed with the same techniques that were applied to spiral bevel rig test data. Twenty of the forty helicopters experienced damage to the spiral bevel gears, while the other twenty helicopters had no known anomalies within the time frame of the datasets. In this report, results from the rig and helicopter data analysis will be compared for differences and similarities in condition indicator (CI) response. Observations and findings using sub-scale rig failure progression tests to validate helicopter gear condition indicators will be presented. In the helicopter, gear health monitoring data was measured when damage occurred and after the gear sets were replaced at two helicopter regimes. For the helicopters or tails, data was taken in the flat pitch ground 101 rotor speed (FPG101) regime. For nine tails, data was also taken at 120 knots true airspeed (120KTA) regime. In the test rig, gear sets were tested until damage initiated and progressed while gear health monitoring data and operational parameters were measured and tooth damage progression documented. For the rig tests, the gear speed was maintained at 3500RPM, a one hour run-in was performed at 4000 in-lb gear torque, than the torque was increased to 8000 in-lbs. The HUMS gear condition indicator data evaluated included Figure of Merit 4 (FM4), Root Mean Square (RMS) or Diagnostic Algorithm 1(DA1), + 3 Sideband Index (SI3) and + 1 Sideband Index (SI1). These were selected based on their sensitivity in detecting contact fatigue damage modes from analytical, experimental and historical helicopter data. For this report, the helicopter dataset was reduced to fourteen tails and the test rig data set was reduced to eight tested gear sets. The damage modes compared were separated into three cases. For case one, both the gear and pinion showed signs of contact fatigue or scuffing damage. For case two, only the pinion showed signs of contact fatigue damage or scuffing. Case three was limited to the gear tests when scuffing occurred immediately after the gear run-in. Results of this investigation highlighted the importance of understanding the complete monitored systems, for both the helicopter and test rig, before interpreting health monitoring data. Further work is required to better define these two systems that include better state awareness of the fielded systems, new sensing technologies, new experimental methods or models that quantify the effect of system design on CI response and new methods for setting thresholds that take into consideration the variance of each system.

spiral bevel gears↗

Advancing Autonomy in Distributed Space Systems: Insights From on-Orbit Testing with the Starling 1.0 Mission

Autonomous decision-making is crucial for enhancing mission effectiveness in Distributed Space Systems (DSS), particularly in multi-spacecraft operations where communication constraints and mission complexity pose challenges. The Distributed Spacecraft Autonomy (DSA) team at NASA’s Ames Research Center is advancing autonomy in DSS through five key technical areas: distributed resource and task management, reactive operations, system modeling and simulation, human-swarm interaction, and ad hoc network communications. The DSA experiment onboard the Starling 1.0 Mission showcases collaborative resource allocation for multi-point science data collection with four small spacecraft. Autonomy in decision-making is highlighted as a crucial factor for multi-spacecraft missions, enabling spacecraft to operate independently, reducing reliance on ground control. This capability is particularly significant for future deep-space missions, where communication delays and limited data transmission capacity make traditional command and control approaches impractical. This demonstration focuses on a GPS Channel Selection Experiment, leveraging emergent capabilities like "shared sampling" and "simultaneous sampling" to optimize channel selection across the spacecraft swarm. The experiment aims to capture ionospheric phenomena such as the Equatorial Ionization Anomaly and Polar Patches. The DSA system's autonomous reconfiguration ability is showcased, emphasizing its adaptability to natural phenomena without significant integration efforts. The GPS Channel Selection Experiment utilizes a dual-band GPS receiver to estimate plasma density in the ionosphere. Explorative and exploitative channel selections are employed based on the nature of observed phenomena. The performance of DSA algorithms is evaluated in terms of optimal channel allocations and responsiveness to changes in observed features. The DSA Flight Software utilizes the Core Flight System (cFS) framework, ensuring compatibility with the Starling 1.0 flight mission software. DSA showcases results from RTI’s Connext DDS Micro communication middleware, enabling message routing over the Ad-Hoc Network of Starling 1.0. This paper provides a comprehensive overview of the DSA experiment's initial results, emphasizing the advancements in autonomy for Distributed Space Systems and the successful collaboration with the Starling 1.0 mission.

Caleb Ashmore Adams↗

SMOS/SMAP Synergy for SMAP Level 2 Soil Moisture Algorithm Evaluation

Soil Moisture Active Passive (SMAP) satellite has been proposed to provide global measurements of soil moisture and land freeze/thaw state at 10 km and 3 km resolutions, respectively. SMAP would also provide a radiometer-only soil moisture product at 40-km spatial resolution. This product and the supporting brightness temperature observations are common to both SMAP and European Space Agency's Soil Moisture and Ocean Salinity (SMOS) mission. As a result, there are opportunities for synergies between the two missions. These include exploiting the data for calibration and validation and establishing longer term L-band brightness temperature and derived soil moisture products. In this investigation we will be using SMOS brightness temperature, ancillary data, and soil moisture products to develop and evaluate a candidate SMAP L2 passive soil moisture retrieval algorithm. This work will begin with evaluations based on the SMOS product grids and ancillary data sets and transition to those that will be used by SMAP. An important step in this analysis is reprocessing the multiple incidence angle observations provided by SMOS to a global brightness temperature product that simulates the constant 40 degree incidence angle observations that SMAP will provide. The reprocessed brightness temperature data provide a basis for evaluating different SMAP algorithm alternatives. Several algorithms are being considered for the SMAP radiometer-only soil moisture retrieval. In this first phase, we utilized only the Single Channel Algorithm (SCA), which is based on the radiative transfer equation and uses the channel that is most sensitive to soil moisture (H-pol). Brightness temperature is corrected sequentially for the effects of temperature, vegetation, roughness (dynamic ancillary data sets) and soil texture (static ancillary data set). European Centre for Medium-Range Weather Forecasts (ECMWF) estimates of soil temperature for the top layer (as provided as part of the SMOS ancillary data) were used to correct for surface temperature effects and to derive microwave emissivity. ECMWF data were also used for precipitation forecasts, presence of snow, and frozen ground. Vegetation options are described below. One year of soil moisture observations from a set of four watersheds in the U.S. were used to evaluate four different retrieval methodologies: (1) SMOS soil moisture estimates (version 400), (2) SeA soil moisture estimates using the SMOS/SMAP data with SMOS estimated vegetation optical depth, which is part of the SMOS level 2 product, (3) SeA soil moisture estimates using the SMOS/SMAP data and the MODIS-based vegetation climatology data, and (4) SeA soil moisture estimates using the SMOS/SMAP data and actual MODIS observations. The use of SMOS real-world global microwave observations and the analyses described here will help in the development and selection of different land surface parameters and ancillary observations needed for the SMAP soil moisture algorithms. These investigations will greatly improve the quality and reliability of this SMAP product at launch.

Bindlish, Rajat↗

Algorithm for vertical ozone profile determination for the Nimbus-4 BUV data set

A description is provided of the algorithm used by the Ozone Processing Team at NASA to process seven years of Backscatter Ultraviolet (BUV) ozone profile data. The algorithm is a modification of the original retrieval algorithm developed by Mateer (1972) to process some of the early data from the BUV experiment. Principal changes made are in the first guess selection scheme, the use of all wavelengths in the inversion, and the weighting of the various wavelengths according to the errors in the radiance estimation. It is found that the described BUV ozone profile algorithm is an extremely efficient algorithm for retrieving large amounts of satellite data. The algorithm makes full use of all the available information from the measured radiances including the longer wavelength radiances which previously had not been used.

Bhartia, P. K.↗

Onboard Determination of Vehicle Glide Capability for Shuttle Abort Flight Managment (SAFM)

When one or more main engines fail during ascent, the flight crew of the Space Shuttle must make several critical decisions and accurately perform a series of abort procedures. One of the most important decisions for many aborts is the selection ofa landing site. Several factors influence the ability to reach a landing site, including the spacecraft point of atmospheric entry, the energy state at atmospheric entry, the vehicle glide capability from that energy state, and whether one or more suitable landing sites are within the glide capability. Energy assessment is further complicated by the fact that phugoid oscillations in total energy influence glide capability. Once the glide capability is known, the crew must select the "best" site option based upon glide capability and landing site conditions and facilities. Since most of these factors cannot currently be assessed by the crew in flight, extensive planning is required prior to each mission to script a variety of procedures based upon spacecraft velocity at the point of engine failure (or failures). The results of this preflight planning are expressed in tables and diagrams on mission-specific cockpit checklists. Crew checklist procedures involve leafing through several pages of instructions and navigating a decision tree for site selection and flight procedures - all during a time critical abort situation. With the advent of the Cockpit Avionics Upgrade (CAU), the Shuttle will have increased on-board computational power to help alleviate crew workload during aborts and provide valuable situational awareness during nominal operations. One application baselined for the CAU computers is Shuttle Abort Flight Management (SAFM), whose requirements have been designed and prototyped. The SAFM application includes powered and glided flight algorithms. This paper describes the glided flight algorithm which is dispatched by SAFM to determine the vehicle glide capability and make recommendations to the crew for site selection as well as to monitor glide capability while in route to the selected site. Background is provided on Shuttle entry guidance as well as the various types of Shuttle aborts. SAFM entry requirements and cockpit disp lays are discussed briefly to provide background for Glided Flight algorithm design considerations. The central principal of the Glided Flight algorithm is the use of energy-over-weight (EOW) curves to determine range and crossrange boundaries. The major challenges of this technique are exo-atmospheric flight, and phugoid oscillations in energy. During exo-atmospheric flight, energy is constant, so vehicle EOW is not sufficient to determine glide capability. The paper describes how the exo-atmospheric problem is solved by propagating the vehicle state to an "atmospheric pullout" state defined by Shuttle guidance parameters.

Straube, Timothy↗

Sparse Regression as a Sparse Eigenvalue Problem

We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

Exact Sparse Least Squares (ESLS)↗

Optimal Communication Topology Construction and Sensor Selection for Independent Airspace Surveillance

The paper presents an approach with no estimation feedback to sensors selection and communication network topology computation for independent airspace surveillance with maximum outcome and minimum cost using ground based distributed sensing, computing and communication network infrastructure. The selection criteria includes maximum airspace coverage with minimal resources, minimum communication time and power consumption while guaranteeing the system observability and providing in-time high quality information to both stationary and mobile users. The developed algorithms use multi-objective optimization strategy taking into account trade-offs between conflicting objectives and are implemented using off-the-shelf computational tools. The algorithms are validated in a desktop simulation environment using synthetic sensors data generated for a simulated multi-vehicle flight scenario in the selected regional airspace and parameters of a notional wireless communication network.

Distributed sensing↗

Voxel Based Three-Dimensional Topology Optimization of Heat Exchanger Fins

Increasing interest in novel aircraft propulsion systems and potential for unwanted heat generation, or capture and reuse of waste heat, may require increasingly lightweight and high performing heat exchangers. Advances in manufacturing technologies have shown potential to create complex designs, but design tools need more flexibility. This study utilizes genetic algorithm-driven topology optimization to develop high performance heat exchanger fins for critical applications such as aerospace. The solid domain is generated using voxel representation where a voxel value of 1 indicates the solid domain and a voxel value of 0 refers to the fluid domain. The use of voxel representation somewhat matches the digitization of a model that is required to fabricate using additive manufacturing, and also allows for a highly unconstrained geometry. To test the topology optimization approach, a three-dimensional(3D)baseline offset strip fin geometry in steady laminar flow(Reynolds number = 215)with conjugate heat transfer(simultaneous solution of solid and fluid temperature fields)is optimized. New designs are generated using the genetic algorithm (GA) and sent to evaluation by the CFD software OpenFOAM; then the GA sorts and selects the reproduction pool for the following generation. This process is repeated for 60 generations. The study also investigates the effect off in material on the performance of the GA and the resulting designs. The results show that the optimal designs have overall performance improvement of 18% relative to the baseline. Additionally, a fin constructed of a lower conductivity material (such as an Inconel super alloy that might be necessary for waste heat recovery applications)results in lower overall performance improvement (11%)and optimal designs with higher pressure drop relative to their baseline, and relative to optimal designs produced using higher conductivity materials.

3D Optimization↗

A Simple Algorithm for the Metric Traveling Salesman Problem

An algorithm was designed for a wire list net sort problem. A branch and bound algorithm for the metric traveling salesman problem is presented for this. The algorithm is a best bound first recursive descent where the bound is based on the triangle inequality. The bounded subsets are defined by the relative order of the first K of the N cities (i.e., a K city subtour). When K equals N, the bound is the length of the tour. The algorithm is implemented as a one page subroutine written in the C programming language for the VAX 11/750. Average execution times for randomly selected planar points using the Euclidean metric are 0.01, 0.05, 0.42, and 3.13 seconds for ten, fifteen, twenty, and twenty-five cities, respectively. Maximum execution times for a hundred cases are less than eleven times the averages. The speed of the algorithms is due to an initial ordering algorithm that is a N squared operation. The algorithm also solves the related problem where the tour does not return to the starting city and the starting and/or ending cities may be specified. It is possible to extend the algorithm to solve a nonsymmetric problem satisfying the triangle inequality.

Grimm, M. J.↗

Eigenvalue routines in NASTRAN: A comparison with the Block Lanczos method

The NASA STRuctural ANalysis (NASTRAN) program is one of the most extensively used engineering applications software in the world. It contains a wealth of matrix operations and numerical solution techniques, and they were used to construct efficient eigenvalue routines. The purpose of this paper is to examine the current eigenvalue routines in NASTRAN and to make efficiency comparisons with a more recent implementation of the Block Lanczos algorithm by Boeing Computer Services (BCS). This eigenvalue routine is now available in the BCS mathematics library as well as in several commercial versions of NASTRAN. In addition, CRAY maintains a modified version of this routine on their network. Several example problems, with a varying number of degrees of freedom, were selected primarily for efficiency bench-marking. Accuracy is not an issue, because they all gave comparable results. The Block Lanczos algorithm was found to be extremely efficient, in particular, for very large size problems.

Tischler, V. A.↗

Evaluation of Various Radar Data Quality Control Algorithms Based on Accumulated Radar Rainfall Statistics

The primary function of the TRMM Ground Validation (GV) Program is to create GV rainfall products that provide basic validation of satellite-derived precipitation measurements for select primary sites. A fundamental and extremely important step in creating high-quality GV products is radar data quality control. Quality control (QC) processing of TRMM GV radar data is based on some automated procedures, but the current QC algorithm is not fully operational and requires significant human interaction to assure satisfactory results. Moreover, the TRMM GV QC algorithm, even with continuous manual tuning, still can not completely remove all types of spurious echoes. In an attempt to improve the current operational radar data QC procedures of the TRMM GV effort, an intercomparison of several QC algorithms has been conducted. This presentation will demonstrate how various radar data QC algorithms affect accumulated radar rainfall products. In all, six different QC algorithms will be applied to two months of WSR-88D radar data from Melbourne, Florida. Daily, five-day, and monthly accumulated radar rainfall maps will be produced for each quality-controlled data set. The QC algorithms will be evaluated and compared based on their ability to remove spurious echoes without removing significant precipitation. Strengths and weaknesses of each algorithm will be assessed based on, their abilit to mitigate both erroneous additions and reductions in rainfall accumulation from spurious echo contamination and true precipitation removal, respectively. Contamination from individual spurious echo categories will be quantified to further diagnose the abilities of each radar QC algorithm. Finally, a cost-benefit analysis will be conducted to determine if a more automated QC algorithm is a viable alternative to the current, labor-intensive QC algorithm employed by TRMM GV.

Robinson, Michael↗

Using a Portfolio of Algorithms for Planning and Scheduling

The Automated Scheduling and Planning Environment (ASPEN) software system, aspects of which have been reported in several previous NASA Tech Briefs articles, includes a subsystem that utilizes a portfolio of heuristic algorithms that work synergistically to solve problems. The nature of the synergy of the specific algorithms is that their likelihoods of success are negatively correlated: that is, when a combination of them is used to solve a problem, the probability that at least one of them will succeed is greater than the sum of probabilities of success of the individual algorithms operating independently of each other. In ASPEN, the portfolio of algorithms is used in a planning process of the iterative repair type, in which conflicts are detected and addressed one at a time until either no conflicts exist or a user-defined time limit has been exceeded. At each choice point (e.g., selection of conflict; selection of method of resolution of conflict; or choice of move, addition, or deletion) ASPEN makes a stochastic choice of a combination of algorithms from the portfolio. This approach makes it possible for the search to escape from looping and from solutions that are locally but not globally optimum.

Sherwood, Robert↗

An Interoperability Consideration in Selecting Domain Parameters for Elliptic Curve Cryptography

Elliptic curve cryptography (ECC) will be an important technology for electronic privacy and authentication in the near future. There are many published specifications for elliptic curve cryptosystems, most of which contain detailed descriptions of the process for the selection of domain parameters. Selecting strong domain parameters ensures that the cryptosystem is robust to attacks. Due to a limitation in several published algorithms for doubling points on elliptic curves, some ECC implementations may produce incorrect, inconsistent, and incompatible results if domain parameters are not carefully chosen under a criterion that we describe. Few documents specify the addition or doubling of points in such a manner as to avoid this problematic situation. The safety criterion we present is not listed in any ECC specification we are aware of, although several other guidelines for domain selection are discussed in the literature. We provide a simple example of how a set of domain parameters not meeting this criterion can produce catastrophic results, and outline a simple means of testing curve parameters for interoperable safety over doubling.

Ivancic, Will↗

Computer coordination of limb motion for locomotion of a multiple-armed robot for space assembly

Consideration is given to a possible robotic system for the construction of large space structures, which may be described as a multiple general purpose arm manipulator vehicle that can walk over the structure under construction to a given site for further work. A description is presented of the locomotion of such a vehicle, modeling its arms in terms of a currently available industrial manipulator. It is noted that for whatever maximum speed of operation is chosen, rapid changes in robot velocity create situations in which already-selected handholds are no longer practical. A step is added to the 'free gait' walking algorithm in order to solve this problem.

Klein, C. A.↗

On the reliable and flexible solution of practical subset regression problems

A new algorithm for solving subset regression problems is described. The algorithm performs a QR decomposition with a new column-pivoting strategy, which permits subset selection directly from the originally defined regression parameters. This, in combination with a number of extensions of the new technique, makes the method a very flexible tool for analyzing subset regression problems in which the parameters have a physical meaning.

Verhaegen, M. H.↗

The Cyclone meteor radar system for routine wind measurements in the lower thermosphere

A new meteor wind radar system called Cyclone was devised to extend and update the meteor radar network and for unattended operation. The Cyclone meteor radar system obtains information from four directions simultaneously. To automate data processing a special digital device was developed. An algorithm used to determine the Doppler shifts was adopted, which makes it possible to eliminate selectivity with respect to slow velocity meteor drifts. The operation of the Cyclone system is described.

Lysenko, I. A.↗