SEARCH · Engineering Papers

Results for “Algorithm Development”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

NASA NTRS1974

Finding the earth in ERTS

Itek's Optical System Division recently completed an investigation funded by NASA to develop interpretation methods and algorithms suitable for recognition of earth resources by machines using multispectral data from ERTS. Through the algorithms developed (and described here) it is now possible to automatically recognize terrain types. The clustering algorithm guarantees high accuracy in the recognition process with almost complete automation. Interestingly, the machine recognition seems to be more accurate than a human photointerpreter who has been restricted to using only ERTS-1 color composites. That is, machine recognition appears to be more sensitive, it can operate much closer, to the resolution limit of the ERTS-1 imagery than the human photointerpreter.

Gramenopoulos, N.↗

NASA NTRS2011

Constraint Embedding Technique for Multibody System Dynamics

Multibody dynamics play a critical role in simulation testbeds for space missions. There has been a considerable interest in the development of efficient computational algorithms for solving the dynamics of multibody systems. Mass matrix factorization and inversion techniques and the O(N) class of forward dynamics algorithms developed using a spatial operator algebra stand out as important breakthrough on this front. Techniques such as these provide the efficient algorithms and methods for the application and implementation of such multibody dynamics models. However, these methods are limited only to tree-topology multibody systems. Closed-chain topology systems require different techniques that are not as efficient or as broad as those for tree-topology systems. The closed-chain forward dynamics approach consists of treating the closed-chain topology as a tree-topology system subject to additional closure constraints. The resulting forward dynamics solution consists of: (a) ignoring the closure constraints and using the O(N) algorithm to solve for the free unconstrained accelerations for the system; (b) using the tree-topology solution to compute a correction force to enforce the closure constraints; and (c) correcting the unconstrained accelerations with correction accelerations resulting from the correction forces. This constraint-embedding technique shows how to use direct embedding to eliminate local closure-loops in the system and effectively convert the system back to a tree-topology system. At this point, standard tree-topology techniques can be brought to bear on the problem. The approach uses a spatial operator algebra approach to formulating the equations of motion. The operators are block-partitioned around the local body subgroups to convert them into aggregate bodies. Mass matrix operator factorization and inversion techniques are applied to the reformulated tree-topology system. Thus in essence, the new technique allows conversion of a system with closure-constraints into an equivalent tree-topology system, and thus allows one to take advantage of the host of techniques available to the latter class of systems. This technology is highly suitable for the class of multibody systems where the closure-constraints are local, i.e., where they are confined to small groupings of bodies within the system. Important examples of such local closure-constraints are constraints associated with four-bar linkages, geared motors, differential suspensions, etc. One can eliminate these closure-constraints and convert the system into a tree-topology system by embedding the constraints directly into the system dynamics and effectively replacing the body groupings with virtual aggregate bodies. Once eliminated, one can apply the well-known results and algorithms for tree-topology systems to solve the dynamics of such closed-chain system.

Woo, Simon S.↗

NASA NTRS2013

A Summary of Large Raindrop Observations from GPM GV Field Campaigns

NASA's Global Precipitation Measurement Mission (GPM) has conducted as series of Ground Validation (GV) studies to assist algorithm development for the GPM core satellite. Characterizing the drop size distribution (DSD) for different types of precipitation systems is critical in order to accurately estimate precipitation across the majority of the planet. Thus far, GV efforts have sampled DSDs in a variety of precipitation systems from Finland to Oklahoma. This dataset consists of over 33 million raindrops sampled by GPM GV's two‐dimensional video disdrometers (2DVD) and includes RSD observations from the LPVEx, MC3E, GCPEx, HyMEx and IFloodS campaigns as well as from GV sites in Huntsville, AL and Wallops Island, VA. This study focuses on the larger end of the raindrop size spectrum, which greatly influences radar reflectivity and has implications for moment estimation. Thus knowledge of the maximum diameter is critical to GPM algorithm development. There are over 24,000 raindrops exceeding 5 mm in diameter contained within this disdrometer dataset. The largest raindrops in the 2DVD dataset (>7‐8 mm in diameter) are found within intense convective thunderstorms, and their origins are believed to be hailstones. In stratiform rainfall, large raindrops have also been found to fall from lower and thicker melting layers. The 2DVD dataset will be combined with that collected by dual‐polarimetric radar and aircraft particle imaging probes to "follow" the vertical evolution of the DSD tail (i.e., retrace the large drops from the surface to their origins aloft).

Gatlin, Patrick N.↗

NASA NTRS2004

Minimum-Time and Vibration Avoidance Attitude Maneuver for Spacecraft with Torque and Momentum Limit Constraints in Redundant Reaction Wheel Configuration

In this paper, we present an optimal open-loop slew trajectory algorithm developed at GSFC for the so-called "Yardstick design" of the James Webb Space Telescope (JWST). JWST is an orbiting infrared observatory featuring a lightweight, segmented primary mirror approximately 6 meters in diameter and a sunshield approximately the size of a tennis court. This large, flexible structure will have significant number of lightly damped, dominant flexible modes. With very stringent requirements on pointing accuracy and image quality, it is important that slewing be done within the required time constraint and with minimal induced vibration in order to maximize observing efficiency. With reaction wheels as control actuators, initial wheel speeds as well as individual wheel torque and momentum limits become dominant constraints in slew performance. These constraints must be taken into account when performing slews to ensure that unexpected reaction wheel saturation does not occur, since such saturation leads to control failure in accurately tracking commanded motion and produces high frequency torque components capable of exciting structural modes. A minimum-time constraint is also included and coupled with reaction wheel limit constraints in the optimization to minimize both the effect of the control torque on the flexible body motion and the maneuver time. The optimization is on slew command parameters, such as maximum slew velocity and acceleration, for a given redundant reaction wheel configuration and is based on the dynamic interaction between the spacecraft and reaction wheel motion. Analytical development of the slew algorithm to generate desired slew position, rate, and acceleration profiles to command a feedback/feed forward control system is described. High-fidelity simulation and experimental results are presented to show that the developed slew law achieves the objectives.

Ha, Kong Q.↗

NASA NTRS1983

A perspective of theoretical and applied computational fluid dynamics

The present effectiveness and future promise of computational fluid dynamics (CFD) are discussed. The CFD ideal of computer-designed flight vehicles and the progress that has been made toward its achievement, expressed in terms of primary and secondary pacing items, are also addressed. The primary pacing items listed by Chapman - grid generation, turbulence modeling, solution methodology development, and mainframe computer methods and architecture - are modified and reviewed. Important secondary pacing items in CFD development are also examined: algorithm development, complex geometry definition, and predata and postata processing. In addition, user requirements placed on CFD computer codes are defined and some problems associated with the dissemination of CFD technology are identified.

Kutler, P.↗

NASA NTRS1985

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, J. H.↗

NASA NTRS1988

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Saltz, Joel H.↗

NASA NTRS1992

Sub-band/transform compression of video sequences

The progress on compression of video sequences is discussed. The overall goal of the research was the development of data compression algorithms for high-definition television (HDTV) sequences, but most of our research is general enough to be applicable to much more general problems. We have concentrated on coding algorithms based on both sub-band and transform approaches. Two very fundamental issues arise in designing a sub-band coder. First, the form of the signal decomposition must be chosen to yield band-pass images with characteristics favorable to efficient coding. A second basic consideration, whether coding is to be done in two or three dimensions, is the form of the coders to be applied to each sub-band. Computational simplicity is of essence. We review the first portion of the year, during which we improved and extended some of the previous grant period's results. The pyramid nonrectangular sub-band coder limited to intra-frame application is discussed. Perhaps the most critical component of the sub-band structure is the design of bandsplitting filters. We apply very simple recursive filters, which operate at alternating levels on rectangularly sampled, and quincunx sampled images. We will also cover the techniques we have studied for the coding of the resulting bandpass signals. We discuss adaptive three-dimensional coding which takes advantage of the detection algorithm developed last year. To this point, all the work on this project has been done without the benefit of motion compensation (MC). Motion compensation is included in many proposed codecs, but adds significant computational burden and hardware expense. We have sought to find a lower-cost alternative featuring a simple adaptation to motion in the form of the codec. In sequences of high spatial detail and zooming or panning, it appears that MC will likely be necessary for the proposed quality and bit rates.

Sauer, Ken↗

NASA NTRS1991

Moderate Resolution Imaging Spectrometer (MODIS) design evolution and associated development and verification of data product efforts

The Moderate Resolution Imaging Spectrometer (MODIS) is a key observing facility to be flown on the Earth Observing System (EOS). The facility is composed of two instruments called MODIS-N (nadir) and MODIS-T (tilt). The MODIS-N is being built under contract to NASA by the Santa Barbara Research Center. The MODIS-T is being fabricated by the Engineering Directorate at the Goddard Space Flight Center. The MODIS Science Team has defined nearly 40 biogeophysical data products for studies of the ocean and land surface and properties of the atmosphere including clouds that can be expected to be produced from the MODIS instruments shortly after the launch of EOS. The ocean, land, atmosphere, and calibration groups of the MODIS Science Team are now proceeding to plan and implement the operations and facilities involving the analysis of data from existing spaceborne, airborne, and in-situ sensors required to develop and validate the algorithms that will produce the geophysical data products. These algorithm development and validation efforts will be accomplished wherever possible within the context of existing or planned national and international experiments or programs such as those in the World Climate Research Program.

Salomonson, Vincent V.↗

NASA NTRS1999

Polar Geophysics Products Derived from AVHRR: The "AVHRR Polar Pathfinder

This NOAA/NASA Pathfinder effort was established to locate, acquire, and process Advanced Very High Resolution Radiometer (AVHRR) imagery into geo-located and calibrated radiances, cloud masks, surface clear-sky broadband albedo, clear-sky skin temperatures, satellite viewing times, and viewing and solar geometry for the, high-latitude portions of the northern and southern hemispheres (all area north of 48N and south of 53S). AVHRR GAC data for August 1981 - July 1998 were acquired, with some gaps remaining, and processed into twice-daily 5-km grids, with some products also provided at 25-km resolution. AVHRR LAC data for 3.5 years of coverage in the northern hemisphere and 2.75 years of coverage in the southern hemisphere were processed into 1.25-km grids for the same suite of products. The resulting data sets are presently being transferred to the National Snow and Ice Data Center (NSIDC) for archiving and distribution. Using these data, researchers now have at their disposal an extensive AVHRR data set for investigations of high-latitude processes. In addition, the data lend themselves to development and testing of algorithms. The products are particularly relevant for climate research and algorithm development as applied to relatively long time periods and large areas.

Maslanik, James↗

NASA NTRS2002

Very Large Scale Optimization

The purpose of this research under the NASA Small Business Innovative Research program was to develop algorithms and associated software to solve very large nonlinear, constrained optimization tasks. Key issues included efficiency, reliability, memory, and gradient calculation requirements. This report describes the general optimization problem, ten candidate methods, and detailed evaluations of four candidates. The algorithm chosen for final development is a modern recreation of a 1960s external penalty function method that uses very limited computer memory and computational time. Although of lower efficiency, the new method can solve problems orders of magnitude larger than current methods. The resulting BIGDOT software has been demonstrated on problems with 50,000 variables and about 50,000 active constraints. For unconstrained optimization, it has solved a problem in excess of 135,000 variables. The method includes a technique for solving discrete variable problems that finds a "good" design, although a theoretical optimum cannot be guaranteed. It is very scalable in that the number of function and gradient evaluations does not change significantly with increased problem size. Test cases are provided to demonstrate the efficiency and reliability of the methods and software.

Vanderplaats, Garrett↗

NASA NTRS1975

SSME structural computer program development: BOPACE theoretical manual, addendum

An algorithm developed and incorporated into BOPACE for improving the convergence and accuracy of the inelastic stress-strain calculations is discussed. The implementation of separation of strains in the residual-force iterative procedure is defined. The elastic-plastic quantities used in the strain-space algorithm are defined and compared with previous quantities.

Source record↗

NASA NTRS1997

Unsupervised, Robust Estimation-based Clustering for Multispectral Images

To prepare for the challenge of handling the archiving and querying of terabyte-sized scientific spatial databases, the NASA Goddard Space Flight Center's Applied Information Sciences Branch (AISB, Code 935) developed a number of characterization algorithms that rely on supervised clustering techniques. The research reported upon here has been aimed at continuing the evolution of some of these supervised techniques, namely the neural network and decision tree-based classifiers, plus extending the approach to incorporating unsupervised clustering algorithms, such as those based on robust estimation (RE) techniques. The algorithms developed under this task should be suited for use by the Intelligent Information Fusion System (IIFS) metadata extraction modules, and as such these algorithms must be fast, robust, and anytime in nature. Finally, so that the planner/schedule module of the IlFS can oversee the use and execution of these algorithms, all information required by the planner/scheduler must be provided to the IIFS development team to ensure the timely integration of these algorithms into the overall system.

Netanyahu, Nathan S.↗

NASA NTRS2000

Collaboration on Development and Validation of the AMSR-E Snow Water Equivalent Algorithm

The National Snow and Ice Data Center (NSIDC) has produced a global SMMR and SSM/I Level 3 Brightness Temperature data set in the Equal Area Scalable Earth (EASE) Grid for the period 1978 to 2000. Processing of current data is-ongoing. The EASE-Grid passive microwave data sets are appropriate for algorithm development and validation prior to the launch of AMSR-E. Having the lower frequency channels of SMMR (6.6 and 10.7 GHz) and the higher frequency channels of SSM/I (85.5 GHz) in the same format will facilitate the preliminary development of applications which could potentially make use of similar frequencies from AMSR-E (6.9, 10.7, 89.0 GHz).

Armstrong, Richard L.↗

NASA NTRS1992

The Proteus Navier-Stokes code

An effort is currently underway at NASA Lewis to develop two- and three-dimensional Navier-Stokes codes, called Proteus, for aerospace propulsion applications. The emphasis in the development of Proteus is not algorithm development or research on numerical methods, but rather the development of the code itself. The objective is to develop codes that are user-oriented, easily-modified, and well-documented. Well-proven, state-of-the-art solution algorithms are being used. Code readability, documentation (both internal and external), and validation are being emphasized. This paper is a status report on the Proteus development effort. The analysis and solution procedure are described briefly, and the various features in the code are summarized. The results from some of the validation cases that have been run are presented for both the two- and three-dimensional codes.

Towne, Charles E.↗

NASA NTRS1989

Laser transit anemometer software development program

Algorithms were developed for the extraction of two components of mean velocity, standard deviation, and the associated correlation coefficient from laser transit anemometry (LTA) data ensembles. The solution method is based on an assumed two-dimensional Gaussian probability density function (PDF) model of the flow field under investigation. The procedure consists of transforming the data ensembles from the data acquisition domain (consisting of time and angle information) to the velocity space domain (consisting of velocity component information). The mean velocity results are obtained from the data ensemble centroid. Through a least squares fitting of the transformed data to an ellipse representing the intersection of a plane with the PDF, the standard deviations and correlation coefficient are obtained. A data set simulation method is presented to test the data reduction process. Results of using the simulation system with a limited test matrix of input values is also given.

Abbiss, John B.↗

NASA NTRS2008

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.

Guidance↗

NASA NTRS1991

Identification of observer/Kalman filter Markov parameters: Theory and experiments

An algorithm to compute Markov parameters of an observer or Kalman filter from experimental input and output data is discussed. The Markov parameters can then be used for identification of a state space representation, with associated Kalman gain or observer gain, for the purpose of controller design. The algorithm is a non-recursive matrix version of two recursive algorithms developed in previous works for different purposes. The relationship between these other algorithms is developed. The new matrix formulation here gives insight into the existence and uniqueness of solutions of certain equations and gives bounds on the proper choice of observer order. It is shown that if one uses data containing noise, and seeks the fastest possible deterministic observer, the deadbeat observer, one instead obtains the Kalman filter, which is the fastest possible observer in the stochastic environment. Results are demonstrated in numerical studies and in experiments on an ten-bay truss structure.

Juang, Jer-Nan↗