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,027 records · Page 57

A Robust Vision-Based Algorithm for Detecting and Classifying Small Orbital Debris Using On-Board Optical Cameras

This study develops a vision-based detection and classification algorithm to address the challenges of in-situ small orbital debris environment classification including debris observability and instrument requirements for small debris observation. The algorithm operates in near real time and is robust under difficult tasks in moving objects classification such as multiple moving objects, objects with various movement trajectories and speeds, very small or faint objects, and substantial background motion. The performance of the algorithm is optimized and validated using space image data available through simulated environments generated using NASA Marshall Space Flight Centers Dynamic Star Field Simulator of on-board optical sensors and cameras.

Zamani, Yasin↗

Development and application of a local linearization algorithm for the integration of quaternion rate equations in real-time flight simulation problems

High angular rates encountered in real-time flight simulation problems may require a more stable and accurate integration method than the classical methods normally used. A study was made to develop a general local linearization procedure of integrating dynamic system equations when using a digital computer in real-time. The procedure is specifically applied to the integration of the quaternion rate equations. For this application, results are compared to a classical second-order method. The local linearization approach is shown to have desirable stability characteristics and gives significant improvement in accuracy over the classical second-order integration methods.

Barker, L. E., Jr.↗

Hypersonic flow past open cavities

The hypersonic flow over a cavity is investigated. The time-dependent compressible Navier-Stokes equations are numerically solved. An implicit algorithm, with a subiteration procedure to recover time accuracy, is used to perform the time-accurate computations. The objective of the study is to investigate the effects of Reynolds number and cavity dimensions. The comparsion of the computations with available experimental data, in terms of time mean static pressure, heat transfer, and Mach number, show good agreement. In the computations large vortex structures, which adversely affect the cavity flow characteristics, are observed at the rear of the cavity. A self-sustained oscillatory motion occurs within the cavity over a range of Reynolds number and cavity dimensions. The frequency spectra of the oscillations show good agreement with a modified semiempirical relation.

Morgenstern, Algacyr, Jr.↗

Detection and Correction of Step Discontinuities in Kepler Flux Time Series

PDC 8.0 includes an implementation of a new algorithm to detect and correct step discontinuities appearing in roughly one of every 20 stellar light curves during a given quarter. The majority of such discontinuities are believed to result from high-energy particles (either cosmic or solar in origin) striking the photometer and causing permanent local changes (typically -0.5%) in quantum efficiency, though a partial exponential recovery is often observed [1]. Since these features, dubbed sudden pixel sensitivity dropouts (SPSDs), are uncorrelated across targets they cannot be properly accounted for by the current detrending algorithm. PDC detrending is based on the assumption that features in flux time series are due either to intrinsic stellar phenomena or to systematic errors and that systematics will exhibit measurable correlations across targets. SPSD events violate these assumptions and their successful removal not only rectifies the flux values of affected targets, but demonstrably improves the overall performance of PDC detrending [1].

Kolodziejczak, J. J.↗

Demonstration of Prognostics-Enabled Decision Making Algorithms on a Hardware Mobile Robot Test Platform

Prognostics-enabled Decision Making (PDM) is an emerging research area that aims to integrate prognostic health information and knowledge about the future operating conditions into the process of selecting subsequent actions for the system. Previous work developing and testing PDM algorithms has been done in simulation; this paper describes the effort leading to a successful demonstration of PDM algorithms on a hardware mobile robot platform. The hardware platform, based on the K11 planetary rover prototype, was modified to allow injection of selected fault modes related to the rover’s electrical power subsystem. The PDM algorithms were adapted to the hardware platform, including development of a software module framework, a new route planner, and modifications to increase the algorithms’ robustness to sensor noise and system timing issues. A set of test scenarios was chosen to demonstrate the algorithms’ capabilities. The modifications to run with a hardware platform, the test scenarios, and the test results are described in detail. The results show a successful use of PDM algorithms on a hardware test platform to optimize mission planning in the presence of electrical system faults.

Prognosis↗

A conservative implicit finite difference algorithm for the unsteady transonic full potential equation

An implicit finite difference procedure is developed to solve the unsteady full potential equation in conservation law form. Computational efficiency is maintained by use of approximate factorization techniques. The numerical algorithm is first order in time and second order in space. A circulation model and difference equations are developed for lifting airfoils in unsteady flow; however, thin airfoil body boundary conditions have been used with stretching functions to simplify the development of the numerical algorithm.

Steger, J. L.↗

Optical rate sensor algorithms

Optical sensors, in particular Charge Coupled Device (CCD) arrays, will be used on Space Station to track stars in order to provide inertial attitude reference. Algorithms are presented to derive attitude rate from the optical sensors. The first algorithm is a recursive differentiator. A variance reduction factor (VRF) of 0.0228 was achieved with a rise time of 10 samples. A VRF of 0.2522 gives a rise time of 4 samples. The second algorithm is based on the direct manipulation of the pixel intensity outputs of the sensor. In 1-dimensional simulations, the derived rate was with 0.07 percent of the actual rate in the presence of additive Gaussian noise with a signal to noise ratio of 60 dB.

Uhde-Lacovara, Jo A.↗

Attributes of GRB Pulses: Analysis of BATSE TTE Data

Our extensive program of modeling GRB profiles is aimed at elucidating the physical processes responsible for the burst itself, as well as possible extrinsic phenomena (e.g. time dilation) as discussed in another paper in this Symposium (Norris et al., "GRB PROFILES AS COSMIC PROBES"). We have developed special methods to extract the wealth of short time-scale information contained in the BATSE time-tag event (TTE) data. Our algorithm yields a piecewise-constant representation of the light curve -- using only the raw photon arrival times, and based on Bayesian change-point methods. This representation in effect lets the data determine the bin size and location, and avoids unwanted effects due to arbitrary choices of the bin parameters. We have determined widths, separations, and amplitudes of pulses contained in the bursts, without invoking a specific pulse model. The effect of cosmic time dilation can be easily seen in a direct plot of amplitude vs. time scale for individual pulses, without the need to lump the data into a small number of brightness classes. We are also performing noise equalization on these data (to reduce a well-known bias of pulse width as a function of signal-to-noise ratio), as well as fits of parametric pulse-shape models -- including explicit energy dependence of the pulse parameters. Such refinements are expected to improve the quality and physical significance of these results.

Norris, J. P.↗

Terminal guidance and navigation for comet and asteroid rendezvous

A terminal guidance and navigation scheme developed in earlier work was modified and evaluated for a solar electric propulsion rendezvous mission to comet Encke. The scheme is intended for autonomous, on-board use. The guidance algorithm is based on optimal control theory and minimizes the time integrated square of thrust acceleration. The navigation algorithm employs a modified Kalman filter set in measurement variables. Random sequences were generated to simulate measurement errors, and the evaluation was conducted with detailed numerical computations which include actual motions of spacecraft and comet. The evaluations showed that the scheme attains rendezvous and maintains station after rendezvous within less than 10 km for estimated best measurements and within less than 100 km for estimated worst measurements. The measurements required are angles, range, and range rate. Angles and range appear to be absolutely necessary; range rate is not as strong a measurement type, and further modifications of the filter will allow a scheme that does not require the rate measurements.

Bennett, A. G.↗

Fault-tolerant clock synchronization in distributed systems

Existing fault-tolerant clock synchronization algorithms are compared and contrasted. These include the following: software synchronization algorithms, such as convergence-averaging, convergence-nonaveraging, and consistency algorithms, as well as probabilistic synchronization; hardware synchronization algorithms; and hybrid synchronization. The worst-case clock skews guaranteed by representative algorithms are compared, along with other important aspects such as time, message, and cost overhead imposed by the algorithms. More recent developments such as hardware-assisted software synchronization and algorithms for synchronizing large, partially connected distributed systems are especially emphasized.

Ramanathan, Parameswaran↗

Multigrid schemes for viscous hypersonic flows

Several multigrid schemes are considered for the numerical computation of viscous hypersonic flows. For each scheme, the basic solution algorithm employs upwind spatial discretization with explicit multistage time stepping. Two-level versions of the various multigrid algorithms are applied to the two-dimensional advection equation, and Fourier analysis is used to determine their damping properties. The capabilities of the multigrid methods are assessed by solving two different hypersonic flow problems. Some new multigrid schemes, based on semicoarsening strategies, are shown to be quite effective in relieving the stiffness caused by the high-aspect-ratio cells required to resolve high Reynolds number flows. These schemes exhibit good convergence rates for Reynolds numbers up to 200 x 10(exp 6).

Swanson, R. C.↗

CropEx Web-Based Agricultural Monitoring and Decision Support

CropEx is a Web-based agricultural Decision Support System (DSS) that monitors changes in crop health over time. It is designed to be used by a wide range of both public and private organizations, including individual producers and regional government offices with a vested interest in tracking vegetation health. The database and data management system automatically retrieve and ingest data for the area of interest. Another stores results of the processing and supports the DSS. The processing engine will allow server-side analysis of imagery with support for image sub-setting and a set of core raster operations for image classification, creation of vegetation indices, and change detection. The system includes the Web-based (CropEx) interface, data ingestion system, server-side processing engine, and a database processing engine. It contains a Web-based interface that has multi-tiered security profiles for multiple users. The interface provides the ability to identify areas of interest to specific users, user profiles, and methods of processing and data types for selected or created areas of interest. A compilation of programs is used to ingest available data into the system, classify that data, profile that data for quality, and make data available for the processing engine immediately upon the data s availability to the system (near real time). The processing engine consists of methods and algorithms used to process the data in a real-time fashion without copying, storing, or moving the raw data. The engine makes results available to the database processing engine for storage and further manipulation. The database processing engine ingests data from the image processing engine, distills those results into numerical indices, and stores each index for an area of interest. This process happens each time new data is ingested and processed for the area of interest, and upon subsequent database entries, the database processing engine qualifies each value for each area of interest and conducts a logical processing of results indicating when and where thresholds are exceeded. Reports are provided at regular, operator-determined intervals that include variances from thresholds and links to view raw data for verification, if necessary. The technology and method of development allow the code base to easily be modified for varied use in the real-time and near-real-time processing environments. In addition, the final product will be demonstrated as a means for rapid draft assessment of imagery.

Harvey. Craig↗

Small Body GN&C Research Report: A G-Guidance Enhancement to Increase Mission Functionality

G-Guidance is a robust G&C (guidance and control) algorithm developed under the small-body GN&C task. The G-Guidance scheme utilizes a model predictive control approach, along with a convexification of the governing dynamics, control constraints, and trajectory/state constraints. This report details an enhancement to the FY2005 G-Guidance algorithm; the addition of a fire-second approach helps to nullify velocity errors and hit desired final velocities much more precisely than the original Fire-first scheme developed in FY2005. The enhancement preserves the primary benefit of the algorithm, which is to ensure required thruster silent times during trajectory maneuvers. The fire-second scheme increases the versatility of the algorithm for missions employing G-Guidance. For instance, a landing sequence could employ the fire-second scheme to ensure a null final velocity at landing, whereas an ascent sequence could utilize a fire-first scheme to ensure there is no drift of the spacecraft toward the ground at the beginning of the maneuver. Examples are provided within to demonstrate a fire-first versus fire-second guidance scheme. As in the existing G-Guidance algorithm, the examples and schemes incorporate gravity models and thruster firing times into discrete dynamics that are solved as a optimal control problem to minimize fuel consumption or thruster energy expenditure.

velocity errors↗

Very fast motion planning for highly dexterous-articulated robots

Due to the inherent danger of space exploration, the need for greater use of teleoperated and autonomous robotic systems in space-based applications has long been apparent. Autonomous and semi-autonomous robotic devices have been proposed for carrying out routine functions associated with scientific experiments aboard the shuttle and space station. Finally, research into the use of such devices for planetary exploration continues. To accomplish their assigned tasks, all such autonomous and semi-autonomous devices will require the ability to move themselves through space without hitting themselves or the objects which surround them. In space it is important to execute the necessary motions correctly when they are first attempted because repositioning is expensive in terms of both time and resources (e.g., fuel). Finally, such devices will have to function in a variety of different environments. Given these constraints, a means for fast motion planning to insure the correct movement of robotic devices would be ideal. Unfortunately, motion planning algorithms are rarely used in practice because of their computational complexity. Fast methods have been developed for detecting imminent collisions, but the more general problem of motion planning remains computationally intractable. However, in this paper we show how the use of multicomputers and appropriate parallel algorithms can substantially reduce the time required to synthesize paths for dexterous articulated robots with a large number of joints. We have developed a parallel formulation of the Randomized Path Planner proposed by Barraquand and Latombe. We have shown that our parallel formulation is capable of formulating plans in a few seconds or less on various parallel architectures including: the nCUBE2 multicomputer with up to 1024 processors (nCUBE2 is a registered trademark of the nCUBE corporation), and a network of workstations.

Challou, Daniel J.↗

Effect of Uncertainty of Identified Parameters on Structural Damage Detection

This paper presents a study of the effect of the uncertainty of identified parameters on the damage detection of structure. The identified parameters, which are obtained by applying system identification algorithms to analyze the time-domain response data, have uncertainty due to noise, environmental change, etc. The damage of some structural elements may have less effect on the identified parameters than noise or environmental change, so some damage situations cannot be distinguished under these circumstances. An algorithm is presented to determine whether the considered damage can be distinguished. A twenty-bay truss structure is used to demonstrate and verify the study.

Davidson, Mario↗

An Eigensystem Realization Algorithm in Frequency Domain for modal parameter identification

This paper demonstrates the close conceptual relationships between time domain and frequency domain approaches to identification of modal parameters for linear systems. A frequency domain eigensystem realization algorithm, via transfer functions, is developed using a known procedure formulated for a time domain eigensystem realization algorithm, via free decay measurement data. An important feature is the capability of windowing to concentrate analysis on the frequency range of interest. The procedure of overlap averaging is used to produce smoother spectra to reduce the effect of noise on identified modal parameters. Examples from simulation and experiments are given to illustrate the validity of formulations derived in the paper.

Juang, J.-N.↗

Efficient scheduling algorithm for demand-assigned TDMA satellite systems

An efficient scheduling algorithm (stations burst plan) for demand-assigned time-division multiple-access (TDMA) satellite network systems is introduced. The total demand for transmitting data through a transponder may exceed the available bit-rate capacity, and a scheduler of the system wishes to utilize the system with minimum changes of slot allocations while maximizing throughputs. By implementing such a burst-plan algorithm, transmission of all demanded data traffic can be completed with minimum unused resources (idle slots). The underlying ideas adopted for the algorithm are that jobs with shorter remaining processing times should have higher priorities and that as many jobs are processed at a time as possible. The algorithm is particularly useful for deriving smooth burst plans for a satellite system with a large number of ground stations.

Durrani, Sajjad H.↗

A Virtual Laboratory for Aviation and Airspace Prognostics Research

Integration of Unmanned Aerial Vehicles (UAVs), autonomy, spacecraft, and other aviation technologies, in the airspace is becoming more and more complicated, and will continue to do so in the future. Inclusion of new technology and complexity into the airspace increases the importance and difficulty of safety assurance. Additionally, testing new technologies on complex aviation systems and systems of systems can be challenging, expensive, and at times unsafe when implementing real life scenarios. The application of prognostics to aviation and airspace management may produce new tools and insight into these problems. Prognostic methodology provides an estimate of the health and risks of a component, vehicle, or airspace and knowledge of how that will change over time. That measure is especially useful in safety determination, mission planning, and maintenance scheduling. In our research, we develop a live, distributed, hardware- in-the-loop Prognostics Virtual Laboratory testbed for aviation and airspace prognostics. The developed testbed will be used to validate prediction algorithms for the real-time safety monitoring of the National Airspace System (NAS) and the prediction of unsafe events. In our earlier work1 we discussed the initial Prognostics Virtual Laboratory testbed development work and related results for milestones 1 & 2. This paper describes the design, development, and testing of the integrated tested which are part of milestone 3, along with our next steps for validation of this work. Through a framework consisting of software/hardware modules and associated interface clients, the distributed testbed enables safe, accurate, and inexpensive experimentation and research into airspace and vehicle prognosis that would not have been possible otherwise. The testbed modules can be used cohesively to construct complex and relevant airspace scenarios for research. Four modules are key to this research: the virtual aircraft module which uses the X-Plane simulator and X-PlaneConnect toolbox, the live aircraft module which connects fielded aircraft using onboard cellular communications devices, the hardware in the loop (HITL) module which connects laboratory based bench-top hardware testbeds and the research module which contains diagnostics and prognostics tools for analysis of live air traffic situations and vehicle health conditions. The testbed also features other modules for data recording and playback, information visualization, and air traffic generation. Software reliability, safety, and latency are some of the critical design considerations in development of the testbed.

LVC-DE↗