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 973 records · Page 54

Development of a Two-Wheel Contingency Mode for the MAP Spacecraft

The Microwave Anisotropy Probe (MAP) is a follow-on mission to the Cosmic Background Explorer (COBE), and is currently collecting data from its orbit near the second Sun-Earth libration point. Due to limited mass, power, and financial resources, a traditional reliability concept including fully redundant components was not feasible for MAP. Instead, the MAP design employs selective hardware redundancy in tandem with contingency software modes and algorithms to improve the odds of mission success. One direction for such improvement has been the development of a two-wheel backup control strategy. This strategy would allow MAP to position itself for maneuvers and collect science data should one of its three reaction wheels fail. Along with operational considerations, the strategy includes three new control algorithms. These algorithms would use the remaining attitude control actuators-thrusters and two reaction wheels-in ways that achieve control goals while minimizing adverse impacts on the functionality of other subsystems and software.

Starin, Scott R.↗

Chirp Scaling Algorithms for SAR Processing

The chirp scaling SAR processing algorithm is both accurate and efficient. Successful implementation requires proper selection of the interval of output samples, which is a function of the chirp interval, signal sampling rate, and signal bandwidth. Analysis indicates that for both airborne and spaceborne SAR applications in the slant range domain a linear chirp scaling is sufficient. To perform nonlinear interpolation process such as to output ground range SAR images, one can use a nonlinear chirp scaling interpolator presented in this paper.

nonlinear chirp scaling.↗

Deep Impact Autonomous Navigation : the trials of targeting the unknown

On July 4, 2005 at 05:44:34.2 UTC the Impactor Spacecraft (s/c) impacted comet Tempel 1 with a relative speed of 10.3 km/s capturing high-resolution images of the surface of a cometary nucleus just seconds before impact. Meanwhile, the Flyby s/c captured the impact event using both the Medium Resolution Imager (MRI) and the High Resolution Imager (HRI) and tracked the nucleus for the entire 800 sec period between impact and shield attitude transition. The objective of the Impactor s/c was to impact in an illuminated area viewable from the Flyby s/c and capture high-resolution context images of the impact site. This was accomplished by using autonomous navigation (AutoNav) algorithms and precise attitude information from the attitude determination and control subsystem (ADCS). The Flyby s/c had two primary objectives: 1) capture the impact event with the highest temporal resolution possible in order to observe the ejecta plume expansion dynamics; and 2) track the impact site for at least 800 sec to observe the crater formation and capture the highest resolution images possible of the fully developed crater. These two objectives were met by estimating the Flyby s/c trajectory relative to Tempel 1 using the same AutoNav algorithms along with precise attitude information from ADCS and independently selecting the best impact site. This paper describes the AutoNav system, what happened during the encounter with Tempel 1 and what could have happened.

impactor spacecraft↗

Reconfigurable data path processor

A reconfigurable data path processor comprises a plurality of independent processing elements. Each of the processing elements advantageously comprising an identical architecture. Each processing element comprises a plurality of data processing means for generating a potential output. Each processor is also capable of through-putting an input as a potential output with little or no processing. Each processing element comprises a conditional multiplexer having a first conditional multiplexer input, a second conditional multiplexer input and a conditional multiplexer output. A first potential output value is transmitted to the first conditional multiplexer input, and a second potential output value is transmitted to the second conditional multiplexer output. The conditional multiplexer couples either the first conditional multiplexer input or the second conditional multiplexer input to the conditional multiplexer output, according to an output control command. The output control command is generated by processing a set of arithmetic status-bits through a logical mask. The conditional multiplexer output is coupled to a first processing element output. A first set of arithmetic bits are generated according to the processing of the first processable value. A second set of arithmetic bits may be generated from a second processing operation. The selection of the arithmetic status-bits is performed by an arithmetic-status bit multiplexer selects the desired set of arithmetic status bits from among the first and second set of arithmetic status bits. The conditional multiplexer evaluates the select arithmetic status bits according to logical mask defining an algorithm for evaluating the arithmetic status bits.

Donohoe, Gregory↗

Controllers for Battery Chargers and Battery Chargers Therefrom

A controller for a battery charger that includes a power converter has parametric sensors for providing a sensed Vin signal, a sensed Vout signal and a sensed Iout signal. A battery current regulator (BCR) is coupled to receive the sensed Iout signal and an Iout reference, and outputs a first duty cycle control signal. An input voltage regulator (IVR) receives the sensed Vin signal and a Vin reference. The IVR provides a second duty cycle control signal. A processor receives the sensed Iout signal and utilizes a Maximum Power Point Tracking (MPPT) algorithm, and provides the Vin reference to the IVR. A selection block forwards one of the first and second duty cycle control signals as a duty cycle control signal to the power converter. Dynamic switching between the first and second duty cycle control signals maximizes the power delivered to the battery.

Elmes, John↗

Driving an Active Vibration Balancer to Minimize Vibrations at the Fundamental and Harmonic Frequencies

Vibrations of a principal machine are reduced at the fundamental and harmonic frequencies by driving the drive motor of an active balancer with balancing signals at the fundamental and selected harmonics. Vibrations are sensed to provide a signal representing the mechanical vibrations. A balancing signal generator for the fundamental and for each selected harmonic processes the sensed vibration signal with adaptive filter algorithms of adaptive filters for each frequency to generate a balancing signal for each frequency. Reference inputs for each frequency are applied to the adaptive filter algorithms of each balancing signal generator at the frequency assigned to the generator. The harmonic balancing signals for all of the frequencies are summed and applied to drive the drive motor. The harmonic balancing signals drive the drive motor with a drive voltage component in opposition to the vibration at each frequency.

Holliday, Ezekiel S.↗

The Kepler Data Processing Handbook: A Field Guide to Prospecting for Habitable Worlds

The Kepler telescope hurtled into orbit in March 2009, initiating NASA's first mission to discover Earth-size planets orbiting Sun-like stars. Kepler simultaneously collected data for approximately 165,000 target stars at a time over its four-year mission, identifying over 4700 planet candidates, over 2300 confirmed or validated planets, and over 2100 eclipsing binaries. While Kepler was designed to discover exoplanets, the long-term, ultrahigh photometric precision measurements it achieved made it a premier observational facility for stellar astrophysics, especially in the field of asteroseismology, and for variable stars, such as RR Lyrae. The Kepler Science Operations Center (SOC) was developed at NASA Ames Research Center to process the data acquired by Kepler from pixel-level calibrations all the way to identifying transiting planet signatures and subjecting them to a suite of diagnostic tests to establish or break confidence in their planetary nature. Detecting small, rocky planets transiting Sun-like stars presents a variety of daunting challenges, including achieving an unprecedented photometric precision of ~20 ppm on 6.5-hour timescales, and supporting the science operations, management, processing, and repeated reprocessing of the accumulating data stream. A newly revised and expanded version of the Kepler Data Processing Handbook (KDPH) has been released to support the legacy archival products. The KDPH details the theory, design and performance of the algorithms supporting each data processing step. This paper presents an overview of the KDPH and features illustrations of several key algorithms in the Kepler Science Data Processing Pipeline. Kepler was selected as the 10th mission of the Discovery Program. Funding for this mission is provided by NASA, Science Mission Directorate.

high performance computing↗

Integrated Multi-Satellite Retrievals for GPM (IMERG)

The Integrated Multi-satellitE Retrievals for GPM (IMERG) product from the U.S. Science Team of the NASA-JAXA Global Precipitation Measurement (GPM) mission provides global satellite precipitation estimates for a wide range of scientific research and societal applications. By adopting a constellation approach using low-Earth orbit passive microwave and geosynchronous-orbit infrared observations from domestic and international partners, IMERG is able to achieve a high resolution of 0.1° every half-hour globally, with three Runs to cater to applications with different latency requirements. With the completion of the reprocessing of the latest version, IMERG V07 now provides improved global satellite precipitation estimates for a period of more than 20 years. This presentation summarizes background on retrievals, the IMERG algorithm, and access to the data. As well, it showcases select results from the data, which might give participants ideas about how they can analyze the data themselves. The presentation ends with a prospectus for the timeline for the upcoming Version 08 and provides a list of references.

IMERG↗

Improving Adhesive Bondline Time of Flight Predictions During Autoclave Cure Utilizing Machine Learning

Composite materials are increasingly being used in aerospace applications due to their superior strength-to-weight ratio compared to commonly used metals. A current limitation to widespread adoption is the certification of adhesively bonded joints. One approach to improving adhesive bonding in composites is accurately measuring the thickness of adhesive bondlines in composite laminates. Precise bondline thickness control is essential for aerospace applications where adhesive layer thickness directly affects joint fracture properties and structural performance. This study focused on implementing machine learning techniques to determine the ultrasonic time of flight (directly correlated to thickness) in adhesive bondlines throughout autoclave cure cycles. A high-temperature (use up to 180°C) ultrasonic scanning system was deployed in an autoclave to provide time of flight data through composite panels. Three experiments were conducted on the curing of 305 mm × 305 mm unidirectional composite panels. In the first experiment, a piecewise function was fit for the temperature correction factor to account for changing autoclave temperatures. Due to deficiencies in the first calibration experiment, a second experiment was run, and the results were used to train a machine learning model. The revised experiment, in combination with the machine learning model, significantly increased the accuracy of the bondline time of flight predictions (~14% error reduced to <1%). Data was processed using the Regression Learner Application in MATLAB®, with a Support Vector Machine selected for the model. The result was a machine learning algorithm capable of reliably quantifying ultrasonic time of flight through adhesive bondlines. The third experiment provided independent test data for the machine learning model, demonstrating that the model produces accurate predictions from data beyond its training set.

Machine Learning↗

Methods and systems for generating a continuous helical tool path for parts having multiple central axes

A computer-implemented method for generating a continuous helical tool path for forming a part having a plurality of central axes is provided. The method includes performing a tool path algorithm modeling and a tool path algorithm execution using a computer system. The tool path algorithm modeling includes defining a starting point location within a computer-generated three-dimensional part geometry model, defining a vector, defining a helix, defining a sweeping surface three-dimensional geometry element, and generating an intersection curve from tracing a continuous curved line of an intersection between the sweeping surface geometry element and the part geometry model. The tool path algorithm execution includes defining data for a forming tool stylus, selecting the intersection curve as a guiding element for the forming tool stylus, and generating the continuous helical tool path for the forming tool stylus. The continuous helical tool path includes a forming tool stylus centerline path in graphical space.

42 ENGINEERING↗

Deploying a Model Predictive Traffic Signal Control Algorithm - A Field Deployment Experiment Case Study: Preprint

This paper presents a field deployment experiment of a real-time traffic signal control algorithm. We implemented the Model Predictive Control (MPC) algorithm based on Virtual Phase-Link (VPL) model. We selected the deployment locations and times based on an energy saving potential concept. We developed a set of experiment systems to enable the deployment including sensing, processing, and actuating components. We tested the systems rigorously before the experiment days. We reported the key procedures on the experiment days including the steps took, real-time control procedure, and the monitoring of the experiment. We evaluated the impact of the deployment with the changes in delay and energy consumption.

deployment↗

Development of a computer algorithm for the analysis of variable-frequency AC drives: Case studies included

The development of computer software for performance prediction and analysis of voltage-fed, variable-frequency AC drives for space power applications is discussed. The AC drives discussed include the pulse width modulated inverter (PWMI), a six-step inverter and the pulse density modulated inverter (PDMI), each individually connected to a wound-rotor induction motor. Various d-q transformation models of the induction motor are incorporated for user-selection of the most applicable model for the intended purpose. Simulation results of selected AC drives correlate satisfactorily with published results. Future additions to the algorithm are indicated. These improvements should enhance the applicability of the computer program to the design and analysis of space power systems.

Kankam, M. David↗

Machine-learning Solution for Automatic Spacesuit Motion Recognition and Measurement from Conventional Video

Extravehicular Activity (EVA) spacesuits exhibit unique movement patterns due to their design characteristics. Mobility assessments using traditional motion capture systems are cost prohibitive and not feasible for some training conditions (e.g., simulated lunar outdoor terrain). This paper aims to present the ongoing development of machine learning solutions to quantify suit motions from conventional videos without special sensors or hardware. Preliminary work into this field was promising but given the fast growth in deep/machine learning technologies, external expertise was sought from open-source communities. Partnerships were formed with the NASA JSC Center of Excellence for Collaborative Innovation (CoCEI) and an execution crowdsourcing platform partner to solicit machine learning framework developments from external contenders. NASA provided contenders with images and video clips of spacesuits with simultaneously measured motion capture data during EVA simulation tasks. The contenders used this data to train and develop generalized algorithms to predict motions. At the end of the crowdsourcing event, the top five solutions were selected from 250 submissions. Each submission was tested and scored using video clips not previously disclosed to the contenders. The weighted scoring metrics measured how well the algorithm detected the suit shape, the 2D suit joint detection accuracy, and 3D joint detection accuracy. The winning solution was able to achieve roughly 85% prediction accuracy. Overall, the algorithms could efficiently detect various types of spacesuits and motions across different EVA environments such as the NASA Active Response Gravity Offload System (ARGOS). After continued improvements and validation, the fully developed system will enable EVA stakeholders to quantify suit kinematic patterns, which can help optimize suit, hardware, and task designs.

Linh Vu↗

Genetic algorithm based fuzzy control of spacecraft autonomous rendezvous

The U.S. Bureau of Mines is currently investigating ways to combine the control capabilities of fuzzy logic with the learning capabilities of genetic algorithms. Fuzzy logic allows for the uncertainty inherent in most control problems to be incorporated into conventional expert systems. Although fuzzy logic based expert systems have been used successfully for controlling a number of physical systems, the selection of acceptable fuzzy membership functions has generally been a subjective decision. High performance fuzzy membership functions for a fuzzy logic controller that manipulates a mathematical model simulating the autonomous rendezvous of spacecraft are learned using a genetic algorithm, a search technique based on the mechanics of natural genetics. The membership functions learned by the genetic algorithm provide for a more efficient fuzzy logic controller than membership functions selected by the authors for the rendezvous problem. Thus, genetic algorithms are potentially an effective and structured approach for learning fuzzy membership functions.

Karr, C. L.↗

A timeline algorithm for astronomy missions

An algorithm is presented for generating viewing timelines for orbital astronomy missions of the pointing (nonsurvey/scan) type. The algorithm establishes a target sequence from a list of candidate targets in a way which maximizes total viewing time. Two special cases are treated. One concerns dim targets which, due to lighting constraints, are scheduled only during the antipolar portion of each orbit. They normally require long observation times extending over several revolutions. A minimum slew heuristic is employed to select the sequence of dim targets. The other case deals with bright, or short duration, targets, which have less restrictive lighting constraints and are scheduled during the portion of each orbit when dim targets cannot be viewed. Since this process moves much more rapidly than the dim path, an enumeration algorithm is used to select the sequence that maximizes total viewing time.

Moore, J. E.↗

CREKID: A computer code for transient, gas-phase combustion of kinetics

A new algorithm was developed for fast, automatic integration of chemical kinetic rate equations describing homogeneous, gas-phase combustion at constant pressure. Particular attention is paid to the distinguishing physical and computational characteristics of the induction, heat-release and equilibration regimes. The two-part predictor-corrector algorithm, based on an exponentially-fitted trapezoidal rule, includes filtering of ill-posed initial conditions, automatic selection of Newton-Jacobi or Newton iteration for convergence to achieve maximum computational efficiency while observing a prescribed error tolerance. The new algorithm was found to compare favorably with LSODE on two representative test problems drawn from combustion kinetics.

Pratt, D. T.↗

Optimal dimensionality selection for independent component analysis of transcriptomic data

Independent component analysis is an unsupervised machine learning algorithm that separates a set of mixed signals into a set of statistically independent source signals. Applied to high-quality gene expression datasets, independent component analysis effectively reveals both the source signals of the transcriptome as co-regulated gene sets, and the activity levels of the underlying regulators across diverse experimental conditions. Two major variables that affect the final gene sets are the diversity of the expression profiles contained in the underlying data, and the user-defined number of independent components, or dimensionality, to compute. Availability of high-quality transcriptomic datasets has grown exponentially as high-throughput technologies have advanced; however, optimal dimensionality selection remains an open question. We computed independent components across a range of dimensionalities for four gene expression datasets with varying dimensions (both in terms of number of genes and number of samples). We computed the correlation between independent components across different dimensionalities to understand how the overall structure evolves as the number of user-defined components increases. We then measured how well the resulting gene clusters reflected known regulatory mechanisms, and developed a set of metrics to assess the accuracy of the decomposition at a given dimension. We found that over-decomposition results in many independent components dominated by a single gene, whereas under-decomposition results in independent components that poorly capture the known regulatory structure. From these results, we developed a new method, called OptICA, for finding the optimal dimensionality that controls for both over- and under-decomposition. Specifically, OptICA selects the highest dimension that produces a low number of components that are dominated by a single gene. We show that OptICA outperforms two previously proposed methods for selecting the number of independent components across four transcriptomic databases of varying sizes. OptICA avoids both over-decomposition and under-decomposition of transcriptomic datasets resulting in the best representation of the organism’s underlying transcriptional regulatory network.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Harnessing Condorcet Methods to Improve Decision-making Based on Ranked Data

Decision-makers must often choose between multiple alternatives based on their relative merits across a variety of criteria. These multiple-criteria decision-making (MCDM) problems must be approached in an objective, measurable, and transparent fashion to obtain well-supported outcomes. The challenge of using sets of ranked data to identify the optimal choice is not unlike the challenge of using ranked ballots to identify the winner of an election in a preference voting system. As such, the methods of rank aggregation used in elections can be applied to help resolve MCDM problems. Previous research into the design of elections and ballots has yielded many algorithms with well-understood properties. A subset of these, called Condorcet methods, reliably identify the “Condorcet winner,” if it exists, giving the result that would defeat any other in a pairwise comparison. That, in addition to several other desirable qualities, makes Condorcet methods like the Schulze method, Ranked Pairs, and Copeland’s method, effective and scalable means for tackling MCDM problems. These rank aggregation methods have been implemented in JavaScript functions for incorporation into a web-based MCDM decision tool. These algorithms can be applied in a wide variety of contexts (for example, determining the “best” environmental remediation method or selecting a subcontractor) to facilitate effective decision-making. The performance of the JavaScript Condorcet prototype tool was compared across the implemented algorithms and with both a non-Condorcet rank aggregation method as well as an implementation of the Simple Multi-Attribute Rating Technique (SMART) algorithm.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗