Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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,063 records · Page 59
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Real-Time On-Ramp Merging Control of Connected and Automated Vehicles using Pseudospectral Convex Optimization

Highway on-ramp merging can be a challenging task for human drivers due to the complex vehicle negotiations and interactions in limited time and space. Connected and automated vehicles (CAVs) have great potential to address the problem and offer many benefits in terms of safety, traffic efficiency, and fuel economy. However, real-time optimal control of CAVs still faces many challenges, including nonlinear dynamics, complex inter-vehicle interactions, and a highly dynamic and uncertain traffic environment. To address these challenges, we develop a novel control approach that balances the solution optimality and computational efficiency to determine optimal merging speed profiles in real time. Specifically, by employing a pseudospectral method and a sequential convex programming approach, two algorithms are proposed and implemented within the model predictive control (MPC) framework to enable real-time generation of optimal solutions for potential on-vehicle applications. The convergence and optimality of the proposed algorithms are validated by comparing with a general-purpose solver under different traffic scenarios.

Shi, Yang↗
NASA NTRS1972

Study of the dynamics of orbital assemblies including interactions with geometrical appendages

The complete equations for the Unified Flexible Spacecraft Simulation (UFSS) program developed for the NASA/MSFC are presented. This general purpose simulation program is based on an algorithm which utilizes the digital computer to synthesize the dynamic and kinematic equations for a topological tree configuration of N interconnected bodies (the interconnected system of bodies forms no closed loops), the terminal members of which may be flexible. Necessary input quantities to the dynamic subroutine include the mass and inertia properties of each body and the flexible characteristics of each terminal member in addition to the specification, for each body, of those bodies to which it connects. This latter description involves the specification of the number of rotational degrees of freedom at each interconnection along with the associated position vectors defining these connections relative to the mass centers of the bodies involved. These position vectors can be input as time-varying functions if desired, thus affording the capability of studying the effects of time-varying hinge locations. Springs and dampers are assumed to act at each interconnection and structural damping in the flexible terminal members is included in the form of equivalent viscous damping.

Ness, D. J.↗
NASA NTRS1977

Symbolic computation of recurrence equations for the Chebyshev series solution of linear ODE's

If a linear ordinary differential equation with polynomial coefficients is converted into integrated form then the formal substitution of a Chebyshev series leads to recurrence equations defining the Chebyshev coefficients of the solution function. An explicit formula is presented for the polynomial coefficients of the integrated form in terms of the polynomial coefficients of the differential form. The symmetries arising from multiplication and integration of Chebyshev polynomials are exploited in deriving a general recurrence equation from which can be derived all of the linear equations defining the Chebyshev coefficients. Procedures for deriving the general recurrence equation are specified in a precise algorithmic notation suitable for translation into any of the languages for symbolic computation. The method is algebraic and it can therefore be applied to differential equations containing indeterminates.

Geddes, K. O.↗
NASA NTRS1977

The use of random decrement technique for identification of structural modes of vibration

An algorithm is developed to obtain the free responses of a structure from its random responses due to some unknown or known random input or inputs, using the random-decrement technique without changing time correlation between signals. The algorithm is tested using random responses from a 'generalized payload' model and from the 'Space Shuttle' model. The resulting free responses are then used to identify the modal characteristics of the two systems.

Ibrahim, S. R.↗
NASA NTRS1987

Analysis and synthesis of abstract data types through generalization from examples

The discovery of general patterns of behavior from a set of input/output examples can be a useful technique in the automated analysis and synthesis of software systems. These generalized descriptions of the behavior form a set of assertions which can be used for validation, program synthesis, program testing and run-time monitoring. Describing the behavior is characterized as a learning process in which general patterns can be easily characterized. The learning algorithm must choose a transform function and define a subset of the transform space which is related to equivalence classes of behavior in the original domain. An algorithm for analyzing the behavior of abstract data types is presented and several examples are given. The use of the analysis for purposes of program synthesis is also discussed.

Wild, Christian↗
NASA NTRS1985

Notes and comments on computational elastoplasticity - Some new models and their numerical implementation

The following topics are discussed in this paper: (1) the basic interactive nature of classical elasto-plasticity and a redefinition of elastic and plastic processes that facilitates numerical calculations, (2) generalized mid-point or end-point algorithms to determine the stress increment in an elastic-plastic solid from a given strain increment, (3) an endochronic (internal time) rate theory of time-independent plasticity which encompasses various multiple-yield-surface theories and nonlinear kinematic hardening theories as its specializations, and (4) comments on finite element and boundary element methods for solving boundary value problems in elasto-plasticity.

Atluri, S. N.↗
NASA NTRS1987

Analysis and synthesis of abstract data types through generalization from examples

The discovery of general patterns of behavior from a set of input/output examples can be a useful technique in the automated analysis and synthesis of software systems. These generalized descriptions of the behavior form a set of assertions which can be used for validation, program synthesis, program testing, and run-time monitoring. Describing the behavior is characterized as a learning process in which the set of inputs is mapped into an appropriate transform space such that general patterns can be easily characterized. The learning algorithm must chose a transform function and define a subset of the transform space which is related to equivalence classes of behavior in the original domain. An algorithm for analyzing the behavior of abstract data types is presented and several examples are given. The use of the analysis for purposes of program synthesis is also discussed.

Wild, Christian↗
NASA NTRS1988

Continuous fiber ceramic matrix composites for heat engine components

High strength at elevated temperatures, low density, resistance to wear, and abundance of nonstrategic raw materials make structural ceramics attractive for advanced heat engine applications. Unfortunately, ceramics have a low fracture toughness and fail catastrophically because of overload, impact, and contact stresses. Ceramic matrix composites provide the means to achieve improved fracture toughness while retaining desirable characteristics, such as high strength and low density. Materials scientists and engineers are trying to develop the ideal fibers and matrices to achieve the optimum ceramic matrix composite properties. A need exists for the development of failure models for the design of ceramic matrix composite heat engine components. Phenomenological failure models are currently the most frequently used in industry, but they are deterministic and do not adequately describe ceramic matrix composite behavior. Semi-empirical models were proposed, which relate the failure of notched composite laminates to the stress a characteristic distance away from the notch. Shear lag models describe composite failure modes at the micromechanics level. The enhanced matrix cracking stress occurs at the same applied stress level predicted by the two models of steady state cracking. Finally, statistical models take into consideration the distribution in composite failure strength. The intent is to develop these models into computer algorithms for the failure analysis of ceramic matrix composites under monotonically increasing loads. The algorithms will be included in a postprocessor to general purpose finite element programs.

Tripp, David E.↗
NASA NTRS1988

Expert system validation in prolog

An overview of the Expert System Validation Assistant (EVA) is being implemented in Prolog at the Lockheed AI Center. Prolog was chosen to facilitate rapid prototyping of the structure and logic checkers and since February 1987, we have implemented code to check for irrelevance, subsumption, duplication, deadends, unreachability, and cycles. The architecture chosen is extremely flexible and expansible, yet concise and complementary with the normal interactive style of Prolog. The foundation of the system is in the connection graph representation. Rules and facts are modeled as nodes in the graph and arcs indicate common patterns between rules. The basic activity of the validation system is then a traversal of the connection graph, searching for various patterns the system recognizes as erroneous. To aid in specifying these patterns, a metalanguage is developed, providing the user with the basic facilities required to reason about the expert system. Using the metalanguage, the user can, for example, give the Prolog inference engine the goal of finding inconsistent conclusions among the rules, and Prolog will search the graph intantiations which can match the definition of inconsistency. Examples of code for some of the checkers are provided and the algorithms explained. Technical highlights include automatic construction of a connection graph, demonstration of the use of metalanguage, the A* algorithm modified to detect all unique cycles, general-purpose stacks in Prolog, and a general-purpose database browser with pattern completion.

Stock, Todd↗
NASA NTRS1989

Database for LDV signal processor performance analysis

A technique for the direct comparison of LDV signal processors is developed, based on the use of a data base of digitized signal bursts obtained from an LDV under various configurations. This data base can be used to evaluate the response of signal processors and processor algorithms to specific signal characteristics and not to generalized simplistic waveforms. Examples from such a data base are presented to illustrate the capabilities of the proposed method. This data base includes signal ensembles obtained with three laser power settings at two transmitted focal lengths.

Baker, Glenn D.↗
NASA NTRS1992

Space Infrared Telescope Facility (SIRTF) - Operations concept

The development and operations costs of the Space IR Telescope Facility (SIRTF) are discussed in the light of minimizing total outlays and optimizing efficiency. The development phase cannot extend into the post-launch segment which is planned to only support system verification and calibration followed by operations with a 70-percent efficiency goal. The importance of reducing the ground-support staff is demonstrated, and the value of the highly sensitive observations to the general astronomical community is described. The Failure Protection Algorithm for the SIRTF is designed for the 5-yr lifetime and the continuous venting of cryogen, and a science driven ground/operations system is described. Attention is given to balancing cost and performance, prototyping during the development phase, incremental development, the utilization of standards, and the integration of ground system/operations with flight system integration and test.

Miller, Richard B.↗
NASA NTRS1991

Dynamic compensatory pattern matching in a fuzzy rule-based control system

A dynamic compensatory matching procedure is suggested as a method to generate an aggregated measure for evaluating the appropriateness of rules for control systems. It is a dynamic weighted matching technique which takes into account incomplete information under real-time requirements. The initial weights of importance of variables are generated with a generalized neural network architecture and a gradient descent algorithm. An intuitive compensatory scheme based on correlations among input variables of training data is adopted so that the system is coherent to a noisy environment.

Sun, Chuen-Tsai↗
NASA NTRS1991

AR/D image processing system

General Dynamics has developed advanced hardware, software, and algorithms for use with the Tomahawk cruise missile and other unmanned vehicles. We have applied this technology to the problem of locating and determining the orientation of the docking port of a target vehicle with respect to an approaching spacecraft. The system described in this presentation utilizes a multi-processor based computer to digitize and process television imagery and extract parameters such as range to the target vehicle, approach, velocity, and pitch and yaw angles. The processor is based on the Inmos T-800 Transputer and is configured as a loosely coupled array. Each processor operates asynchronously and has its own local memory. This allows additional processors to be easily added if additional processing power is required for more complex tasks. Total system throughput is approximately 100 MIPS (scalar) and 60 MFLOPS and can be expanded as desired. The algorithm implemented on the system uses a unique adaptive thresholding technique to locate the target vehicle and determine the approximate position of the docking port. A target pattern surrounding the port is than analyzed in the imagery to determine the range and orientation of the target. This information is passed to an autopilot which uses it to perform course and speed corrections. Future upgrades to the processor are described which will enhance its capabilities for a variety of missions.

Wookey, Cathy↗
NASA NTRS1994

Application of a distributed network in computational fluid dynamic simulations

A general-purpose 3-D, incompressible Navier-Stokes algorithm is implemented on a network of concurrently operating workstations using parallel virtual machine (PVM) and compared with its performance on a CRAY Y-MP and on an Intel iPSC/860. The problem is relatively computationally intensive, and has a communication structure based primarily on nearest-neighbor communication, making it ideally suited to message passing. Such problems are frequently encountered in computational fluid dynamics (CDF), and their solution is increasingly in demand. The communication structure is explicitly coded in the implementation to fully exploit the regularity in message passing in order to produce a near-optimal solution. Results are presented for various grid sizes using up to eight processors.

Deshpande, Manish↗
NASA NTRS1998

Support Vector Machines for Hyperspectral Remote Sensing Classification

The Support Vector Machine provides a new way to design classification algorithms which learn from examples (supervised learning) and generalize when applied to new data. We demonstrate its success on a difficult classification problem from hyperspectral remote sensing, where we obtain performances of 96%, and 87% correct for a 4 class problem, and a 16 class problem respectively. These results are somewhat better than other recent results on the same data. A key feature of this classifier is its ability to use high-dimensional data without the usual recourse to a feature selection step to reduce the dimensionality of the data. For this application, this is important, as hyperspectral data consists of several hundred contiguous spectral channels for each exemplar. We provide an introduction to this new approach, and demonstrate its application to classification of an agriculture scene.

Gualtieri, J. Anthony↗
NASA NTRS2000

Molecular Dynamics Simulations of Carbon Nanotubes in Water

We study the hydrophobic/hydrophilic behavior of carbon nanotubes using molecular dynamics simulations. The energetics of the carbon-water interface are mainly dispersive but in the present study augmented with a carbon quadrupole term acting on the charge sites of the water. The simulations indicate that this contribution is negligible in terms of modifying the structural properties of water at the interface. Simulations of two carbon nanotubes in water display a wetting and drying of the interface between the nanotubes depending on their initial spacing. Thus, initial tube spacings of 7 and 8 A resulted in a drying of the interface whereas spacing of > 9 A remain wet during the course of the simulation. Finally, we present a novel particle-particle-particle-mesh algorithm for long range potentials which allows for general (curvilinear) meshes and "black-box" fast solvers by adopting an influence matrix technique.

Walther, J. H.↗
NASA NTRS2001

Temporal Constraint Reasoning With Preferences

A number of reasoning problems involving the manipulation of temporal information can naturally be viewed as implicitly inducing an ordering of potential local decisions involving time (specifically, associated with durations or orderings of events) on the basis of preferences. For example. a pair of events might be constrained to occur in a certain order, and, in addition. it might be preferable that the delay between them be as large, or as small, as possible. This paper explores problems in which a set of temporal constraints is specified, where each constraint is associated with preference criteria for making local decisions about the events involved in the constraint, and a reasoner must infer a complete solution to the problem such that, to the extent possible, these local preferences are met in the best way. A constraint framework for reasoning about time is generalized to allow for preferences over event distances and durations, and we study the complexity of solving problems in the resulting formalism. It is shown that while in general such problems are NP-hard, some restrictions on the shape of the preference functions, and on the structure of the preference set, can be enforced to achieve tractability. In these cases, a simple generalization of a single-source shortest path algorithm can be used to compute a globally preferred solution in polynomial time.

Khatib, Lina↗