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
All sourcesNASA NTRSDOE OSTI
NASA NTRS2008

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↗
NASA NTRS1994

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.↗
NASA NTRS2019

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↗
NASA NTRS1995

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.↗
NASA NTRS1978

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.↗
NASA NTRS1985

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.↗
NASA NTRS1991

A Scheduling Algorithm for Replicated Real-Time Tasks

We present an algorithm for scheduling real-time periodic tasks on a multiprocessor system under fault-tolerant requirement. Our approach incorporates both the redundancy and masking technique and the imprecise computation model. Since the tasks in hard real-time systems have stringent timing constraints, the redundancy and masking technique are more appropriate than the rollback techniques which usually require extra time for error recovery. The imprecise computation model provides flexible functionality by trading off the quality of the result produced by a task with the amount of processing time required to produce it. It therefore permits the performance of a real-time system to degrade gracefully. We evaluate the algorithm by stochastic analysis and Monte Carlo simulations. The results show that the algorithm is resilient under hardware failures.

Yu, Albert C.↗
NASA NTRS1982

Singular perturbation techniques for real time aircraft trajectory optimization and control

The usefulness of singular perturbation methods for developing real time computer algorithms to control and optimize aircraft flight trajectories is examined. A minimum time intercept problem using F-8 aerodynamic and propulsion data is used as a baseline. This provides a framework within which issues relating to problem formulation, solution methodology and real time implementation are examined. Theoretical questions relating to separability of dynamics are addressed. With respect to implementation, situations leading to numerical singularities are identified, and procedures for dealing with them are outlined. Also, particular attention is given to identifying quantities that can be precomputed and stored, thus greatly reducing the on-board computational load. Numerical results are given to illustrate the minimum time algorithm, and the resulting flight paths. An estimate is given for execution time and storage requirements.

Calise, A. J.↗
NASA NTRS1984

Algorithm for space-time analysis of data on geomagnetic field

The algorithm for the execution of the space-time analysis of data on geomagnetic fields is described. The primary constraints figuring in the specific realization of the algorithm on a computer stem exclusively from the limited possibilities of the computer involved. It is realized in the form of a program for the BESM-6 computer.

Kulanin, N. V.↗
NASA NTRS2021

Near-Optimum Real-Time Range Estimation Algorithms for Proximity Links

The renewed interest in space exploration and cis-lunar situational awareness demands accurate ranging algorithms to enable navigation solutions for a multitude of spacecraft, rovers, and human explorers on the Moon and even on Mars, in the near future. Current state-of-the-art in ground-based ranging accuracy is on the order of 30 cm, however complicated equipment calibration and significant post-processing is required to achieve this level of ranging accuracy. This article examines ad-hoc approaches that achieve near-optimum real-time ranging performance with reduced complexity by utilizing a DPLL (digital phase-locked loop) to track the phase of the residual carrier for both direct and subcarrier modulated PN sequences, and a DCL (digital Costas loop) to obtain independent estimates of carrier phase and optimal combinations of these implementations to achieve near-optimum real-time performance with reduced computational complexity.

Cheung, Kar-Ming↗
NASA NTRS2020

Verification of Prognostic Algorithms to Predict Remaining Flying Time for Electric Unmanned Vehicles

This paper addresses the problem of building trust in the online prediction of a eUAV’s remaining available flying time powered by lithium-ion polymer batteries. A series of ground tests are described that make use of an electric unmanned aerial vehicle (eUAV) to verify the performance of remaining flying time predictions. The algorithm verification procedure described is implemented on a fully functional vehicle that is restrained to a platform for repeated run-to-functional-failure (charge depletion) experiments. The vehicle under test is commanded to follow a predefined propeller RPM profile in order to create battery demand profiles similar to those expected during flight. The eUAV is repeatedly operated until the charge stored in powertrain batteries falls below a specified limit threshold. The time at which the limit threshold on battery charge is crossed is then used to measure the accuracy of the remaining flying time prediction. In our earlier work battery aging was not included. In this work we take into account aging of the batteries where the parameters were updated to make predictions. Accuracy requirements are considered for an alarm that warns operators when remaining flying time is estimated to fall below the specified limit threshold.

Edward F. Hogge↗
NASA NTRS2022

Performance of Flash Lidar with Real-time Image Enhancement Algorithm for Landing Hazard Avoidance

Performance of a 3-D imaging flash lidar employing a novel super-resolution algorithm is characterized by a series of static and dynamic tests. A gantry test of this lidar in which the lidar was placed in an instrumented moving basket above a calibrated hazard field proved an excellent demonstration of hazard avoidance capabilities. Results of the gantry test are reported and potential of flash lidar utilizing super-resolution algorithm for future landing missions are explained.

Hazard Detection↗