SEARCH · Search NASA

Results for “Recursion”

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 577 records · Page 32

All sources NASA NTRS DOE OSTI

NASA NTRS1990

System characterization of positive real conditions

Necessary and sufficient conditions for positive realness in terms of state space matrices are presented under the assumption of complete controllability and complete observability of square systems with independent inputs. As an alternative to the positive real lemma and to the s-domain inequalities, these conditions provide a recursive algorithm for testing positive realness which results in a set of simple algebraic conditions. By relating the positive real property to the associated variational problem, a unified derivation of necessary and sufficient conditions for optimality of both singular and nonsingular problems is derived.

Wang, Q.↗

NASA NTRS1990

Simulation and analysis of flexibly jointed manipulators

Modeling, simulation, and analysis of robot manipulators with non-negligible joint flexibility are studied. A recursive Newton-Euler model of the flexibly jointed manipulator is developed with many advantages over the traditional Lagrange-Euler methods. The Newton-Euler approach leads to a method for the simulation of a flexibly jointed manipulator in which the number of computations grows linearly with the number of links. Additionally, any function for the flexibility between the motor and link may be used permitting the simulation of nonlinear effects, such as backlash, in a uniform manner for all joints. An analysis of the control problems for flexibly jointed manipulators is presented by converting the Newton-Euler model to a Lagrange-Euler form. The detailed structure available in the model is used to examine linearizing controllers and shows the dependency of the control on the choice of flexible model and structure of the manipulator.

Murphy, Steve H.↗

NASA NTRS1992

Feautrier solution of the electron transport equation

An efficient, accurate, and stable solution to the electron transport problem is presented. The two-stream approximation is discussed in detail, but the solution is developed for the general multistream case. Applied to the photoelectron problem, it is shown that accurate escape fluxes are obtained using only 10 altitudes distributed over the region 100 - 1000 km. The local equilibrium, two-stream, and multistream solutions to the photoelectron problem are compared. In addition, a recursion relation for the moments of the elastic angular scattering phase function is presented.

Link, R.↗

NASA NTRS1992

Self-tuning control of attitude and momentum management for the Space Station

This paper presents a hybrid state-space self-tuning design methodology using dual-rate sampling for suboptimal digital adaptive control of attitude and momentum management for the Space Station. This new hybrid adaptive control scheme combines an on-line recursive estimation algorithm for indirectly identifying the parameters of a continuous-time system from the available fast-rate sampled data of the inputs and states and a controller synthesis algorithm for indirectly finding the slow-rate suboptimal digital controller from the designed optimal analog controller. The proposed method enables the development of digitally implementable control algorithms for the robust control of Space Station Freedom with unknown environmental disturbances and slowly time-varying dynamics.

Shieh, L. S.↗

NASA NTRS1992

Observability under recurrent loss of data

An account is given of the concept of extended observability in finite-dimensional linear time-invariant systems under recurrent loss of data, where the state vector has to be reconstructed from an ensemble of sensor data at nonconsecutive samples. An at once necessary and sufficient condition for extended observability that can be expressed via a recursive relation is presented, together with such conditions for this as may be related to the characteristic polynomial of the state transition matrix in a discrete-time setting, or of the system matrix in a continuous-time setting.

Luck, Rogelio↗

NASA NTRS1992

Mesh generation/refinement using fractal concepts and iterated function systems

A novel method of mesh generation is proposed which is based on the use of fractal concepts to derive contractive, affine transformations. The transformations are constructed in such a manner that the attractors of the resulting maps are a union of the points, lines and surfaces in the domain. In particular, the mesh nodes may be generated recursively as a sequence of points which are obtained by applying the transformations to a coarse background mesh constructed from the given boundary data. A Delaunay triangulation or similar edge connection approach can then be performed on the resulting set of nodes in order to generate the mesh. Local refinement of an existing mesh can also be performed using the procedure. The method is easily extended to three dimensions, in which case the Delaunay triangulation is replaced by an analogous 3D tesselation.

Bova, S. W.↗

NASA NTRS1992

Spatial Operator Algebra for multibody system dynamics

The Spatial Operator Algebra framework for the dynamics of general multibody systems is described. The use of a spatial operator-based methodology permits the formulation of the dynamical equations of motion of multibody systems in a concise and systematic way. The dynamical equations of progressively more complex grid multibody systems are developed in an evolutionary manner beginning with a serial chain system, followed by a tree topology system and finally, systems with arbitrary closed loops. Operator factorizations and identities are used to develop novel recursive algorithms for the forward dynamics of systems with closed loops. Extensions required to deal with flexible elements are also discussed.

Rodriguez, G.↗

NASA NTRS1991

Spatio-temporal contextual classification based on Markov random field model

A contextural classifier based on a Markov random field model, which can utilize both spatial and temporal contexts, is investigated. Spatial and temporal neighbors are defined, and the class assignment of each pixel is assumed to be dependent only on the measurement vectors of itself and those of its spatial and temporal neighbors according to the Markov random field property. Only interpixel class dependency context is used in the classification. The joint prior probability of the classes of each pixel and its spatial and temporal neighbors are modeled by a Gibbs random field. The classification is performed in a recursive manner. Experiments with multi-temporal Thematic Mapper data show promising results.

Jeon, Byeungwoo↗

NASA NTRS1992

A real-time robot arm collision avoidance system

A data structure and update algorithm are presented for a prototype real-time collision avoidance safety system simulating a multirobot workspace. The data structure is a variant of the octree, which serves as a spatial index. An octree recursively decomposes 3D space into eight equal cubic octants until each octant meets some decomposition criteria. The N-objects octree, which indexes a collection of 3D primitive solids is used. These primitives make up the two (seven-degrees-of-freedom) robot arms and workspace modeled by the system. 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. Cycle time for interpreting current arm joint angles, updating the octree to reflect new positions, and detecting/reporting imminent collisions averages 30 ms on an Intel 80386 processor running at 20 MHz.

Shaffer, Clifford A.↗

NASA NTRS1992

Vision-based obstacle detection for rotorcraft flight

An obstacle detection approach to rotorcraft flight is described which is based on feature tracking and recursive range estimation. Flight characteristics are taken into account. A range map derived on the basis of this approach provides an advisory display to the pilot and can serve as input to an automatic obstacle-avoidance guidance system. A NASA CH-47 Chinook helicopter was used to develop an image and rotorcraft flight data base for verification of obstacle detection concepts. The performance of the passive range estimation algorithms is demonstrated using both laboratory image and flight image data.

Sridhar, Banavar↗

NASA NTRS1992

A parameter estimation algorithm for spatial sine testing - Theory and evaluation

This paper presents the theory and an evaluation of a spatial sine testing parameter estimation algorithm that uses directly the measured forced mode of vibration and the measured force vector. The parameter estimation algorithm uses an ARMA model and a recursive QR algorithm is applied for data reduction. In this first evaluation, the algorithm has been applied to a frequency response matrix (which is a particular set of forced mode of vibration) using a sliding frequency window. The objective of the sliding frequency window is to execute the analysis simultaneously with the data acquisition. Since the pole values and the modal density are obtained from this analysis during the acquisition, the analysis information can be used to help determine the forcing vectors during the experimental data acquisition.

Rost, R. W.↗

NASA NTRS1992

A data fusion algorithm for multi-sensor microburst hazard assessment

A recursive model-based data fusion algorithm for multi-sensor microburst hazard assessment is described. An analytical microburst model is used to approximate the actual windfield, and a set of 'best' model parameters are estimated from measured winds. The winds corresponding to the best parameter set can then be used to compute alerting factors such as microburst position, extent, and intensity. The estimation algorithm is based on an iterated extended Kalman filter which uses the microburst model parameters as state variables. Microburst state dynamic and process noise parameters are chosen based on measured microburst statistics. The estimation method is applied to data from a time-varying computational simulation of a historical microburst event to demonstrate its capabilities and limitations. Selection of filter parameters and initial conditions is discussed. Computational requirements and datalink bandwidth considerations are also addressed.

Wanke, Craig R.↗

NASA NTRS1992

Backward assembly planning with DFA analysis

An assembly planning system that operates based on a recursive decomposition of assembly into subassemblies is presented. The planning system analyzes assembly cost in terms of stability, directionality, and manipulability to guide the generation of preferred assembly plans. The planning in this system incorporates the special processes, such as cleaning, testing, labeling, etc., that must occur during the assembly. Additionally, the planning handles nonreversible, as well as reversible, assembly tasks through backward assembly planning. In order to decrease the planning efficiency, the system avoids the analysis of decompositions that do not correspond to feasible assembly tasks. This is achieved by grouping and merging those parts that can not be decomposable at the current stage of backward assembly planning due to the requirement of special processes and the constraint of interconnection feasibility. The invention includes methods of evaluating assembly cost in terms of the number of fixtures (or holding devices) and reorientations required for assembly, through the analysis of stability, directionality, and manipulability. All these factors are used in defining cost and heuristic functions for an AO* search for an optimal plan.

Lee, Sukhan↗

NASA NTRS1992

Formal verification of an oral messages algorithm for interactive consistency

The formal specification and verification of an algorithm for Interactive Consistency based on the Oral Messages algorithm for Byzantine Agreement is described. We compare our treatment with that of Bevier and Young, who presented a formal specification and verification for a very similar algorithm. Unlike Bevier and Young, who observed that 'the invariant maintained in the recursive subcases of the algorithm is significantly more complicated than is suggested by the published proof' and who found its formal verification 'a fairly difficult exercise in mechanical theorem proving,' our treatment is very close to the previously published analysis of the algorithm, and our formal specification and verification are straightforward. This example illustrates how delicate choices in the formulation of the problem can have significant impact on the readability of its formal specification and on the tractability of its formal verification.

Rushby, John↗

NASA NTRS1992

Approximation methods for stochastic petri nets

Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay equivalence often fails to converge, while flow equivalent aggregation can lead to potentially bad results if a strong dependence of the mean completion time on the interarrival process exists.

Jungnitz, Hauke Joerg↗

NASA NTRS1992

Possibility expectation and its decision making algorithm

The fuzzy integral has been shown to be an effective tool for the aggregation of evidence in decision making. Of primary importance in the development of a fuzzy integral pattern recognition algorithm is the choice (construction) of the measure which embodies the importance of subsets of sources of evidence. Sugeno fuzzy measures have received the most attention due to the recursive nature of the fabrication of the measure on nested sequences of subsets. Possibility measures exhibit an even simpler generation capability, but usually require that one of the sources of information possess complete credibility. In real applications, such normalization may not be possible, or even desirable. In this report, both the theory and a decision making algorithm for a variation of the fuzzy integral are presented. This integral is based on a possibility measure where it is not required that the measure of the universe be unity. A training algorithm for the possibility densities in a pattern recognition application is also presented with the results demonstrated on the shuttle-earth-space training and testing images.

Keller, James M.↗

NASA NTRS1992

Study and simulation of low rate video coding schemes

The semiannual report is included. Topics covered include communication, information science, data compression, remote sensing, color mapped images, robust coding scheme for packet video, recursively indexed differential pulse code modulation, image compression technique for use on token ring networks, and joint source/channel coder design.

Sayood, Khalid↗

NASA NTRS1993

Fault detection and isolation

Erroneous measurements in multisensor navigation systems must be detected and isolated. A recursive estimator can find fast growing errors; a least squares batch estimator can find slow growing errors. This process is called fault detection. A protection radius can be calculated as a function of time for a given location. This protection radius can be used to guarantee the integrity of the navigation data. Fault isolation can be accomplished using either a snapshot method or by examining the history of the fault detection statistics.

Bernath, Greg↗