Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 127 records · Page 7

Dose Calibration of the ISS-RAD Fast Neutron Detector

The ISS-RAD instrument has been fabricated by Southwest Research Institute and delivered to NASA for flight to the ISS in late 2015 or early 2016. ISS-RAD is essentially two instruments that share a common interface to ISS. The two instruments are the Charged Particle Detector (CPD), which is very similar to the MSL-RAD detector on Mars, and the Fast Neutron Detector (FND), which is a boron-loaded plastic scintillator with readout optimized for the 0.5 to 10 MeV energy range. As the FND is completely new, it has been necessary to develop methodology to allow it to be used to measure the neutron dose and dose equivalent. This talk will focus on the methods developed and their implementation using calibration data obtained in quasi-monoenergetic (QMN) neutron fields at the PTB facility in Braunschweig, Germany. The QMN data allow us to determine an approximate response function, from which we estimate dose and dose equivalent contributions per detected neutron as a function of the pulse height. We refer to these as the "pSv per count" curves for dose equivalent and the "pGy per count" curves for dose. The FND is required to provide a dose equivalent measurement with an accuracy of 10% of the known value in a calibrated AmBe field. Four variants of the analysis method were developed, corresponding to two different approximations of the pSv per count curve, and two different implementations, one for real-time analysis onboard ISS and one for ground analysis. We will show that the preferred method, when applied in either real-time or ground analysis, yields good accuracy for the AmBe field. We find that the real-time algorithm is more susceptible to chance-coincidence background than is the algorithm used in ground analysis, so that the best estimates will come from the latter.

Zeitlin, C.↗

Multi-frequency Tomography Radar Observations of Snow Stratigraphy at Fraser during SnowEx

SnowEx is a multi-year airborne snow campaign led by NASA. The purpose of SnowEx is to figure out how much water is stored in Earth’s terrestrial snow-covered regions. As part of the 2017 NASA SnowEx campaign, we deployed a portable triple-frequency (9.6GHz, 13.5GHz and 17.2GHz) and fully polarimetric frequency-modulated continuous-wave (FMCW) radar at Fraser, Colorado. The radar was installed on a 60cmx60cm frame to enable a full reconstruction of the three-dimensional variability per each radar channel. The tomography technique uses the radar echo from the multiple viewing positions and provides a unique access to the vertical structure of the snow layer. With current setup, the range resolution is 30cm. In this paper, we will review the radar design and signal-processing algorithm – time domain back projection. The generated vertical images show the snow stratigraphy, which is consistent with ground snow pit measurement. The continuous operation demonstrates diurnal thawing and refreezing process. The snow density is retrieved by comparing to the snow free image.

Esteban-Fernandez, Daniel↗

Robustness Computation of Dynamic Controllability in Probabilistic Temporal Networks with Ordinary Distributions

Most existing works in Probabilistic Simple Temporal Networks (PSTNs) base their frameworks on well-defined probability distributions. This paper addresses on PSTN Dynamic Controllability (DC) robustness measure, i.e. the execution success probability of a network under dynamic control.We consider PSTNs where the probability distributions of the contingent edges are ordinary distributed (e.g. non-parametric, non-symmetric). We introduce the concepts of dispatching protocol (DP) as well as DP-robustness, the probability of success under a predefined dynamic policy.We propose a fixed-parameter pseudo-polynomial time algorithm to compute the exact DP-robustness of any PSTN under \textit{NextFirst} protocol, and apply to various PSTN datasets, including the real case of planetary exploration in the context of the Mars 2020 rover, and propose an original structural analysis.

Saint-Guillain, Michael↗

Time controlled descent guidance algorithm for simulation of advanced ATC systems

Concepts and computer algorithms for generating time controlled four dimensional descent trajectories are described. The algorithms were implemented in the air traffic control simulator and used by experienced controllers in studies of advanced air traffic flow management procedures. A time controlled descent trajectory comprises a vector function of time, including position, altitude, and heading, that starts at the initial position of the aircraft and ends at touchdown. The trajectory provides a four dimensional reference path which will cause an aircraft tracking it to touchdown at a predetermined time with a minimum of fuel consumption. The problem of constructing such trajectories is divided into three subproblems involving synthesis of horizontal, vertical, and speed profiles. The horizontal profile is constructed as a sequence of turns and straight lines passing through a specified set of waypoints. The vertical profile consists of a sequence of level flight and constant descent angle segments defined by altitude waypoints. The speed profile is synthesized as a sequence of constant Mach number, constant indicated airspeed, and acceleration/deceleration legs. It is generated by integrating point mass differential equations of motion, which include the thrust and drag models of the aircraft.

Lee, H. Q.↗

Time-Series Ratio Algorithm for Nisar Soil Moisture Retrieval

The NASA ISRO Synthetic Aperture Radar (NISAR) mission is currently under development and will provide global L-band radar observations that will be helpful for various soil moisture applications. The final NISAR soil moisture product will have 200m spatial resolution with 12-day exact revisit time. A time-series ratio algorithm was implemented using NISAR simulated UAVSAR data collected during the SMAPVEX12 field experiment. In this paper, the performance of the time series ratio algorithm was assessed using in situ observations. Performance of the soil moisture retrieval algorithm was also assessed for dual polarization and quad-polarization observations modes.

Jeonghwan Park↗

A Parametric Study of the Ibrahim Time Domain Modal Identification Algorithm

The accuracy of the Ibrahim time Domain (ITD) identification algorithm in extracting structural model parameters from free response functions was studied using computer simulated data for 65 positions on an isotropic, uniform thickness plate with mode shapes obtained by NASTRAN analysis. Natural frequencies were used to study identification results over ranges of modal parameter values and user selectable algorithm constants. Effects of superimposing various levels of noise onto the functions were investigated. No detrimental effects were observed when the number of computational degrees of freedom allowed in the algorithm was made many times larger than the minimum necessary for adequate identification. The use of a high number of degrees of freedom when analyzing experimental data, for the simultaneous identification of many modes in one computer run are suggested.

Pappa, R. S.↗

Minimal time change detection algorithm for reconfigurable control system and application to aerospace

System parameters should be tracked on-line to build a reconfigurable control system even though there exists an abrupt change. For this purpose, a new performance index that we are studying is the speed of adaptation- how quickly does the system determine that a change has occurred? In this paper, a new, robust algorithm that is optimized to minimize the time delay in detecting a change for fixed false alarm probability is proposed. Simulation results for the aircraft lateral motion with a known or unknown change in control gain matrices, in the presence of doublet input, indicate that the algorithm works fairly well. One of its distinguishing properties is that detection delay of this algorithm is superior to that of Whiteness Test.

Kim, Sungwan↗

Comparison of Real-Time Pressure Rail Selection Algorithms for the Hybrid Hydraulic Electric Architecture: Case Study on a Track Loader

Abstract The hybrid hydraulic electric architecture (HHEA) seeks to combine the high power/torque/force density of hydraulics with the efficiency of electric machines. A set of common pressure rails is used to provide a majority of the power and this power is modulated by small electric machines to provide precise control for the operator. The HHEA has been studied in previous work using off-line dynamic programming optimization to determine energy efficient pressure rail selections, but this approach requires drive cycle information apriori. A Lagrange multiplier method has also been investigated where a set of gains (Lagrange multipliers) are optimized off-line with the idea the these gains, once determined, could be used for real-time operation. In this work, three new real-time pressure rail selection algorithms that do not require future drive cycle information are investigated; greedy, torque minimizing, and thresholding. The greedy control is found to only use 1% more energy than the globally optimal dynamic programming solution; but a model of energy loss is required.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An Automatic Cloud Mask Algorithm Based on Time Series of MODIS Measurements

Quality of aerosol retrievals and atmospheric correction depends strongly on accuracy of the cloud mask (CM) algorithm. The heritage CM algorithms developed for AVHRR and MODIS use the latest sensor measurements of spectral reflectance and brightness temperature and perform processing at the pixel level. The algorithms are threshold-based and empirically tuned. They don't explicitly address the classical problem of cloud search, wherein the baseline clear-skies scene is defined for comparison. Here, we report on a new CM algorithm which explicitly builds and maintains a reference clear-skies image of the surface (refcm) using a time series of MODIS measurements. The new algorithm, developed as part of the Multi-Angle Implementation of Atmospheric Correction (MAIAC) algorithm for MODIS, relies on fact that clear-skies images of the same surface area have a common textural pattern, defined by the surface topography, boundaries of rivers and lakes, distribution of soils and vegetation etc. This pattern changes slowly given the daily rate of global Earth observations, whereas clouds introduce high-frequency random disturbances. Under clear skies, consecutive gridded images of the same surface area have a high covariance, whereas in presence of clouds covariance is usually low. This idea is central to initialization of refcm which is used to derive cloud mask in combination with spectral and brightness temperature tests. The refcm is continuously updated with the latest clear-skies MODIS measurements, thus adapting to seasonal and rapid surface changes. The algorithm is enhanced by an internal dynamic land-water-snow classification coupled with a surface change mask. An initial comparison shows that the new algorithm offers the potential to perform better than the MODIS MOD35 cloud mask in situations where the land surface is changing rapidly, and over Earth regions covered by snow and ice.

Lyapustin, Alexei↗

A combined algorithm for minimum time slewing of flexible spacecraft

The use of Pontryagin's Maximum Principle for the large-angle slewing of large flexible structures usually results in the so-called two-point boundary-value problem (TPBVP), in which many requirements (e.g., minimum time, small flexible amplitude, and limited control powers, etc.) must be satisfied simultaneously. The successful solution of this problem depends largely on the use of an efficient numerical computational algorithm. There are many candidate algorithms available for his problem (e.g., quasilinearization, gradient, and shooting, etc.). In this paper, a proposed algorithm, which combines the quasilinearization method with a time shortening technique and a shooting method, is applied to the minimum-time, three-dimensional, and large-angle maneuver of flexible spacecraft, particularly the orbiting Spacecraft Control Laboratory Experiment (SCOLE) configuration. Theoretically, the nonlinear TPBVP can be solved only through the shooting method to find the 'exact' switching times for the bang-bang controls. However, computationally, a suitable guess for the missing initial costates is crucial because the convergence range of the unknown initial costates is usually narrow, especially for systems with high dimensions and when a multi-bang-bang control strategy is needed. On the other hand, the problems of near minimum time attitude maneuver of general rigid spacecraft and fast slewing of flexible spacecraft have been examined by the authors through a numerical approach based on the quasilinearization algorithm with a time shortening technique. Computational results have demonstrated its broad convergence range and insensitivity to initial costate choices. Consequently, a combined approach is naturally suggested here to solve the minimum time slewing problem. That is, in the computational process, the quasilinearization method is used first to obtain a near minimum time solution. Then, the acquired converged initial costates from the quasilinearization approach are transformed (tailored) to and used as the initial costate guess for starting the shooting method. Finally, the shooting method takes over the remaining calculations until the minimum-time solution converges. The nonlinear equations of motion of the SCOLE are formulated by using Lagrange's equations, with the mast modeled as a continuous beam subject to three-dimensional deformations. The numerical results will be presented and some related computational issues will also be discussed.

Bainum, P. M.↗

Advancements in the Aerosol Robotic Network (AERONET) Version 3 database – automated near-real-time quality control algorithm with improved cloud screening for Sun photometer aerosol optical depth (AOD) measurements

The Aerosol Robotic Network (AERONET) has provided highly accurate, ground-truth measurements of the aerosol optical depth (AOD) using Cimel Electronique Sun–sky radiometers for more than 25 years. In Version 2 (V2) of the AERONET database, the near-real-time AOD was semiautomatically quality controlled utilizing mainly cloud-screening methodology, while additional AOD data contaminated by clouds or affected by instrument anomalies were removed manually before attaining quality-assured status (Level 2.0). The large growth in the number of AERONET sites over the past 25 years resulted in significant burden to the manual quality control of millions of measurements in a consistent manner. The AERONET Version 3 (V3) algorithm provides fully automatic cloud screening and instrument anomaly quality controls. All of these new algorithm updates apply to near-real-time data as well as post-field-deployment processed data, and AERONET reprocessed the database in 2018. A full algorithm redevelopment provided the opportunity to improve data inputs and corrections such as unique filter-specific temperature characterizations for all visible and near-infrared wavelengths, updated gaseous and water vapor absorption coefficients, and ancillary data sets. The Level 2.0 AOD quality-assured data set is now available within a month after post-field calibration, reducing the lag time from up to several months. Near-real-time estimated uncertainty is determined using data qualified as V3 Level 2.0 AOD and considering the difference between the AOD computed with the pre-field calibration and AOD computed with pre-field and post-field calibration. This assessment provides a near-real-time uncertainty estimate for which average differences of AOD suggest a +0.02 bias and one sigma uncertainty of 0.02, spectrally, but the bias and uncertainty can be significantly larger for specific instrument deployments. Long-term monthly averages analyzed for the entire V3 and V2 databases produced average differences (V3–V2) of +0.002 with a ±0.02 SD (standard deviation), yet monthly averages calculated using time-matched observations in both databases were analyzed to compute an average difference of −0.002 with a ±0.004 SD. The high statistical agreement in multiyear monthly averaged AOD validates the advanced automatic data quality control algorithms and suggests that migrating research to the V3 database will corroborate most V2 research conclusions and likely lead to more accurate results in some cases.

David M. Giles↗

Examination of a Practical Aerobraking Guidance Algorithm

A practical real time guidance algorithm has been developed for aerobraking vehicles that minimizes the post-aeropass Delta V requirements for orbit insertion while nearly minimizing the maximum heating rate and the maximum structural loads. The algorithm is general in the sense that a minimum of assumptions is made, thus greatly reducing the number of parameters that must be determined prior to a given mission. An interesting feature is that in-plane guidance performance is tuned by adjusting one mission-dependent parameter, the bank margin; similarly, the out-of-plane guidance performance is tuned by adjusting a plane controller time constant. Other features of the algorithm are simplicity, efficiency, and ease of use. The algorithm is designed for, but not restricted to, a trimmed vehicle with bank angle modulation as the method of trajectory control. Performance of this guidance algorithm during flight in Earth's atmosphere is examined by its use in an aerobraking testbed program. The performance inquiry extends to a wide range of entry speeds covering a number of potential mission applications. Favorable results have been obtained with a minimum of development effort, and directions for improvement of performance are indicated.

Evans, Steven W.↗

Far-field radiation patterns of aperture antennas by the Winograd Fourier transform algorithm

A more time-efficient algorithm for computing the discrete Fourier transform, the Winograd Fourier transform (WFT), is described. The WFT algorithm is compared with other transform algorithms. Results indicate that the WFT algorithm in antenna analysis appears to be a very successful application. Significant savings in cpu time will improve the computer turn around time and circumvent the need to resort to weekend runs.

Heisler, R.↗

Robustness of continuous-time adaptive control algorithms in the presence of unmodeled dynamics

This paper examines the robustness properties of existing adaptive control algorithms to unmodeled plant high-frequency dynamics and unmeasurable output disturbances. It is demonstrated that there exist two infinite-gain operators in the nonlinear dynamic system which determines the time-evolution of output and parameter errors. The pragmatic implications of the existence of such infinite-gain operators is that: (1) sinusoidal reference inputs at specific frequencies and/or (2) sinusoidal output disturbances at any frequency (including dc), can cause the loop gain to increase without bound, thereby exciting the unmodeled high-frequency dynamics, and yielding an unstable control system. Hence, it is concluded that existing adaptive control algorithms as they are presented in the literature referenced in this paper, cannot be used with confidence in practical designs where the plant contains unmodeled dynamics because instability is likely to result. Further understanding is required to ascertain how the currently implemented adaptive systems differ from the theoretical systems studied here and how further theoretical development can improve the robustness of adaptive controllers.

Rohrs, C. E.↗