Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm testing”

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 595 records · Page 33

NASA's Robotic Lunar Lander Development Project

Since early 2005, NASA's Robotic Lunar Lander Development (RLLD) office at NASA MSFC, in partnership with the Applied Physics Laboratory (APL), has developed mission concepts and preformed risk-reduction activities to address planetary science and exploration objectives uniquely met with landed missions. The RLLD team developed several concepts for lunar human-exploration precursor missions to demonstrate precision landing and in-situ resource utilization, a multi-node lunar geophysical network mission, either as a stand-alone mission, or as part of the International Lunar Network (ILN), a Lunar Polar Volatiles Explorer and a Mercury lander mission for the Planetary Science decadal survey, and an asteroid rendezvous and landing mission for the Exploration Precursor Robotics Mission (xPRM) office. The RLLD team has conducted an extensive number of risk-reduction activities in areas common to all lander concepts, including thruster testing, propulsion thermal control demonstration, composite deck design and fabrication, and landing leg stability and vibration. In parallel, the team has developed two robotic lander testbeds providing closed-loop, autonomous hover and descent activities for integration and testing of flight-like components and algorithms. A compressed-air test article had its first flight in September 2009 and completed over 150 successful flights. This small test article (107 kg dry/146 kg wet) uses a central throttleable thruster to offset gravity, plus 3 descent thrusters (~37lbf ea) and 6 attitude-control thrusters (~12lbf ea) to emulate the flight system with pulsed operation over approximately 10s of flight time. The test article uses carbon composite honeycomb decks, custom avionics (COTS components assembled in-house), and custom flight and ground software. A larger (206 kg dry/322 kg wet), hydrogen peroxide-propelled vehicle began flight tests in spring 2011 and fly over 30 successful flights to a maximum altitude of 30m. The monoprop testbed also uses a central gravity-canceling thruster and 3 descent thrusters, but has 12 attitude-control thrusters and a maximum flight time of over a minute. The testbed uses aluminum ortho-grid decks, an LN200-1 IMU, Roke Manor Radar Altimeter, Illunis optical cameras, Novatel Pro-Pak GPS truth data system, Pressure transducers & thermocouples for housekeeping, "In-Control" ground system software, and the core Flight Executive (cFE) modular software environment. The peroxide lander testbed is able to accept other sensors and algorithms for testing, both from within NASA and from other customers. Through these activities, the RLLD team has significantly reduced technical risks for all small and medium class robotic landers for the Moon and other airless planetary bodies.

Cohen, Barbara A.↗

A Super-Resolution Algorithm for Enhancement of FLASH LIDAR Data: Flight Test Results

This paper describes the results of a 3D super-resolution algorithm applied to the range data obtained from a recent Flash Lidar helicopter flight test. The flight test was conducted by the NASA's Autonomous Landing and Hazard Avoidance Technology (ALHAT) project over a simulated lunar terrain facility at NASA Kennedy Space Center. ALHAT is developing the technology for safe autonomous landing on the surface of celestial bodies: Moon, Mars, asteroids. One of the test objectives was to verify the ability of 3D super-resolution technique to generate high resolution digital elevation models (DEMs) and to determine time resolved relative positions and orientations of the vehicle. 3D super-resolution algorithm was developed earlier and tested in computational modeling, and laboratory experiments, and in a few dynamic experiments using a moving truck. Prior to the helicopter flight test campaign, a 100mX100m hazard field was constructed having most of the relevant extraterrestrial hazard: slopes, rocks, and craters with different sizes. Data were collected during the flight and then processed by the super-resolution code. The detailed DEM of the hazard field was constructed using independent measurement to be used for comparison. ALHAT navigation system data were used to verify abilities of super-resolution method to provide accurate relative navigation information. Namely, the 6 degree of freedom state vector of the instrument as a function of time was restored from super-resolution data. The results of comparisons show that the super-resolution method can construct high quality DEMs and allows for identifying hazards like rocks and craters within the accordance of ALHAT requirements.

Bulyshev, Alexander↗

Phase Retrieval Using a Genetic Algorithm on the Systematic Image-Based Optical Alignment Testbed

NASA s Marshall Space Flight Center s Systematic Image-Based Optical Alignment (SIBOA) Testbed was developed to test phase retrieval algorithms and hardware techniques. Individuals working with the facility developed the idea of implementing phase retrieval by breaking the determination of the tip/tilt of each mirror apart from the piston motion (or translation) of each mirror. Presented in this report is an algorithm that determines the optimal phase correction associated only with the piston motion of the mirrors. A description of the Phase Retrieval problem is first presented. The Systematic Image-Based Optical Alignment (SIBOA) Testbeb is then described. A Discrete Fourier Transform (DFT) is necessary to transfer the incoming wavefront (or estimate of phase error) into the spatial frequency domain to compare it with the image. A method for reducing the DFT to seven scalar/matrix multiplications is presented. A genetic algorithm is then used to search for the phase error. The results of this new algorithm on a test problem are presented.

Taylor, Jaime R.↗

Investigation of registration algorithms for the automatic tile processing system

The Robotic Tile Inspection System (RTPS), under development in NASA-KSC, is expected to automate the processes of post-flight re-water-proofing and the process of inspection of the Shuttle heat absorbing tiles. An important task of the robot vision sub-system is to register the 'real-world' coordinates with the coordinates of the robot model of the Shuttle tiles. The model coordinates relate to a tile data-base and pre-flight tile-images. In the registration process, current (post-flight) images are aligned with pre-flight images to detect the rotation and translation displacement required for the coordinate systems rectification. The research activities performed this summer included study and evaluation of the registration algorithm that is currently implemented by the RTPS, as well as, investigation of the utility of other registration algorithms. It has been found that the current algorithm is not robust enough. This algorithm has a success rate of less than 80% and is, therefore, not suitable for complying with the requirements of the RTPS. Modifications to the current algorithm has been developed and tested. These modifications can improve the performance of the registration algorithm in a significant way. However, this improvement is not sufficient to satisfy system requirements. A new algorithm for registration has been developed and tested. This algorithm presented very high degree of robustness with success rate of 96%.

Tamir, Dan E.↗

Testing Linear Temporal Logic Formulae on Finite Execution Traces

We present an algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL. theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications. Such tests correspond to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property. We then suggest an optimized algorithm based on transforming LTL formulae. The work is done using the Maude rewriting system. which turns out to provide a perfect notation and an efficient rewriting engine for performing these experiments.

Havelund, Klaus↗

Cloud cover determination in polar regions from satellite imagery

The objectives are to develop a suitable validation data set for evaluating the effectiveness of the International Satellite Cloud Climatology Project (ISCCP) algorithm for cloud retrieval in polar regions, to identify limitations of current procedures and to explore potential means to remedy them using textural classifiers, and to compare synoptic cloud data from model runs with observations. Toward the first goal, a polar data set consisting of visible, thermal, and passive microwave data was developed. The AVHRR and SMMR data were digitally merged to a polar stereographic projection with an effective pixel size of 5 sq km. With this data set, two unconventional methods of classifying the imagery for the analysis of polar clouds and surfaces were examined: one based on fuzzy sets theory and another based on a trained neural network. An algorithm for cloud detection was developed from an early test version of the ISCCP algorithm. This algorithm includes the identification of surface types with passive microwave, then temporal tests at each pixel location in the cloud detection phase. Cloud maps and clear sky radiance composites for 5 day periods are produced. Algorithm testing and validation was done with both actural AVHRR/SMMR data, and simulated imagery. From this point in the algorithm, groups of cloud pixels are examined for their spectral and textural characteristics, and a procedure is developed for the analysis of cloud patterns utilizing albedo, IR temperature, and texture. In a completion of earlier work, empirical analyses of arctic cloud cover were explored through manual interpretations of DMSP imagery and compared to U.S. Air Force 3D-nephanalysis. Comparisons of observed cloudiness from existing climatologies to patterns computed by the GISS climate model were also made.

Barry, R. G.↗

Analytical Functions for 200 West Pump-and-Treat SCADA Sensor Data

Historical operations at the U.S. Department of Energy’s Hanford Site included disposal of waste fluids to the subsurface in the 200 West Area on the Hanford Central Plateau. Subsequent infiltration of fluids has resulted in groundwater contamination with carbon tetrachloride, nitrate, uranium, technetium-99, and other contaminants. A pump-and-treat (P&T) system, with an extraction/injection well network and an aboveground treatment plant, was implemented as part of interim and final remedies in the 200 West area. The HYPATIA single-page web application (part of the SOCRATES suite) is being developed to provide access to and analysis of chemistry and treatment facility sensor data for this 200 West P&T system. For the web application, analytical algorithms were developed to perform summing, differencing, smoothing, outlier detection, change-point detection, mass flow rate, and injectivity calculations on the data. Candidate algorithms were identified and tested, with the best-performing algorithms then assembled for implementation in HYPATIA. Because HYPATIA is hosted on the Amazon Web Services (AWS) cloud computing platform, algorithms were implemented in a back-end AWS Lambda function that can be called by the HYPATIA front end. The Lambda function applies the requested data processing to specified data via functions written in R, Python, and JavaScript. Development, testing, and review of the data analysis algorithms was completed under an NQA-1 quality program. This new HYPATIA functionality will provide information to support site decisions regarding P&T system performance and optimization.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

EVSE DERMS Controls [SWR-26-010]

An MQTT (Message Queuing Telemetry Transport) and OCPP (Open Charge Point Protocol) based remote smart charging controller framework for AC Electric Vehicle Supply Equipments (EVSEs). The code in this repo allows for the National Laboratory of the Rockies (NLR) controls to interface with the real Distributed Energy Resource Management System (DERMS) and EVSEs in NLR's ESIF Optimization and Control Laboratory (OCL). Different charge management algorithms can be tested to determine which power allocation method is most effective with the overall goal of demonstrating clear and well documented test results as well as providing functional control algorithms which could be utilized to provide effective smart charge management (SCM) at EV charging stations. Different power allocation methods are programmed in lab_demo_controller.py and include allocation based on first come first served, equal sharing, state of charge (SOC), priority factors, and behind the meter control methods.

Panossian, Nadia [National Laboratory of the Rocki↗

An objective method for forecasting tropical cyclone intensity and motion using Nimbus-5 ESMR measurements and non-satellite derived descriptors

An empirical analysis program, based on finding an optimal representation of the data was applied to 120 observations of 29 1973 and 1974 North Pacific tropical cyclones. Each observation consists of a field of Nimbus-5 Electrically Scanning Microwave Radiometer radiation measurements at 267 grid points covering and surrounding the tropical cyclone plus nine other non-satellite derived discriptors. Forecast algorithms to estimate storm intensity and motion at 12, 24, 48, and 72 hours after each observation were developed using an independent eigen screening analysis. These algorithms were based on best track data. Independent testing of these algorithms showed that the performance of most of these algorithms were better than persistence and the algorithms forecasting 24, 48, and 72 hour maximum wind speed were better than those made operationally by the Joint Typhoon Warning Center for 1973 and 1974 that did not use best track data.

Hunter, H. E.↗

Shuttle Entry Air Data System (SEADS) - Optimization of preflight algorithms based on flight results

The SEADS pressure model algorithm results were tested against other sources of air data, in particular, the Shuttle Best Estimated Trajectory (BET). The algorithm basis was also tested through a comparison of flight-measured pressure distribution vs the wind tunnel database. It is concluded that the successful flight of SEADS and the subsequent analysis of the data shows good agreement between BET and SEADS air data.

Wolf, H.↗

Improved Compression of Wavelet-Transformed Images

A recently developed data-compression method is an adaptive technique for coding quantized wavelet-transformed data, nominally as part of a complete image-data compressor. Unlike some other approaches, this method admits a simple implementation and does not rely on the use of large code tables. A common data compression approach, particularly for images, is to perform a wavelet transform on the input data, and then losslessly compress a quantized version of the wavelet-transformed data. Under this compression approach, it is common for the quantized data to include long sequences, or runs, of zeros. The new coding method uses prefixfree codes for the nonnegative integers as part of an adaptive algorithm for compressing the quantized wavelet-transformed data by run-length coding. In the form of run-length coding used here, the data sequence to be encoded is parsed into strings consisting of some number (possibly 0) of zeros, followed by a nonzero value. The nonzero value and the length of the run of zeros are encoded. For a data stream that contains a sufficiently high frequency of zeros, this method is known to be more effective than using a single variable length code to encode each symbol. The specific prefix-free codes used are from two classes of variable-length codes: a class known as Golomb codes, and a class known as exponential-Golomb codes. The codes within each class are indexed by a single integer parameter. The present method uses exponential-Golomb codes for the lengths of the runs of zeros, and Golomb codes for the nonzero values. The code parameters within each code class are determined adaptively on the fly as compression proceeds, on the basis of statistics from previously encoded values. In particular, a simple adaptive method has been devised to select the parameter identifying the particular exponential-Golomb code to use. The method tracks the average number of bits used to encode recent runlengths, and takes the difference between this average length and the code parameter. When this difference falls outside a fixed range, the code parameter is updated (increased or decreased). The Golomb code parameter is selected based on the average magnitude of recently encoded nonzero samples. The coding method requires no floating- point operations, and more readily adapts to local statistics than other methods. The method can also accommodate arbitrarily large input values and arbitrarily long runs of zeros. In practice, this means that changes in the dynamic range or size of the input data set would not require a change to the compressor. The algorithm has been tested in computational experiments on test images. A comparison with a previously developed algorithm that uses large code tables (generated via Huffman coding on training data) suggests that the data-compression effectiveness of the present algorithm is comparable to the best performance achievable by the previously developed algorithm.

Kiely, Aaron↗

Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae

The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as input. The generated algorithm runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula.

Rosu, Grigore↗

Sensitivity analysis of an automated fault detection algorithm for residential air-conditioning systems

The state of the art of fault detection and diagnosis (FDD) for residential air-conditioning systems is expensive and not yet amenable to widespread implementation. FDD for homes can significantly reduce utility costs, and increase the lifespan of the equipment. The cost barriers currently, however, make FDD for homes economically unviable for large scale implementation. In prior work, we offered a solution to reduce FDD costs by proposing an automated fault detection algorithm to serve as a screening step before more expensive FDD tests can be conducted. The algorithm uses only the home thermostat and local weather information to identify thermodynamic parameters and detect high-impact air-conditioning faults, including those that occur during equipment installation. We had tested the algorithm on a single EnergyPlus™ model of a home in Orlando, Florida. The thermodynamic parameter identification process is highly nonconvex involving several local optimal solutions. In this paper we propose a novel method to select the best model for fault detection from among the list of local optimal solutions to make the algorithm more robust to homes of different construction, without which the fault detection process would be infeasible. Another unique contribution of the paper is implementing the solution on real-world data. We also bring the algorithm closer to market by testing it on real-world data. We implement the algorithm on data obtained from experiments conducted by the Florida Solar Energy Center (FSEC) on a laboratory home equipped with a heat pump where faults were intentionally added for a period of seven months. The algorithm successfully detected an undercharge fault with 70.6% accuracy, concurrent duct leakage and undercharge faults with 85.2% accuracy, and duct leakage faults with 69.1% accuracy. A sensitivity analysis is also performed on EnergyPlus models of nine types of homes that vary in construction to demonstrate the robustness of the algorithm. Finally, the algorithm achieves an average accuracy of 71% for no-fault condition, 77% for 40% undercharge fault, and 76% for duct-leak fault.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Rocket engine failure detection using system identification techiques

The theoretical foundation and application of two univariate failure detection algorithms to Space Shuttle Main Engine (SSME) test firing data is presented. Both algorithms were applied to data collected during steady state operation of the engine. One algorithm, the time series algorithm, is based on time series techniques and involves the computation of autoregressive models. Times series techniques have been previously applied to SSME data. The second algorithm is based on standard signal processing techniques. It consists of tracking the variations in the average signal power with time. The average signal power algorithm is a newly proposed SSME failure detection algorithm. Seven nominal test firings were used to develop failure indication thresholds for each algorithm. These thresholds were tested using four anomalous firings and one additional nominal firing. Both algorithms provided significantly earlier failure indication times than did the current redline limit system. Neither algorithm gave false failure indications for the nominal firing. The strengths and weaknesses of the two algorithms are discussed and compared. The average signal algorithm was found to have several advantages over the time series algorithm.

Meyer, Claudia M.↗

Rocket engine failure detection using system identification techniques

The theoretical foundation and application of two univariate failure detection algorithms to Space Shuttle Main Engine (SSME) test firing data is presented. Both algorithms were applied to data collected during steady state operation of the engine. One algorithm, the time series algorithm, is based on time series techniques and involves the computation of autoregressive models. Time series techniques have been previously applied to SSME data. The second algorithm is based on standard signal processing techniques. It consists of tracking the variations in the average signal power with time. The average signal power algorithm is a newly proposed SSME failure detection algorithm. Seven nominal test firings were used to develop failure indication thresholds for each algorithm. These thresholds were tested using four anomalous firings and one additional nominal firing. Both algorithms provided significantly earlier failure indication times than did the current redline limit system. Neither algorithm gave false failure indications for the nominal firing. The strengths and weaknesses of the two algorithms are discussed and compared. The average signal algorithm was found to have several advantages over the time series algorithm.

Meyer, Claudia M.↗

"Reinforcement Learning Based Oscillation Dampening: Scaling up Single-Agent RL algorithms to a 100 AV highway field operational test"

In this article, we explore the technical details of the reinforcement learning (RL) algorithms that were deployed in the largest field test of automated vehicles designed to smooth traffic flow in history as of 2023, uncovering the challenges and breakthroughs that come with developing RL controllers for automated vehicles. We delve into the fundamental concepts behind RL algorithms and their application in the context of self-driving cars, discussing the developmental process from simulation to deployment in detail, from designing simulators to reward function shaping. We present the results in both simulation and deployment, discussing the flow-smoothing benefits of the RL controller. From understanding the basics of Markov decision processes to exploring advanced techniques such as deep RL, our article offers a comprehensive overview and deep dive of the theoretical foundations and practical implementations driving this rapidly evolving field. We also showcase real-world case studies and alternative research projects that highlight the impact of RL controllers in revolutionizing autonomous driving. From tackling complex urban environments to dealing with unpredictable traffic scenarios, these intelligent controllers are pushing the boundaries of what automated vehicles can achieve. Furthermore, we examine the safety considerations and hardware-focused technical details surrounding deployment of RL controllers into automated vehicles. As these algorithms learn and evolve through interactions with the environment, ensuring their behavior aligns with safety standards becomes crucial. We explore the methodologies and frameworks being developed to address these challenges, emphasizing the importance of building reliable control systems for automated vehicles.

Jang, Kathy↗

System for Anomaly and Failure Detection (SAFD) system development

The System for Anomaly and Failure Detection (SAFD) algorithm was developed as an improvement over the current redline system used in the Space Shuttle Main Engine Controller (SSMEC). Simulation tests and execution against previous hot fire tests demonstrated that the SAFD algorithm can detect engine failures as much as tens of seconds before the redline system recognized the failure. Although the current algorithm only operates during steady state conditions (engine not throttling), work is underway to expand the algorithm to work during transient conditions. This task assignment originally specified developing a platform for executing the algorithm during hot fire tests at Technology Test Bed (TTB) and installing the SAFD algorithm on that platform. Two units were built and installed in the Hardware Simulation Lab and at the TTB in December 1991. Since that time, the task primarily entailed improvement and maintenance of the systems, additional testing to prove the feasibility of the algorithm, and support of hot fire testing. This document addresses the work done since the last report of June 1992. The work on the System for Anomaly and Failure Detection during this period included improving the platform and the algorithm, testing the algorithm against previous test data and in the Hardware Simulation Lab, installing other algorithms on the system, providing support for operations at the Technology Test Bed, and providing routine maintenance.

Oreilly, D.↗

Quantum multi-programming for Grover’s search

Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We proved that this new algorithm increases the rotation angle of the Grover operator which, as a result, increases the success probability. The new algorithm is implemented on IBM quantum computers and compared with the canonical Grover's algorithm and other variations of Grover's algorithms. So, the empirical tests validate that our new algorithm outperforms other variations of Grover's algorithms as well as the canonical Grover's algorithm.

97 MATHEMATICS AND COMPUTING↗