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 1,081 records · Page 60

Separation at Crossing Waypoints Under Wind Uncertainty in Urban Air Mobility

To enable high-density operations in major metropolitan areas, urban air mobility networks are anticipated to have air traffic management with higher levels of autonomy. To ensure that this type of autonomy is feasible, one of the critical steps from a safety and efficiency perspective is understanding various factors that affect the spatial separation between airborne flights and ensure that these factors can be managed. In terms of separation assurance and scheduling, an important real-world concern is that future states of aircraft cannot be perfectly predicted. The focus of this research paper is to understand how these prediction errors affect separation and scheduling services and to explore mitigation strategies to handle these errors. In this research, we have simulated these types of uncertainty by adding wind-prediction errors to trajectory predictions for separation. With these wind-prediction errors, we decompose the problem into two separate questions. First, using both simulation and analytical methods, we look at conflict-detection-only scenarios to understand how the wind errors affect required minimum temporal separation between crossing flights to ensure a specific spatial separation. Next, we study how trajectory errors effect conflict resolution, and we explore different combinations of scheduling and separation assurance to mitigate the effects of uncertainty between crossing flights. The conflict resolution algorithm aims to minimize necessary temporal separation between crossing flights under uncertainty, still ensuring safety-critical spatial separation. In summary, this research suggests that the required minimum temporal separation at a crossing waypoint is dependent on factors such as inbound crossing angle, the relative angle between wind direction and bearing of each route, wind magnitude, wind magnitude uncertainty, nominal cruise airspeed of aircraft, and look-ahead time of the conflict detection algorithm. This research also suggests that different combinations of scheduling and separation have different qualitative results. Using a combination of strategic, flow-based scheduling, tactical scheduling at crossings, speed control near crossing points, and separation management leads to a system that is insensitive to trajectory prediction errors with high throughput and flexibility for aircraft away from shared resources.

urban air mobility↗

Viscous vortex flows

Several computational studies are currently being pursued that focus on various aspects of representing the entire lifetime of the viscous trailing vortex wakes generated by an aircraft. The formulation and subsequent near-wing development of the leading-edge vortices formed by a delta wing are being calculated at modest Reynolds numbers using a three-dimensional, time-dependent Navier-Stokes code. Another computational code was developed to focus on the roll-up, trajectory, and mutual interaction of trailing vortices further downstream from the wing using a two-dimensional, time-dependent, Navier-Stokes algorithm. To investigate the effect of a cross-wind ground shear flow on the drift and decay of the far-field trailing vortices, a code was developed that employs Euler equations along with matched asymptotic solutions for the decaying vortex filaments. And finally, to simulate the conditions far down stream after the onset of the Crow instability in the vortex wake, a full three-dimensional, time-dependent Navier-Stokes code was developed to study the behavior of interacting vortex rings.

Weston, R. P.↗

A Pulsar-Based Time-Scale from the International Pulsar Timing Array

We have constructed a new time-scale, TT(IPTA16), based on observations of radio pulsars presented in the first data release from the International Pulsar Timing Array (IPTA). We used two analysis techniques with independent estimates of the noise models for the pulsar observations and different algorithms for obtaining the pulsar time-scale. The two analyses agree within the estimated uncertainties and both agree with TT(BIPM17), a post-corrected time-scale produced by the Bureau International des Poids et Mesures (BIPM). We show that both methods could detect significant errors in TT(BIPM17) if they were present. We estimate the stability of the atomic clocks from which TT(BIPM17) is derived using observations of four rubidium fountain clocks at the US Naval Observatory. Comparing the power spectrum of TT(IPTA16) with that of these fountain clocks suggests that pulsar-based time-scales are unlikely to contribute to the stability of the best time-scales over the next decade, but they will remain a valuable independent check on atomic time-scales. We also find that the stability of the pulsar-based time-scale is likely to be limited by our knowledge of solar-system dynamics, and that errors in TT(BIPM17) will not be a limiting factor for the primary goal of the IPTA, which is to search for the signatures of nano-Hertz gravitational waves.

G. Hobbs↗

Successive Convexification for Powered Descent Guidance with Time-Varying Mass Properties

This paper extends the 6 degree-of-freedom successive convexification (SCvx) algorithm discussed in literature to account for time-varying mass properties in the representation of the attitude dynamics. Simulation results of a notional large-size lander performing the last minutes of Lunar powered descent with significant variations in the center-of-mass and moments of inertia over the duration of the trajectory are shown. Differences in the final optimal trajectories generated via SCvx are presented between the constant vs. variable mass property formulations for an in-plane and out-of-plane example.

Alex Hayes↗

Successive Convexification for Powered Descent Guidance with Time-Varying Mass Properties

This paper extends the 6 degree-of-freedom successive convexification (SCvx) algorithm discussed in literature to account for time-varying mass properties in the representation of the attitude dynamics. Simulation results of a notional large-size lander performing the last minutes of Lunar powered descent with significant variations in the center-of-mass and moments of inertia over the duration of the trajectory are shown. Differences in the final optimal trajectories generated via SCvx are presented between the constant vs. variable mass property formulations for an in-plane and out-of-plane example.

Alex Hayes↗

Gram-Schmidt algorithms for covariance propagation

This paper addresses the time propagation of triangular covariance factors. Attention is focused on the square-root free factorization, P = UDU/T/, where U is unit upper triangular and D is diagonal. An efficient and reliable algorithm for U-D propagation is derived which employs Gram-Schmidt orthogonalization. Partitioning the state vector to distinguish bias and colored process noise parameters increases mapping efficiency. Cost comparisons of the U-D, Schmidt square-root covariance and conventional covariance propagation methods are made using weighted arithmetic operation counts. The U-D time update is shown to be less costly than the Schmidt method; and, except in unusual circumstances, it is within 20% of the cost of conventional propagation.

Thornton, C. L.↗

Optimal guidance with obstacle avoidance for nap-of-the-earth flight

The development of automatic guidance is discussed for helicopter Nap-of-the-Earth (NOE) and near-NOE flight. It deals with algorithm refinements relating to automated real-time flight path planning and to mission planning. With regard to path planning, it relates rotorcraft trajectory characteristics to the NOE computation scheme and addresses real-time computing issues and both ride quality issues and pilot-vehicle interfaces. The automated mission planning algorithm refinements include route optimization, automatic waypoint generation, interactive applications, and provisions for integrating the results into the real-time path planning software. A microcomputer based mission planning workstation was developed and is described. Further, the application of Defense Mapping Agency (DMA) digital terrain to both the mission planning workstation and to automatic guidance is both discussed and illustrated.

Pekelsma, Nicholas J.↗

Assured Contingency Landing Management for Advanced Air Mobility

Advanced Air Mobility (AAM) is quickly developing as a new air transportation system that moves people and packages in the regions previously not / less served by the current aviation systems. Such AAM must operate safely despite the potential to encounter hazards and experience anomalies and failures in-flight. It becomes especially important to have systematic auto-mitigation strategies to perform safe contingency actions in AAM flight operations, as pilots have limited Situational Awareness (SA) and limited time to make prompt decisions when encountering failures/anomalies in high-density low altitude airspace. This paper presents Assured Contingency Landing Management (ACLM) with an online landing strategy selection to decide between the following three options when a contingency landing is required: (1) Return-to-launch landing site, (2) Land immediately at a nearby clear but unprepared site, (3) Land at a prepared landing site from the approximate footprint. Our presented algorithm shows a real-time auto-mitigation loop with multiple threads that run simultaneously to check controllability, reachability, and intermediate decisions to hold/ loiter or continue the flight plan as the landing strategy solution is being computed. Case study simulation is demonstrated with the safety-critical propulsion system and battery system and shows how different failure scenarios impact the landing strategy selection.

Autonomous Mitigation↗

Common spaceborne multicomputer operating system and development environment

A preliminary technical specification for a multicomputer operating system is developed. The operating system is targeted for spaceborne flight missions and provides a broad range of real-time functionality, dynamic remote code-patching capability, and system fault tolerance and long-term survivability features. Dataflow concepts are used for representing application algorithms. Functional features are included to ensure real-time predictability for a class of algorithms which require data-driven execution on an iterative steady state basis. The development environment supports the development of algorithm code, design of control parameters, performance analysis, simulation of real-time dataflow applications, and compiling and downloading of the resulting application.

Craymer, L. G.↗

Framework for a space shuttle main engine health monitoring system

A framework developed for a health management system (HMS) which is directed at improving the safety of operation of the Space Shuttle Main Engine (SSME) is summarized. An emphasis was placed on near term technology through requirements to use existing SSME instrumentation and to demonstrate the HMS during SSME ground tests within five years. The HMS framework was developed through an analysis of SSME failure modes, fault detection algorithms, sensor technologies, and hardware architectures. A key feature of the HMS framework design is that a clear path from the ground test system to a flight HMS was maintained. Fault detection techniques based on time series, nonlinear regression, and clustering algorithms were developed and demonstrated on data from SSME ground test failures. The fault detection algorithms exhibited 100 percent detection of faults, had an extremely low false alarm rate, and were robust to sensor loss. These algorithms were incorporated into a hierarchical decision making strategy for overall assessment of SSME health. A preliminary design for a hardware architecture capable of supporting real time operation of the HMS functions was developed. Utilizing modular, commercial off-the-shelf components produced a reliable low cost design with the flexibility to incorporate advances in algorithm and sensor technology as they become available.

Hawman, Michael W.↗

A discrete momentum-conserving explicit algorithm for multibody dynamics analysis

A discrete momentum-conserving, explicit time integration is presented. The accurate feature and simplicity of the present algorithm are realized by a mid-point implicit formula for integrating the Euler parameters and a second-order discrete momentum-conserving form of the central difference algorithm, respectively. The accuracy and robustness of the algorithm is demonstrated by example problems which exhibit large overall rigid motions under holonomic constraints.

Park, K. C.↗

Improving Computational Efficiency of Prognostics Algorithms in Resource-Constrained Settings

In engineering and aerospace applications, it is vital to operational success to have insight into the expected performance and health of physical systems. The field of prognostics and health management provides quantitative methods for monitoring, predicting, and managing system health. Prognostics algorithms can be employed to assess the current state of a system, propagate the system throughout time, and predict potential anomalies or failures that may occur. While they can provide accurate prediction results, effective prognostics algorithms can be challenging to use in resource-constrained settings due to computational limitations and high computational latency, leading to obsolete predictions. Thus, computationally efficient and accurate algorithms are necessary for future remaining useful life predictions. In this work, we implement new algorithmic approaches for prediction, quantitatively compare them via a battery degradation use-case, and provide recommendations of potential improvements to a prognostics framework. One approach to prediction is through sampling, whereby the current state of a physical system is sampled many times and each sample is propagated forward until failure is reached, resulting in a distribution of failure values. To improve the efficiency of this process, we implemented five new algorithmic approaches to prediction, including three distinct sampling methods (standard Monte Carlo, Quasi-Monte Carlo, and Latin Hypercube Sampling), a variable time step algorithm, and a variable sample size algorithm. To compare the algorithms, we employ a variety of metrics designed specifically to analyze both computational efficiency and model accuracy. Our metrics include accuracy to compare the average predicted value to ground truth, mean absolute deviation to illustrate dispersion, specific percentile error to describe accuracy within a user-defined risk tolerance, and code run-time. To quantitatively analyze our results, we employ a use-case of degradation of a Lithium-ion battery. We use an electrochemistry-based model to describe the current health state of the battery, and implement our prediction algorithms to propagate forward in time until end-of-discharge (EOD) is reached. Notably, through this work it was found that none of our sampling approaches had a significant impact on computational efficiency or model accuracy in predicting EOD of the battery. We find that while the sampling methods are unique, the distributions they generate are similar, ultimately producing final predictions that are nearly identical. In exploring the effect of the time step within the prediction algorithm, we found that prediction accuracy was highly dependent on the time step used, and that implementing a variable time step within a particular prediction may provide an increase in computational efficiency while also maintaining prediction accuracy. Finally, implementing a variable sample size also affected prediction, and our results show that tuning both the magnitude and timing of the sample size adjustment can result in improved computation speed and maintained prediction accuracy. Taken together, our findings highlight the challenge of performing prognostics in resource-constrained settings, and illustrate the potential of developing new prediction algorithms to improve computational efficiency.

prognostics↗

The Re-Analysis of Ozone Profile Data from a 41-Year Series of SBUV Instruments

In this study we present the validation of ozone profiles from a number of Solar Back Scattered Ultra Violet (SBUV) and SBUV/2 instruments that were recently reprocessed using an updated (Version 8.6) algorithm. The SBUV dataset provides the longest available record of global ozone profiles, spanning a 41-year period from 1970 to 2011 (except a 5-year gap in the 1970s) and includes ozone profile records obtained from the Nimbus-4 BUV and Nimbus-7 SBUV instruments, and a series of SBUV(/2) instruments launched on NOAA operational satellites (NOAA 09, 11, 14, 16, 17, 18, 19). Although modifications in instrument design were made in the evolution from the BUV instrument to the modern SBUV(/2) model, the basic principles of the measurement technique and retrieval algorithm remain the same. The long term SBUV data record allows us to create a consistent, calibrated dataset of ozone profiles that can be used for climate studies and trend analyses. In particular, we focus on estimating the various sources of error in the SBUV profile ozone retrievals using independent observations and analysis of the algorithm itself. For the first time we include in the metadata a quantitative estimate of the smoothing error, defined as the error due to profile variability that the SBUV observing system cannot inherently measure. The magnitude of the smoothing error varies with altitude, latitude, season and solar zenith angle. Between 10 and 1 hPa the smoothing errors for the SBUV monthly zonal mean retrievals are of the order of 1 %, but start to increase above and below this layer. The largest smoothing errors, as large as 15-20%, were detected in in the troposphere. The SBUV averaging kernels, provided with the ozone profiles in version 8.6, help to eliminate the smoothing effect when comparing the SBUV profiles with high vertical resolution measurements, and make it convenient to use the SBUV ozone profiles for data assimilation and model validation purposes. The smoothing error can also be minimized by combining layers of data, and we will discuss recommendations for this approach as well. The SBUV ozone profiles have been intensively validated against satellite profile measurements obtained from the Microwave Limb Sounders (MLS) (on board the UARS and AURA satellites), Stratospheric Aerosol and Gas Experiment (SAGE) and Michelson Interferometer for Passive Atmospheric Sounding (MIPAS). Also, we compare coincident and collocated SBUV ozone retrievals with observations made by ground-based instruments, such as microwave spectrometers, lidars, Umkehr instruments and balloon-borne ozonosondes. Finally, we compare the SBUV ozone profiles with output from the NASA GSFC GEOS-CCM model. In the stratosphere between 25 and 1 hPa the mean biases and standard deviations are within 5% for monthly mean ozone profiles. Above and below this layer the vertical resolution of the SBUV algorithm decreases and the effects of vertical smoothing should be taken into account. Though the SBUV algorithm has a coarser vertical resolution in the lower stratosphere and troposphere, it is capable of precisely estimating the integrated ozone column between the surface and 25 hPa. The time series of the tropospheric - lower stratospheric ozone column derived from SBUV agrees within 5% with the corresponding values observed by an ensemble of ozone sonde stations in North Hemisphere. Drift of the ozone time series obtained from each SBUV(/2) instrument relative to ground based and satellite measurements are evaluated and some features of individual SBUV(l2) instruments are discussed. In addition to evaluating individual instruments against independent observations, we also focus on the instrument to instrument consistency in the series. Overall, Version 8.6 ozone profiles obtained from two different SBUV(l2) instruments compare within a couple of percent during overlap periods and are consistently varying in time, with some exceptions. Some of the noted discrepancies might bssociated with ozone diurnal variations, since the difference in the local time of the observations for a pair of SBUV(l2) instruments could be several hours. Other issues include the potential short-term drift in measurements as the instrument orbit drifts, and measurements are obtained at high solar zenith angles (>85 ). Based on the results of the validation, a consistent, calibrated dataset of SBUV ozone profiles has been created based on internal calibration only.

Kramarova, Natalya↗

Autonomous star identification for spacecraft attitude control

Research is being conducted to enhance the Advanced Star and Target Reference Optical Scanner (ASTROS I) so that it will be able to automatically track a star and recognize the star's pointing position. Previously developed field identification algorithms, coded on a flight-scale computer, are linked to a breadboard ASTROS star tracker to calculate pointing vectors in real time. A simple graph-searching algorithm was used in an initial study to find stellar positions based on pattern recognition. Results from this study and plans for further development are presented.

Rappaport, Barry↗

Task 7: ADPAC User's Manual

The overall objective of this study was to develop a 3-D numerical analysis for compressor casing treatment flowfields. The current version of the computer code resulting from this study is referred to as ADPAC (Advanced Ducted Propfan Analysis Codes-Version 7). This report is intended to serve as a computer program user's manual for the ADPAC code developed under Tasks 6 and 7 of the NASA Contract. The ADPAC program is based on a flexible multiple- block grid discretization scheme permitting coupled 2-D/3-D mesh block solutions with application to a wide variety of geometries. Aerodynamic calculations are based on a four-stage Runge-Kutta time-marching finite volume solution technique with added numerical dissipation. Steady flow predictions are accelerated by a multigrid procedure. An iterative implicit algorithm is available for rapid time-dependent flow calculations, and an advanced two equation turbulence model is incorporated to predict complex turbulent flows. The consolidated code generated during this study is capable of executing in either a serial or parallel computing mode from a single source code. Numerous examples are given in the form of test cases to demonstrate the utility of this approach for predicting the aerodynamics of modem turbomachinery configurations.

Hall, E. J.↗

Gram-Schmidt algorithms for covariance propagation

This paper addresses the time propagation of triangular covariance factors. Attention is focused on the square-root free factorization, P = UD(transpose of U), where U is unit upper triangular and D is diagonal. An efficient and reliable algorithm for U-D propagation is derived which employs Gram-Schmidt orthogonalization. Partitioning the state vector to distinguish bias and coloured process noise parameters increase mapping efficiency. Cost comparisons of the U-D, Schmidt square-root covariance and conventional covariance propagation methods are made using weighted arithmetic operation counts. The U-D time update is shown to be less costly than the Schmidt method; and, except in unusual circumstances, it is within 20% of the cost of conventional propagation.

Thornton, C. L.↗

An Autonomous Onboard Targeting Algorithm Using Finite Thrust Maneuvers

In earlier investigations, the adaptation and implementation of a modified two-level corrections (or targeting) process as the onboard targeting algorithm for the Trans-Earth Injection phase of Orion is presented. The objective of that targeting algorithm is to generate the times of ignition and magnitudes of the required maneuvers such that the desired state at entry interface is achieved. In an actual onboard flight software implementation, these times of ignition and maneuvers are relayed onto Flight Control for command and execution. Although this process works well when the burn durations or burn arcs are small, this might not be the case during a contingency situation when lower thrust engines are employed to perform the maneuvers. Therefore, a new model for the two-level corrections process is formulated here to accommodate finite burn arcs. This paper presents the development and formulation of the finite burn two-level corrector, used as an onboard targeting algorithm for the Trans-Earth Injection phase of Orion. A performance comparison between the impulsive and finite burn models is also presented. The present formulation ensures all entry constraints are met, without violating the available fuel budget, while allowing for low-thrust scenarios with long burn durations.

Scarritt, Sara K.↗

A Coulomb collision algorithm for weighted particle simulations

A binary Coulomb collision algorithm is developed for weighted particle simulations employing Monte Carlo techniques. Charged particles within a given spatial grid cell are pair-wise scattered, explicitly conserving momentum and implicitly conserving energy. A similar algorithm developed by Takizuka and Abe (1977) conserves momentum and energy provided the particles are unweighted (each particle representing equal fractions of the total particle density). If applied as is to simulations incorporating weighted particles, the plasma temperatures equilibrate to an incorrect temperature, as compared to theory. Using the appropriate pairing statistics, a Coulomb collision algorithm is developed for weighted particles. The algorithm conserves energy and momentum and produces the appropriate relaxation time scales as compared to theoretical predictions. Such an algorithm is necessary for future work studying self-consistent multi-species kinetic transport.

Miller, Ronald H.↗