Performance of Flash Lidar with Real-time Image Enhancement Algorithm for Landing Hazard Avoidance
Explore the source record for details and available documents.
Hazard Detection↗
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.
Near-Optimum Real-Time Range Estimation Algorithms for Proximity Links
No abstract provided
Cheung, Kar-Ming↗
Stochastic approximation algorithms for linear discrete-time system identification.
Stochastic approximation algorithms for identification of linear discrete time systems
Saridis, G. N.↗
Solution of Ordinary Differential Equations in Gradient-Based Multidisciplinary Design Optimization
A gradient-based approach to multidisciplinary design optimization enables efficient scalability to large numbers of design variables. However, the need for derivatives causes difficulties when integrating ordinary differential equations (ODEs) in models. To simplify this, we propose the use of the general linear methods framework, which unifies all Runge-Kutta and linear multistep methods. This approach enables rapid implementation of integration methods without the need to differentiate each one, even in a gradient-based optimization context. We also develop a new parallel time integration algorithm that enables vectorization across time steps. We present a set of benchmarking results using a stiff ODE, a non-stiff nonlinear ODE, and an orbital dynamics ODE, and compare integration methods. In a modular gradient-based multidisciplinary design optimization context, we find that the new parallel time integration algorithm with high-order implicit methods, especially Gauss-Legendre collocation, is the best choice for a broad range of problems.
Hwang, John T.↗
Computationally efficient algorithms for real-time attitude estimation
For many practical spacecraft applications, algorithms for determining spacecraft attitude must combine inputs from diverse sensors and provide redundancy in the event of sensor failure. A Kalman filter is suitable for this task, however, it may impose a computational burden which may be avoided by sub optimal methods. A suboptimal estimator is presented which was implemented successfully on the Delta Star spacecraft which performed a 9 month SDI flight experiment in 1989. This design sought to minimize algorithm complexity to accommodate the limitations of an 8K guidance computer. The algorithm used is interpreted in the framework of Kalman filtering and a derivation is given for the computation.
Pringle, Steven R.↗
Algorithms for real-time flutter identification
The work reported here addresses the important algorithm issues necessary to achieve a real-time flutter monitoring system; namely, the guidelines for choosing appropriate model forms, reduction of the parameter convergence transient, handling multiple modes, the effect of overparameterization, and estimate accuracy predictions, both online and for experiment design. An approach for efficiently computing continuous-time flutter parameter Cramer-Rao estimate error bounds has been developed. This enables a convincing comparison of theoretical and simulation results, as well as off-line studies in preparation for a flight test. Theoretical predictions, simulation and flight test results from the NASA/Dryden Drones for Aerodynamic and Structural Test (DAST) Program are compared.
Walker, R. A.↗
A comparison of time-optimal interception trajectories for the F-8 and F-15
The simulation results of a real time control algorithm for onboard computation of time-optimal intercept trajectories for the F-8 and F-15 aircraft are given. Due to the inherent aerodynamic and propulsion differences in the aircraft, there are major differences in their optimal trajectories. The significant difference in the two aircrafts are their flight envelopes. The F-8's optimal cruise velocity is thrust limited, while the F-15's optimal cruise velocity is at the intersection of the Mach and dynamic pressure constraint boundaries. This inherent difference necessitated the development of a proportional thrust controller for use as the F-15 approaches it's optimal cruise energy. Documented here is the application of singular perturbation theory to the trajectory optimization problem, along with a summary of the control algorithms. Numerical results for the two aircraft are compared to illustrate the performance of the minimum time algorithm, and to compute the resulting flight paths.
Calise, Anthony J.↗
Improvement of mixed time implicit-explicit algorithms for thermal analysis of structures
Computer implementation aspects and numerical evaluation of the recently introduced mixed time implicit-explicit algorithms in thermal analysis of structures are presented. A computationally useful method of estimating the critical time step for a linear quadrilateral element is given herein for the methods introduced by Liu and co-workers. Numerical tests confirm the stability criterion and accuracy characteristics of the methods. The superiority of these mixed time methods to the fully implicit method or the fully explicit method is also demonstrated.
Liu, W. K.↗
Implementation of Real-Time Feedback Flow Control Algorithms on a Canonical Testbed
This report summarizes the activities on "Implementation of Real-Time Feedback Flow Control Algorithms on a Canonical Testbed." The work summarized consists primarily of two parts. The first part summarizes our previous work and the extensions to adaptive ID and control algorithms. The second part concentrates on the validation of adaptive algorithms by applying them to a vibration beam test bed. Extensions to flow control problems are discussed.
Tian, Ye↗
An efficient and robust algorithm for two dimensional time dependent incompressible Navier-Stokes equations: High Reynolds number flows
An algorithm is presented for unsteady two-dimensional incompressible Navier-Stokes calculations. This algorithm is based on the fourth order partial differential equation for incompressible fluid flow which uses the streamfunction as the only dependent variable. The algorithm is second order accurate in both time and space. It uses a multigrid solver at each time step. It is extremely efficient with respect to the use of both CPU time and physical memory. It is extremely robust with respect to Reynolds number.
Goodrich, John W.↗
An efficient and robust algorithm for two dimensional time dependent incompressible Navier-Stokes equations - High Reynolds number flows
An algorithm is presented for unsteady two-dimensional incompressible Navier-Stokes calculations. This algorithm is based on the fourth order partial differential equation for incompressible fluid flow which uses the streamfunction as the only dependent variable. The algorithm is second order accurate in both time and space. It uses a multigrid solver at each time step. It is extremely efficient with respect to the use of both CPU time and physical memory. It is extremely robust with respect to Reynolds number.
Goodrich, John W.↗
Massively Parallel Algorithms for Real-Time Wavefront Control of a Dense Adaptive Optics System
In this paper massively parallel algorithms and architectures for real-time wavefront control of a dense adaptive optic system (SELENE) are presented. We have already shown that the computation of a near optimal control algorithm for SELENE can be reduced to the solution of a discrete Poisson equation on a regular domain. Although this represents an optimal computation, due the large size of the system and the high sampling rate requirement, the implementation of this control algorithm poses a computationally challenging problem since it demands a sustained computational throughput of the order of 10 GFlops. We develop a novel algorithm, designated as Fast Invariant Imbedding algorithm, which offers a massive degree of parallelism with simple communication and synchronization requirements. Due to these features, our algorithm is significantly more efficient than other Fast Poisson Solvers for implementation on massively parallel architectures.
massively↗
Spectral methods in time for parabolic problems
A pseudospectral explicit scheme for solving linear, periodic, parabolic problems is described which has infinite accuracy both in time and in space. The high accuracy is achieved while the time resolution parameter M ( = ) (1/delta t) for time marching algorithm) and the space resolution parameter N B = O(1/detla x) have to satisfy M = O(N sup/+epsilon) epsilon O, compared to the common stability condition M = O(N sup 2) which has to be satisfied in any explicit finite order time algorithm.
Tal-Ezer, H.↗
Implementation of a Point Algorithm for Real-Time Convex Optimization
The primal-dual interior-point algorithm implemented in G-OPT is a relatively new and efficient way of solving convex optimization problems. Given a prescribed level of accuracy, the convergence to the optimal solution is guaranteed in a predetermined, finite number of iterations. G-OPT Version 1.0 is a flight software implementation written in C. Onboard application of the software enables autonomous, real-time guidance and control that explicitly incorporates mission constraints such as control authority (e.g. maximum thrust limits), hazard avoidance, and fuel limitations. This software can be used in planetary landing missions (Mars pinpoint landing and lunar landing), as well as in proximity operations around small celestial bodies (moons, asteroids, and comets). It also can be used in any spacecraft mission for thrust allocation in six-degrees-of-freedom control.
Acikmese, Behcet↗
Enhancing the Traffic Management Advisor's Schedule by Time Advance
A time advance algorithm associated with the scheduling functionalities of the Traffic Management Advisor (TMA) for arrival flights is presented and evaluated. The algorithm enhances TMA's meter fix schedule by advancing the flights' Scheduled Time of Arrival (STA) by an amount that minimizes their systemic operating cost. The systemic operating cost leverages the inherent trade-off of time and fuel efficiency resident in the cost index of modern flight management systems. The resulting STAs are achievable by speeding up the leading flights from their desired nominal speed profiles. A key advantage of this approach is that it reduces systemic delay to tight groupings of arriving aircraft as well as increases sustained throughput of the operation. A fast-time, Monte Carlo simulation that emulates TMA's scheduling functionalities is performed for arrival flights to the Phoenix Airport to quantify the benefit of the time advance algorithm. Results show consistent time saving benefits, ranging from 3 to 50 minutes for 112 flights with varying levels of traffic congestion.
arrival traffic management↗
Algorithms for real-time fault detection of the Space Shuttle Main Engine
This paper reports on the results of a program to develop and demonstrate concepts related to a realtime health management system (HMS) for the Space Shuttle Main Engine (SSME). An HMS framework was developed on the basis of a top-down analysis of the current rocket engine failure modes and the engine monitoring requirements. One result of Phase I of this program was the identification of algorithmic approaches for detecting failures of the SSME. Three different analytical techniques were developed which demonstrated the capability to detect failures significantly earlier than the existing redlines. Based on promising initial results, Phase II of the program was initiated to further validate and refine the fault detection strategy on a large data base of 140 SSME test firings, and implement the resultant algorithms in real time. The paper begins with an overview of the refined algorithms used to detect failures during SSME start-up and main-stage operation. Results of testing these algorithms on a data base of nominal and off-nominal SSME test firings is discussed. The paper concludes with a discussion of the performance of the algorithms operating on a real-time computer system.
Ruiz, C. A.↗
Fast and stable recursive algorithms for continuous-time and discrete-time model conversions
Based on the Newton-Raphson method, this paper presents recursive algorithms that are rapidly convergent and more stable for modeling the equivalent continuous-time (discrete-time) model from the available discrete-time (continuous-time) model for a fixed sampling period. The newly developed recursive algorithms relax the constraints imposed upon the existing model conversion algorithms, and, thus, enhance the applications of microprocessors and associated microelectronics to digital control systems. A practical example is presented to demonstrate the effectiveness of the proposed procedures.
Shieh, L. S.↗
Real-time test of MOCS algorithm during Superflux 1980
A remote sensing experiment was conducted in which success depended upon the real-time use of an algorithm, generated from MOCS (multichannel ocean color sensor) data onboard the NASA P-3 aircraft, to direct the NOAA ship Kelez to oceanic stations where vitally needed sea truth could be collected. Remote data sets collected on two consecutive days of the mission were consistent with the sea truth for low concentrations of chlorophyll a. Two oceanic regions of special interest were located. The algorithm and the collected data are described.
Grew, G. W.↗