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.
A Computationally Efficient Algorithm for Sampling the Rudd Differential Cross Section
Monte Carlo radiation transport codes such as RITRACKS or Geant4 are used to simulate the interaction of ions with matter. These codes rely on sampling algorithms to determine interactions and various physical properties of particles involved in the simulations. It is crucial to develop efficient sampling algorithms since Monte Carlo radiation transport simulations can be time consuming. This work presents an efficient sampling algorithm to determine the energy of secondary electrons following ion-water interactions. The applicability and intended use of the algorithm are discussed in detail, and it is shown that the new algorithm is up to 6X10 4 times faster than the method currently used in Geant4-DNA.
A parallel trajectory optimization tool for aerospace plane guidance
A parallel trajectory optimization algorithm is being developed. One possible mission is to provide real-time, on-line guidance for the National Aerospace Plane. The algorithm solves a discrete-time problem via the augmented Lagrangian nonlinear programming algorithm. The algorithm exploits the dynamic programming structure of the problem to achieve parallelism in calculating cost functions, gradients, constraints, Jacobians, Hessian approximations, search directions, and merit functions. Special additions to the augmented Lagrangian algorithm achieve robust convergence, achieve (almost) superlinear local convergence, and deal with constraint curvature efficiency. The algorithm can handle control and state inequality constraints such as angle-of-attack and dynamic pressure constraints. Portions of the algorithm have been tested. The nonlinear programming core algorithm performs well on a variety of static test problems and on an orbit transfer problem. The parallel search direction algorithm can reduce wall clock time by a factor of 10 for this part of the computation task.
Interactive digital signal processor
The Interactive Digital Signal Processor (IDSP) is examined. It consists of a set of time series analysis Operators each of which operates on an input file to produce an output file. The operators can be executed in any order that makes sense and recursively, if desired. The operators are the various algorithms used in digital time series analysis work. User written operators can be easily interfaced to the sysatem. The system can be operated both interactively and in batch mode. In IDSP a file can consist of up to n (currently n=8) simultaneous time series. IDSP currently includes over thirty standard operators that range from Fourier transform operations, design and application of digital filters, eigenvalue analysis, to operators that provide graphical output, allow batch operation, editing and display information.
Secondary frequencies in the wake of a circular cylinder with vortex shedding
A detailed numerical study of two-dimensional flow past a circular cylinder at moderately low Reynolds numbers was conducted using three different numerical algorithms for solving the time-dependent compressible Navier-Stokes equations. It was found that if the algorithm and associated boundary conditions were consistent and stable, then the major features of the unsteady wake were well-predicted. However, it was also found that even stable and consistent boundary conditions could introduce additional periodic phenomena reminiscent of the type seen in previous wind-tunnel experiments. However, these additional frequencies were eliminated by formulating the boundary conditions in terms of the characteristic variables. An analysis based on a simplified model provides an explanation for this behavior.
Secondary frequencies in the wake of a circular cylinder with vortex shedding
A detailed numerical study of two-dimensional flow past a circular cylinder at moderately low Reynolds numbers was conducted using three different numerical algorithms for solving the time-dependent compressible Navier-Stokes equations. It was found that if the algorithm and associated boundary conditions were consistent and stable, then the major features of the unsteady wake were well-predicted. However, it was also found that even stable and consistent boundary conditions could introduce additional periodic phenomena reminiscent of the type seen in previous wind-tunnel experiments. However, these additional frequencies were eliminated by formulating the boundary conditions in terms of the characteristic variables. An analysis based on a simplified model provides an explanation for this behavior.
Passive stereo range imaging for semi-autonomous land navigation
The paper examines the use of stereo vision (SV) for obstacle detection in semiautonomous land navigation. Feature-based and field-based paradigms for SV are reviewed. The paper presents stochastic models and simple, efficient stereo matching algorithms for the field-based approach and describes a near-real-time vision system using these algorithms. Experimental results illustrate aspects of the stochastic models and lead to the first semiautonomous traversals of natural terrain to use SV for obstacle detection.
Novel techniques for data decomposition and load balancing for parallel processing of vision systems: Implementation and evaluation using a motion estimation system
Computer vision systems employ a sequence of vision algorithms in which the output of an algorithm is the input of the next algorithm in the sequence. Algorithms that constitute such systems exhibit vastly different computational characteristics, and therefore, require different data decomposition techniques and efficient load balancing techniques for parallel implementation. However, since the input data for a task is produced as the output data of the previous task, this information can be exploited to perform knowledge based data decomposition and load balancing. Presented here are algorithms for a motion estimation system. The motion estimation is based on the point correspondence between the involved images which are a sequence of stereo image pairs. Researchers propose algorithms to obtain point correspondences by matching feature points among stereo image pairs at any two consecutive time instants. Furthermore, the proposed algorithms employ non-iterative procedures, which results in saving considerable amounts of computation time. The system consists of the following steps: (1) extraction of features; (2) stereo match of images in one time instant; (3) time match of images from consecutive time instants; (4) stereo match to compute final unambiguous points; and (5) computation of motion parameters.
Enhancements on the Convex Programming Based Powered Descent Guidance Algorithm for Mars Landing
In this paper, we present enhancements on the powered descent guidance algorithm developed for Mars pinpoint landing. The guidance algorithm solves the powered descent minimum fuel trajectory optimization problem via a direct numerical method. Our main contribution is to formulate the trajectory optimization problem, which has nonconvex control constraints, as a finite dimensional convex optimization problem, specifically as a finite dimensional second order cone programming (SOCP) problem. SOCP is a subclass of convex programming, and there are efficient SOCP solvers with deterministic convergence properties. Hence, the resulting guidance algorithm can potentially be implemented onboard a spacecraft for real-time applications. Particularly, this paper discusses the algorithmic improvements obtained by: (i) Using an efficient approach to choose the optimal time-of-flight; (ii) Using a computationally inexpensive way to detect the feasibility/ infeasibility of the problem due to the thrust-to-weight constraint; (iii) Incorporating the rotation rate of the planet into the problem formulation; (iv) Developing additional constraints on the position and velocity to guarantee no-subsurface flight between the time samples of the temporal discretization; (v) Developing a fuel-limited targeting algorithm; (vi) Initial result on developing an onboard table lookup method to obtain almost fuel optimal solutions in real-time.
Method of separation of celestial gamma-ray bursts from solar flares
We recently discovered 217 'new' celestial gamma-ray burst candidates from the 'new' burst search of the PVO real time data base. The burst search covered the time period from September 1978 to July 1988. Sixty were confirmed by at least one other spacecraft, e.g., ISEE-3, V-II, V-12, etc. None triggered the PVO high time resolution memory. In this paper we describe a new algorithm based on the relationship between time width T(w) and hardness ratio HR, to distinguish cosmic gamma-ray bursts from solar flares without knowing the directions of the events. The algorithm was tested with 83 triggered and 60 nontriggered confirmed gamma-ray bursts and 30 confirmed solar flares from PVO.
Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing
An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.
Close-mode identification performance of the ITD algorithm
Results of Monte Carlo numerical simulations conducted to study the close-mode performance of the Ibrahim Time-Domain (ITD) modal identification algorithm are presented. The ITD technique is a matrix eigensolution method for obtaining structural modal parameters directly from free-response test data without using the FFT. Thus, the well-known resolution and leakage limitations of the FFT procedure, that are particularly significant with short records, are avoided. As an example, one of several experimental data analyses where close modes have been accurately identified using very short records is shown. Although the identification scatter is found to increase as the square of reductions in frequency separation at small separations, the ability to differentiate modes spaced at fractions of the FFT resolution is substantiated.
Distributed Spatiotemporal Motion Planning for Spacecraft Swarms in Cluttered Environments
This paper focuses on trajectory planning for spacecraft swarms in cluttered environments, like debris fields or the asteroid belt. Our objective is to reconfigure the spacecraft swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with obstacles. In our prior work we proposed a novel distributed guidance algorithm for spacecraft swarms in static environments. In this paper, we present the Multi-Agent Moving-Obstacles Spherical Expansion and Sequential Convex Programming (MAMO SE-SCP) algorithm that extends our prior work to include spatiotemporal constraints such as time-varying, moving obstacles and desired time-varying terminal positions. In the MAMO SE-SCP algorithm, each agent uses a spherical-expansion-based sampling algorithm to cooperatively explore the time-varying environment, a distributed assignment algorithm to agree on the terminal position for each agent, and a sequential-convex-programming-based optimization step to compute the locally-optimal trajectories from the current location to the assigned time-varying terminal position while avoiding collision with other agents and moving obstacles. Simulation results demonstrate that the proposed distributed algorithm can be used by a spacecraft swarm to achieve a time-varying, desired formation around an object of interest in a dynamic environment with many moving and tumbling obstacles.
Advanced detection, isolation, and accommodation of sensor failures in turbofan engines: Real-time microcomputer implementation
The objective of the Advanced Detection, Isolation, and Accommodation Program is to improve the overall demonstrated reliability of digital electronic control systems for turbine engines. For this purpose, an algorithm was developed which detects, isolates, and accommodates sensor failures by using analytical redundancy. The performance of this algorithm was evaluated on a real time engine simulation and was demonstrated on a full scale F100 turbofan engine. The real time implementation of the algorithm is described. The implementation used state-of-the-art microprocessor hardware and software, including parallel processing and high order language programming.
Mapping Forest Disturbance Intensity in North and South Carolina Using Annual Landsat Observations and Field Inventory Data
Disturbance and regrowth are vital processes in determining the roles of forest ecosystem in the carbon and biogeochemical cycles. Using time series observations, the vegetation change tracker (VCT) algorithm was designed to map the location, timing, and spectral magnitudes of forest disturbance events. While these spectral disturbance magnitudes are indicative of physical changes in tree cover or biomass, their quantitative relationships have yet to be established. This study focuses on estimating disturbance intensity as measured by percent basal area removal using spectral indices from the VCT algorithm over North and South Carolina. Repeat measurements on Forest Service Forest Inventory Analysis (FIA) ground plots, which provide changes in basal area between multiple dates at precise locations, are used for training and validation of the model. The overall R2 between predicted disturbance intensity and reference data is 0.66, and cross-validation prediction uncertainty is 14% in North Carolina. Possible causes of this uncertainty could be site heterogeneity and the temporal offset between ground measurements and satellite observations. Results show the area of stand clearing disturbances remains relatively stable around 1143 km2 yr−1 in North and South Carolina throughout the period of observations (1985–2015). The average amount of forest area affected by partial disturbance is much higher at 3287 km2 yr−1. The area of partial disturbances has strong inter-annual variability with a high value of 6000 km2 in 2007 and a low value of 1919 km2 in 2013.
A real-time robot arm collision detection system
A data structure and update algorithm are presented for a prototype real time collision detection safety system for a multi-robot environment. The data structure is a variant of the octree, which serves as a spatial index. An octree recursively decomposes 3-D space into eight equal cubic octants until each octant meets some decomposition criteria. The octree stores cylspheres (cylinders with spheres on each end) and rectangular solids as primitives (other primitives can easily be added as required). These primitives make up the two seven degrees-of-freedom robot arms and environment modeled by the system. Octree nodes containing more than a predetermined number N of primitives are decomposed. This rule keeps the octree small, as the entire environment for the application can be modeled using a few dozen primitives. As robot arms move, the octree is updated to reflect their changed positions. During most update cycles, any given primitive does not change which octree nodes it is in. Thus, modification to the octree is rarely required. Incidents in which one robot arm comes too close to another arm or an object are reported. Cycle time for interpreting current joint angles, updating the octree, and detecting/reporting imminent collisions averages 30 milliseconds on an Intel 80386 processor running at 20 MHz.