Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex algorithms”

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 73 records · Page 4

Thermal Radiator Pointing for International Space Station

In order to provide thermal radiation environments that result in adequate beat rejection, the single-phase, liquid ammonia (NH3) heat rejection system on the International Space Station (ISS) requires that its two thermal radiator wings be dynamically rotated as the ISS travels through its orbit. This paper discusses the closed-loop, thermal radiator pointing system that is used on ISS to ensure adequate heat rejection by the radiators, while preventing freezing of the ammonia under low heat loads and cold-environmental conditions. Although initial designs used an open-loop approach for radiator pointing, concerns about performance robustness, algorithm complexity, memory requirements, and sustaining support drove the development of a more robust, simpler, closed-loop system. Hence, the challenge of the closed-loop system was to utilize existing sensors, actuators and computers to fit into the existing hardware and software architecture of the ISS. Using a proportional-integral (PI) control architecture with limited output and an anti-windup integrator, the temperature of the ammonia coming out of the radiator is measured and controlled by adjusting the radiator wing orientation. The radiator wing orientation for the local minimum environment is fed forward to the control system, and the closed-loop controller is used to generate a bias off of that local minimum environment in order to heat up the ammonia when necessary to avoid freezing. In the earth's shadow, the controller is suspended and the radiator wing is oriented to face the earth, the local maximum thermal environment which further prevents freezing of the ammonia. This control architecture is shown to provide adequate heat rejection and avoid freezing of the ammonia, even though the physical system consists of large transport delays and time-varying dynamics which change dramatically due to orbit motion and variable heat loads.

Green, Scott↗

Small-Body Extensions for the Satellite Orbit Analysis Program (SOAP)

An extension to the SOAP software allows users to work with tri-axial ellipsoid-based representations of planetary bodies, primarily for working with small, natural satellites, asteroids, and comets. SOAP is a widely used tool for the visualization and analysis of space missions. The small body extension provides the same visualization and analysis constructs for use with small bodies. These constructs allow the user to characterize satellite path and instrument cover information for small bodies in both 3D display and numerical output formats. Tri-axial ellipsoids are geometric shapes the diameters of which are different in each of three principal x, y, and z dimensions. This construct provides a better approximation than using spheres or oblate spheroids (ellipsoids comprising two common equatorial diameters as a distinct polar diameter). However, the tri-axial ellipsoid is considerably more difficult to work with from a modeling perspective. In addition, the SOAP small-body extensions allow the user to actually employ a plate model for highly irregular surfaces. Both tri-axial ellipsoids and plate models can be assigned to coordinate frames, thus allowing for the modeling of arbitrary changes to body orientation. A variety of features have been extended to support tri-axial ellipsoids, including the computation and display of the spacecraft sub-orbital point, ground trace, instrument footprints, and swathes. Displays of 3D instrument volumes can be shown interacting with the ellipsoids. Longitude/latitude grids, contour plots, and texture maps can be displayed on the ellipsoids using a variety of projections. The distance along an arbitrary line of sight can be computed between the spacecraft and the ellipsoid, and the coordinates of that intersection can be plotted as a function of time. The small-body extension supports the same visual and analytical constructs that are supported for spheres and oblate spheroids in SOAP making the implementation of the more complex algorithms largely transparent to the user.

Carnright, Robert↗

On DESTINY Science Instrument Electrical and Electronics Subsystem Framework

Future space missions are going to require large focal planes with many sensing arrays and hundreds of millions of pixels all read out at high data rates'' . This will place unique demands on the electrical and electronics (EE) subsystem design and it will be critically important to have high technology readiness level (TRL) EE concepts ready to support such missions. One such omission is the Joint Dark Energy Mission (JDEM) charged with making precise measurements of the expansion rate of the universe to reveal vital clues about the nature of dark energy - a hypothetical form of energy that permeates all of space and tends to increase the rate of the expansion. One of three JDEM concept studies - the Dark Energy Space Telescope (DESTINY) was conducted in 2008 at the NASA's Goddard Space Flight Center (GSFC) in Greenbelt, Maryland. This paper presents the EE subsystem framework, which evolved from the DESTINY science instrument study. It describes the main challenges and implementation concepts related to the design of an EE subsystem featuring multiple focal planes populated with dozens of large arrays and millions of pixels. The focal planes are passively cooled to cryogenic temperatures (below 140 K). The sensor mosaic is controlled by a large number of Readout Integrated Circuits and Application Specific Integrated Circuits - the ROICs/ASICs in near proximity to their sensor focal planes. The ASICs, in turn, are serviced by a set of "warm" EE subsystem boxes performing Field Programmable Gate Array (FPGA) based digital signal processing (DSP) computations of complex algorithms, such as sampling-up-the-ramp algorithm (SUTR), over large volumes of fast data streams. The SUTR boxes are supported by the Instrument Control/Command and Data Handling box (ICDH Primary and Backup boxes) for lossless data compression, command and low volume telemetry handling, power conversion and for communications with the spacecraft. The paper outlines how the JDEM DESTINY concept instrument EE subsystem can be built now, a design; which is generally U.S. Government work not protected by U.S. copyright IEEEAC paper # 1429. Version 4. Updated October 19, 2009 applicable to a wide variety of missions using large focal planes with lar ge mosaics of sensors.

Kizhner, Semion↗

A General Closed-Form Solution for the Lunar Reconnaissance Orbiter (LRO) Antenna Pointing System

The National Aeronautics and Space Administration s (NASA) Lunar Reconnaissance Orbiter (LRO) launched on June 18, 2009 from the Cape Canaveral Air Force Station aboard an Atlas V launch vehicle into a direct insertion trajectory to the Moon LRO, designed, built, and operated by the NASA Goddard Space Flight Center in Greenbelt, MD, is gathering crucial data on the lunar environment that will help astronauts prepare for long-duration lunar expeditions. During the mission s nominal life of one year its six instruments and one technology demonstrator will find safe landing site, locate potential resources, characterize the radiation environment and test new technology. To date, LRO has been operating well within the bounds of its requirements and has been collecting excellent science data images taken from the LRO Camera Narrow Angle Camera (LROC NAC) of the Apollo landing sites have appeared on cable news networks. A significant amount of information on LRO s science instruments is provided at the LRO mission webpage. LRO s Attitude Control System (ACS), in addition to controlling the orientation of the spacecraft is also responsible for pointing the High Gain Antenna (HGA). A dual-axis (or double-gimbaled) antenna, deployed on a meter-long boom, is required to point at a selected Earth ground station. Due to signal loss over the distance from the Moon to Earth, pointing precision for the antenna system is very tight. Since the HGA has to be deployed in spaceflight, its exact geometry relative to the spacecraft body is uncertain. In addition, thermal distortions and mechanical errors/tolerances must be characterized and removed to realize the greatest gain from the antenna system. These reasons necessitate the need for an in-flight calibration. Once in orbit around the moon, a series of attitude maneuvers was conducted to provide data needed to determine optimal parameters to load onboard, which would account for the environmental and mechanical errors at any antenna orientation. The nominal geometry for the HGA involves an outer gimbal axis that is exactly perpendicular to the inner gimbal axis, and a target direction that is exactly perpendicular to the outer gimbal axis. For this nominal geometry, closed-form solutions of the desired gimbal angles are simple to get for a desired target direction specified in the spacecraft body fame. If the gimbal axes and the antenna boresight are slightly misaligned, the nominal closed-form solution is not sufficiently accurate for computing the gimbal angles needed to point at a target. In this situation, either a general closed-form solution has to be developed for a mechanism with general geometries, or a correction scheme has to be applied to the nominal closed-form solutions. The latter has been adopted for Solar Dynamics Observatory (SDO) as can be seen in Reference 1, and the former has been used for LRO. The advantage of the general closed-form solution is the use of a small number of parameters for the correction of nominal solutions, especially in the regions near singularities. Singularities here refer to cases when the nominal closed-form solutions have two or more solutions. Algorithm complexity, however, is the disadvantage of the general closed-form solution.

Shah, Neerav↗

Impact of Tactical and Strategic Weather Avoidance on Separation Assurance

The ability to keep flights away from weather hazards while maintaining aircraft-to-aircraft separation is critically important. The Advanced Airspace Concept is an automation concept that implements a ground-based strategic conflict resolution algorithm for management of aircraft separation. The impact of dynamic and uncertain weather avoidance on this concept is investigated. A strategic weather rerouting system is integrated with the Advanced Airspace Concept, which also provides a tactical weather avoidance algorithm, in a fast time simulation of the Air Transportation System. Strategic weather rerouting is used to plan routes around weather in the 20 minute to two-hour time horizon. To address forecast uncertainty, flight routes are revised at 15 minute intervals. Tactical weather avoidance is used for short term trajectory adjustments (30 minute planning horizon) that are updated every minute to address any weather conflicts (instances where aircraft are predicted to pass through weather cells) that are left unresolved by strategic weather rerouting. The fast time simulation is used to assess the impact of tactical weather avoidance on the performance of automated conflict resolution as well as the impact of strategic weather rerouting on both conflict resolution and tactical weather avoidance. The results demonstrate that both tactical weather avoidance and strategic weather rerouting increase the algorithm complexity required to find aircraft conflict resolutions. Results also demonstrate that tactical weather avoidance is prone to higher airborne delay than strategic weather rerouting. Adding strategic weather rerouting to tactical weather avoidance reduces total airborne delays for the reported scenario by 18% and reduces the number of remaining weather violations by 13%. Finally, two features are identified that have proven important for strategic weather rerouting to realize these benefits; namely, the ability to revise reroutes and the use of maneuvers that start far ahead of encountering a weather cell when rerouting around weather.

Refai, Mohamad S.↗

Monitoring and Acquisition Real-time System (MARS)

MARS is a graphical user interface (GUI) written in MATLAB and Java, allowing the user to configure and control the Scalable Parallel Architecture for Real-Time Acquisition and Analysis (SPARTAA) data acquisition system. SPARTAA not only acquires data, but also allows for complex algorithms to be applied to the acquired data in real time. The MARS client allows the user to set up and configure all settings regarding the data channels attached to the system, as well as have complete control over starting and stopping data acquisition. It provides a unique "Test" programming environment, allowing the user to create tests consisting of a series of alarms, each of which contains any number of data channels. Each alarm is configured with a particular algorithm, determining the type of processing that will be applied on each data channel and tested against a defined threshold. Tests can be uploaded to SPARTAA, thereby teaching it how to process the data. The uniqueness of MARS is in its capability to be adaptable easily to many test configurations. MARS sends and receives protocols via TCP/IP, which allows for quick integration into almost any test environment. The use of MATLAB and Java as the programming languages allows for developers to integrate the software across multiple operating platforms.

Holland, Corbin↗

Software Accelerates Computing Time for Complex Math

Ames Research Center awarded Newark, Delaware-based EM Photonics Inc. SBIR funding to utilize graphic processing unit (GPU) technology- traditionally used for computer video games-to develop high-computing software called CULA. The software gives users the ability to run complex algorithms on personal computers with greater speed. As a result of the NASA collaboration, the number of employees at the company has increased 10 percent.

Source record↗

Jettison Engineering Trajectory Tool

The Jettison Engineering Trajectory Tool (JETT) performs the jettison analysis function for any orbiting asset. It provides a method to compute the relative trajectories between an orbiting asset and any jettisoned item (intentional or unintentional) or sublimating particles generated by fluid dumps to assess whether an object is safe to jettison, or if there is a risk with an item that was inadvertently lost overboard. The main concern is the interaction and possible recontact of the jettisoned object with an asset. This supports the analysis that jettisoned items will safely clear the vehicle, ensuring no collisions. The software will reduce the jettison analysis task from one that could take days to complete to one that can be completed in hours, with an analysis that is more comprehensive than the previous method. It provides the ability to define the jettison operation relative to International Space Station (ISS) structure, and provides 2D and 3D plotting capability to allow an analyst to perform a subjective clearance assessment with ISS structures. The developers followed the SMP to create the code and all supporting documentation. The code makes extensive use of the object-oriented format of Java and, in addition, the Model-View-Controller architecture was used in the organization of the code, allowing each piece to be independent of updates to the other pieces. The model category is for maintaining data entered by the user and generated by the analysis. The view category provides capabilities for data entry and displaying all or a portion of the analysis data in tabular, 2D, and 3D representation. The controller category allows for handling events that affect the model or view(s). The JETT utilizes orbital mechanics with complex algorithms. Since JETT is written in JAVA, it is essentially platform-independent.

Zaczek, Mariusz↗

C++ Resource Intelligent Compilation for GPU Enabled Applications

We are nearing the limits of Moore's Law with current computing technology. As industries push for more performance from smaller systems, alternate methods of computation such as Graphics Processing Units (GPUs) should be considered. Many of these systems utilize the Compute Unified Device Architecture (CUDA) to give programmers access to individual compute elements of the GPU for general purpose computing tasks. Direct access to the GPU's parallel multi-core architecture enables highly efficient computation and can drastically reduce the time required for complex algorithms or data analysis. Of course not all systems have a CUDA-enabled device to leverage, and so applications must consider optional support for users with these devices. Resource Intelligent Compilation (RIC) addresses this situation by enabling GPU-based acceleration of existing applications without affecting users without GPUs. Resource Intelligent Compilation (RIC) creates C/C++ modules that can be compiled to create a standard CPU version or GPU accelerated version of a program, depending on hardware availability. This is accomplished through a toolbox of programming strategies based on features of the CUDA API. Using this toolbox, existing applications can be modified with ease to support GPU acceleration, and new applications can be generated with just a few simple modifications. All of this culminates in an accelerated application for users with the appropriate hardware, with no performance impact to standard systems. This memorandum presents all the important features involved in supporting and implementing RIC and an example of using RIC to accelerate an existing mathematical model, without removing support for standard users. Through this memorandum, NASA engineers can acquire a set of guidelines to follow for RIC-compliant development, seamlessly accelerating C/C++ applications.

GPU↗

Towards Resilient Autonomous Navigation of Drones

Robots and particularly drones are especially useful in exploring extreme environments that pose hazards to humans. To ensure safe operations in these situations, usually perceptually degraded and without good GNSS, it is critical to have a reliable and robust state estimation solution. The main body of literature in robot state estimation focuses on developing complex algorithms favoring accuracy. Typically, these approaches rely on a strong underlying assumption: the main estimation engine will not fail during operation. In contrast, we propose an architecture that pursues robustness in state estimation by considering redundancy and heterogeneity in both sensing and estimation algorithms. The architecture is designed to expect and detect failures and adapt the behavior of the system to ensure safety. To this end, we present HeRO (Heterogeneous Redundant Odometry): a stack of estimation algorithms running in parallel supervised by a resiliency logic. This logic carries out three main functions: a) perform confidence tests both in data quality and algorithm health; b) re-initialize those algorithms that might be malfunctioning; c) generate a smooth state estimate by multiplexing the inputs based on their quality. The state and quality estimates are used by the guidance and control modules to adapt the mobility behaviors of the system. The validation and utility of the approach are shown with real experiments on a ying robot for the use case of autonomous exploration of subterranean environments, with particular results from the STIX event of the DARPA Subterranean Challenge.

Agha-mohammadi, Ali-akbar↗

Using a Model of Scheduler Runtime to Improve the Effectiveness of Scheduling Embedded in Execution

Scheduling often interacts with execution. When the scheduler is developing a schedule, real time (execution) proceeds. Usually a scheduler cannot modify portions of the schedule expected to start execution prior to the scheduler's expected completion. In deployed systems, often little effort is spent on predicting scheduler runtime and instead an extremely conservative, simple model is used, resulting in loss of performance as less of the schedule can be updated. We develop predictive model(s) of scheduler runtime and use these models to improve scheduler and execution performance. We present several models of scheduler runtime based on a scheduler being deployed onboard NASA's next Mars rover, the M2020 rover Perseverance. The models consider algorithmic complexity, characteristics of the input plan, and prior runtime data. First, we show how these still relatively unsophisticated models can more accurately predict scheduler runtime compared to the static conservative baseline being used for the actual M2020 onboard scheduler. Second, we show how the more accurate scheduler runtime models' tighter (shorter) runtime predictions enable better scheduler performance as measured by makespan and percentage of activities executed. Finally, we discuss a number of future steps to further advance this line of work.

Chi, Wayne↗

A Linear-Complexity Tensor Butterfly Algorithm for Compressing High-Dimensional Oscillatory Integral Operators

This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a d-dimensional (d > 1) integral operator discretized into a 2d-mode tensor with n2d entries, the overall CPU time and memory requirement scale as O(nd), in stark contrast to the O(nd log n) complexity of existing matrix algorithms such as matrix butterfly algorithms and fast Fourier transforms (FFTs), where n is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents problems of scale over 512× larger than that existing butterfly algorithms can handle, with the same amount of computation resources. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algebraic matrix algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and 30× memory reduction compared with existing ones. Moreover, the tensor butterfly algorithm also permits O(nd)-complexity FFTs and Radon transforms up to d = 6 dimensions.

Kielstra, P Michael↗

The Computational Complexity, Parallel Scalability, and Performance of Atmospheric Data Assimilation Algorithms

The computational complexity of algorithms for Four Dimensional Data Assimilation (4DDA) at NASA's Data Assimilation Office (DAO) is discussed. In 4DDA, observations are assimilated with the output of a dynamical model to generate best-estimates of the states of the system. It is thus a mapping problem, whereby scattered observations are converted into regular accurate maps of wind, temperature, moisture and other variables. The DAO is developing and using 4DDA algorithms that provide these datasets, or analyses, in support of Earth System Science research. Two large-scale algorithms are discussed. The first approach, the Goddard Earth Observing System Data Assimilation System (GEOS DAS), uses an atmospheric general circulation model (GCM) and an observation-space based analysis system, the Physical-space Statistical Analysis System (PSAS). GEOS DAS is very similar to global meteorological weather forecasting data assimilation systems, but is used at NASA for climate research. Systems of this size typically run at between 1 and 20 gigaflop/s. The second approach, the Kalman filter, uses a more consistent algorithm to determine the forecast error covariance matrix than does GEOS DAS. For atmospheric assimilation, the gridded dynamical fields typically have More than 10(exp 6) variables, therefore the full error covariance matrix may be in excess of a teraword. For the Kalman filter this problem can easily scale to petaflop/s proportions. We discuss the computational complexity of GEOS DAS and our implementation of the Kalman filter. We also discuss and quantify some of the technical issues and limitations in developing efficient, in terms of wall clock time, and scalable parallel implementations of the algorithms.

Lyster, Peter M.↗

A gridless Euler/Navier-Stokes solution algorithm for complex-aircraft applications

The development of a gridless computational fluid dynamics (CFD) method for the solution of the two- and three-dimensional Euler and Navier-Stokes equations is described. The method uses only clouds of points and does not require that the points be connected to form a grid as is necessary in conventional CFD algorithms. The gridless CFD approach appears to resolve the inefficiencies encountered with structured or unstructured grid methods, and consequently offers great potential for accurately and efficiently solving viscous flows about complex aircraft configurations. The method is described in detail and calculations are presented for standard Euler and Navier-Stokes cases to assess the accuracy and efficiency of the capability.

Batina, John T.↗

A gridless Euler/Navier-Stokes solution algorithm for complex-aircraft applications

The development of a gridless computational fluid dynamics (CFD) method for the solution of the two- and three-dimensional Euler and Navier-Stokes equations is described. The method uses only clouds of points and does not require that the points be connected to form a grid as a necessary in conventional CFD algorithms. The gridless CFD approach appears to resolve the inefficiencies encountered with structured or unstructured grid methods, and consequently offers great potential for accurately and efficiently solving viscous flows about complex aircraft configurations. The method is described in detail and calculations are presented for standard Euler and Navier-Stokes cases to assess the accuracy and efficiency of the capability.

Batina, John T.↗

Implementation of Complex Signal Processing Algorithms for Position-Sensitive Microcalorimeters

We have recently reported on a theoretical digital signal-processing algorithm for improved energy and position resolution in position-sensitive, transition-edge sensor (POST) X-ray detectors [Smith et al., Nucl, lnstr and Meth. A 556 (2006) 2371. PoST's consists of one or more transition-edge sensors (TES's) on a large continuous or pixellated X-ray absorber and are under development as an alternative to arrays of single pixel TES's. PoST's provide a means to increase the field-of-view for the fewest number of read-out channels. In this contribution we extend the theoretical correlated energy position optimal filter (CEPOF) algorithm (originally developed for 2-TES continuous absorber PoST's) to investigate the practical implementation on multi-pixel single TES PoST's or Hydras. We use numerically simulated data for a nine absorber device, which includes realistic detector noise, to demonstrate an iterative scheme that enables convergence on the correct photon absorption position and energy without any a priori assumptions. The position sensitivity of the CEPOF implemented on simulated data agrees very well with the theoretically predicted resolution. We discuss practical issues such as the impact of random arrival phase of the measured data on the performance of the CEPOF. The CEPOF algorithm demonstrates that full-width-at- half-maximum energy resolution of < 8 eV coupled with position-sensitivity down to a few 100 eV should be achievable for a fully optimized device.

Smith, Stephen J.↗