Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “representation”

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 721 records · Page 40

Beyond rules: The next generation of expert systems

The PARAGON Representation, Management, and Manipulation system is introduced. The concepts of knowledge representation, knowledge management, and knowledge manipulation are combined in a comprehensive system for solving real world problems requiring high levels of expertise in a real time environment. In most applications the complexity of the problem and the representation used to describe the domain knowledge tend to obscure the information from which solutions are derived. This inhibits the acquisition of domain knowledge verification/validation, places severe constraints on the ability to extend and maintain a knowledge base while making generic problem solving strategies difficult to develop. A unique hybrid system was developed to overcome these traditional limitations.

Ferguson, Jay C.↗

Spatial cognition

Spatial cognition is the ability to reason about geometric relationships in the real (or a metaphorical) world based on one or more internal representations of those relationships. The study of spatial cognition is concerned with the representation of spatial knowledge, and our ability to manipulate these representations to solve spatial problems. Spatial cognition is utilized most critically when direct perceptual cues are absent or impoverished. Examples are provided of how human spatial cognitive abilities impact on three areas of space station operator performance: orientation, path planning, and data base management. A videotape provides demonstrations of relevant phenomena (e.g., the importance of orientation for recognition of complex, configural forms). The presentation is represented by abstract and overhead visuals only.

Kaiser, Mary Kister↗

Robust adaptive regulation without persistent excitation

A globally convergent adaptive regulator for minimum or nonminimum phase systems subject to bounded distrubances and unmodeled dynamics is presented. The control strategy is designed for a particular input-output representation obtained from the state space representation of the system. The leading coefficient of the new representation is the product of the observability and controllability matrices of the system. The controller scheme uses a Least Squares identification algorithm with a dead zone. The dead zone is chosen to obtain convergence properties on the estimates and on the covariance matrix as well. This allows the definition of modified estimates which secure well-conditioned matrices in the adaptive control law. Explicit bounds on the plant output are given.

Lozano-Leal, Rogelio↗

Correlation of interannual length-of-day variation with El Nino/Southern Oscillation, 1972-1986

Correlation between interannual length-of-day (LOD) changes and an index representation of El Nino/Southern Oscillation (ENSO) for the period of 1972-1986 was examined in two ways: as the cross-correlation function in the time domain and as the complex coherence spectrum in the frequency domain. The ENSO representation was derived from barometric measurements from the Tahiti and Darwin, Australia, meteorological stations, as the difference of the sea-level pressure between the two locations. The cross correlation between this ENSO representation and LOD variation on the interannual time scale was found to have a maximum value of 0.68 and the LOD phase lag of 2 months, indicating that most of the interannual LOD variation is caused by ENSO, and that the transfer of ENSO's axial angular momentum to the solid earth lags behind the Tahiti-Darwin pressure variation by about 2 months. The corresponding coherence spectrum showed minimum correlation around biennial periods, indicating an influence of the stratospheric quasi-biennial oscillation on LOD variations.

Chao, B. Fong↗

SIRE: A Simple Interactive Rule Editor for NICBES

To support evolution of domain expertise, and its representation in an expert system knowledge base, a user-friendly rule base editor is mandatory. The Nickel Cadmium Battery Expert System (NICBES), a prototype of an expert system for the Hubble Space Telescope power storage management system, does not provide such an editor. In the following, a description of a Simple Interactive Rule Base Editor (SIRE) for NICBES is described. The SIRE provides a consistent internal representation of the NICBES knowledge base. It supports knowledge presentation and provides a user-friendly and code language independent medium for rule addition and modification. The SIRE is integrated with NICBES via an interface module. This module provides translation of the internal representation to Prolog-type rules (Horn clauses), latter rule assertion, and a simple mechanism for rule selection for its Prolog inference engine.

Bykat, Alex↗

Certainty grids for mobile robots

A numerical representation of uncertain and incomplete sensor knowledge called Certainty Grids has been used successfully in several mobile robot control programs, and has proven itself to be a powerful and efficient unifying solution for sensor fusion, motion planning, landmark identification, and many other central problems. Researchers propose to build a software framework running on processors onboard the new Uranus mobile robot that will maintain a probabilistic, geometric map of the robot's surroundings as it moves. The certainty grid representation will allow this map to be incrementally updated in a uniform way from various sources including sonar, stereo vision, proximity and contact sensors. The approach can correctly model the fuzziness of each reading, while at the same time combining multiple measurements to produce sharper map features, and it can deal correctly with uncertainties in the robot's motion. The map will be used by planning programs to choose clear paths, identify locations (by correlating maps), identify well-known and insufficiently sensed terrain, and perhaps identify objects by shape. The certainty grid representation can be extended in the same dimension and used to detect and track moving objects.

Moravec, H. P.↗

Geometric reasoning

Cognitive robot systems are ones in which sensing and representation occur, from which task plans and tactics are determined. Such a robot system accomplishes a task after being told what to do, but determines for itself how to do it. Cognition is required when the work environment is uncontrolled, when contingencies are prevalent, or when task complexity is large; it is useful in any robotic mission. A number of distinguishing features can be associated with cognitive robotics, and one emphasized here is the role of artificial intelligence in knowledge representation and in planning. While space telerobotics may elude some of the problems driving cognitive robotics, it shares many of the same demands, and it can be assumed that capabilities developed for cognitive robotics can be employed advantageously for telerobotics in general. The top level problem is task planning, and it is appropriate to introduce a hierarchical view of control. Presented with certain mission objectives, the system must generate plans (typically) at the strategic, tactical, and reflexive levels. The structure by which knowledge is used to construct and update these plans endows the system with its cognitive attributes, and with the ability to deal with contingencies, changes, unknowns, and so on. Issues of representation and reasoning which are absolutely fundamental to robot manipulation, decisions based upon geometry, are discussed here, not AI task planning per se.

Woodbury, R. F.↗

Robust adaptive regulation without persistent excitation

A globally convergent adaptive regulator for minimum- or nonminimum-phase systems subject to bounded disturbances and unmodeled dynamics is presented. The control strategy is designed for a particular input-output representation obtained from the state space representation of the system. The leading coefficient of the representation is the product of the observability and controllability matrices of the system. The controller scheme uses a Least-Squares identification algorithm a with dead zone. The dead zone is chosen to obtain convergence properties on the estimates and on the covariance matrix as well. This allows the definition of modified estimates which secure well-conditioned matrices in the adaptive control law. Explicit bounds on the plant output are given.

Lozano-Leal, Rogelio↗

Structural stability augmentation system design using BODEDIRECT: A quick and accurate approach

A methodology is presented for a modal suppression control law design using flight test data instead of mathematical models to obtain the required gain and phase information about the flexible airplane. This approach is referred to as BODEDIRECT. The purpose of the BODEDIRECT program is to provide a method of analyzing the modal phase relationships measured directly from the airplane. These measurements can be achieved with a frequency sweep at the control surface input while measuring the outputs of interest. The measured Bode-models can be used directly for analysis in the frequency domain, and for control law design. Besides providing a more accurate representation for the system inputs and outputs of interest, this method is quick and relatively inexpensive. To date, the BODEDIRECT program has been tested and verified for computational integrity. Its capabilities include calculation of series, parallel and loop closure connections between Bode-model representations. System PSD, together with gain and phase margins of stability may be calculated for successive loop closures of multi-input/multi-output systems. Current plans include extensive flight testing to obtain a Bode-model representation of a commercial aircraft for design of a structural stability augmentation system.

Goslin, T. J.↗

Detection of edges using local geometry

Researchers described a new representation, the local geometry, for early visual processing which is motivated by results from biological vision. This representation is richer than is often used in image processing. It extracts more of the local structure available at each pixel in the image by using receptive fields that can be continuously rotated and that go to third order spatial variation. Early visual processing algorithms such as edge detectors and ridge detectors can be written in terms of various local geometries and are computationally tractable. For example, Canny's edge detector has been implemented in terms of a local geometry of order two, and a ridge detector in terms of a local geometry of order three. The edge detector in local geometry was applied to synthetic and real images and it was shown using simple interpolation schemes that sufficient information is available to locate edges with sub-pixel accuracy (to a resolution increase of at least a factor of five). This is reasonable even for noisy images because the local geometry fits a smooth surface - the Taylor series - to the discrete image data. Only local processing was used in the implementation so it can readily be implemented on parallel mesh machines such as the MPP. Researchers expect that other early visual algorithms, such as region growing, inflection point detection, and segmentation can also be implemented in terms of the local geometry and will provide sufficiently rich and robust representations for subsequent visual processing.

Gualtieri, J. A.↗

A comparison of two neural network schemes for navigation

Neural networks have been applied to tasks in several areas of artificial intelligence, including vision, speech, and language. Relatively little work has been done in the area of problem solving. Two approaches to path-finding are presented, both using neural network techniques. Both techniques require a training period. Training under the back propagation (BPL) method was accomplished by presenting representations of (current position, goal position) pairs as input and appropriate actions as output. The Hebbian/interactive activation (HIA) method uses the Hebbian rule to associate points that are nearby. A path to a goal is found by activating a representation of the goal in the network and processing until the current position is activated above some threshold level. BPL, using back-propagation learning, failed to learn, except in a very trivial fashion, that is equivalent to table lookup techniques. HIA, performed much better, and required storage of fewer weights. In drawing a comparison, it is important to note that back propagation techniques depend critically upon the forms of representation used, and can be sensitive to parameters in the simulations; hence the BPL technique may yet yield strong results.

Munro, Paul W.↗

A comparison of two neural network schemes for navigation

Neural networks have been applied to tasks in several areas of artificial intelligence, including vision, speech, and language. Relatively little work has been done in the area of problem solving. Two approaches to path-finding are presented, both using neural network techniques. Both techniques require a training period. Training under the back propagation (BPL) method was accomplished by presenting representations of current position, goal position pairs as input and appropriate actions as output. The Hebbian/interactive activation (HIA) method uses the Hebbian rule to associate points that are nearby. A path to a goal is found by activating a representation of the goal in the network and processing until the current position is activated above some threshold level. BPL, using back-propagation learning, failed to learn, except in a very trivial fashion, that is equivalent to table lookup techniques. HIA, performed much better, and required storage of fewer weights. In drawing a comparison, it is important to note that back propagation techniques depend critically upon the forms of representation used, and can be sensitive to parameters in the simulations; hence the BPL technique may yet yield strong results.

Munro, Paul↗

Coordinating the activities of a planner and an execution agent

A research program was defined that will explore the link between planning and execution systems. A simple scenario was defined in which a very capable off-line planning system interacts with the user and a smaller, less capable, on-line real-time system executing plans and reacting to faults. However, the on-line execution system may have a more flexible representation of the plans it is executing. This imbalance in the capabilities of the two agents involved should clarify some of the research objectives and give an experimental framework for the work. The task is to investigate the knowledge representations and communication protocols needed to link a user stating some requirements for a task to be carried out through a planning system to the (remote) execution agent that can carry out the user's wishes. The notion that a single representation can encapsulate the expression of the user's requirements, the capabilities for action, the communication to the execution agent, the successful or faulty response from the execution agent and the means of keeping the user informed, is examined. Methods of creating plan patches to update the plans separately held by each of the parties involved to keep them in step as they each react to changing circumstances in real-time is investigated. This involves the specification of plan patch attachment points that can be understood by the recipient. Transaction based methods are also investigated for coordinating the activities of the planner with those of the execution agent and user. The trial application area for the research is in the command and control of an advanced Earth Observation Space Platform.

Tate, Austin↗

The indexed time table approach for planning and acting

A representation is discussed of symbolic temporal relations, called IxTeT, that is both powerful enough at the reasoning level for tasks such as plan generation, refinement and modification, and efficient enough for dealing with real time constraints in action monitoring and reactive planning. Such representation for dealing with time is needed in a teleoperated space robot. After a brief survey of known approaches, the proposed representation shows its computational efficiency for managing a large data base of temporal relations. Reactive planning with IxTeT is described and exemplified through the problem of mission planning and modification for a simple surveying satellite.

Ghallab, Malik↗

Perception for rugged terrain

A three-dimensional perception system for building a geometrical description of rugged terrain environments from range image data is presented with reference to the exploration of the rugged terrain of Mars. An intermediate representation consisting of an elevation map that includes an explicit representation of uncertainty and labeling of the occluded regions is proposed. The locus method used to convert range image to an elevation map is introduced, along with an uncertainty model based on this algorithm. Both the elevation map and the locus method are the basis of a terrain matching algorithm which does not assume any correspondences between range images. The two-stage algorithm consists of a feature-based matching algorithm to compute an initial transform and an iconic terrain matching algorithm to merge multiple range images into a uniform representation. Terrain modeling results on real range images of rugged terrain are presented. The algorithms considered are a fundamental part of the perception system for the Ambler, a legged locomotor.

Kweon, In SO↗

A numerically exact full wave packet approach to molecule-surface scattering

A numerically exact spectral method for solving the time-dependent Schroedinger equation in spherical coordinates is described. The angular dependence of the wave function is represented on a two-dimensional grid of evenly spaced points. The fast Fourier transform algorithm is used to transform between the angle space representation of the wave function and its conjugate representation in momentum space. The time propagation of the wave function is evaluated using an expansion of the time evolution operator as a series of Chebyshev polynomials. Calculations performed for a model system representing H2 scattering from a rectangular corrugated surface yield transition probabilities that are in excellent agreement with those obtained using the close-coupling wave packet (CCWP) method. However, the new method is found to require substantially more computation time than the CCWP method because of the large number of grid points needed to represent the angular dependence of the wave function and the variation in the number of terms required in the Chebyshev representation of the time evolution operator.

Mowrey, R. C.↗

Image recovery from edge primitives

A method for extracting edge primitives from Mach-band patterns is presented together with a method for recovering image representations of features outlined by the edge boundaries. The accuracy, stability, and resolution of these representations are assessed. Since these representations are most commonly used in characterizing targets, this method of low-level processing offers new opportunities for computer vision and high data-compressing coding. Two bandpass filters are considered, the spatially invariant Laplacian of Gaussian filter and spatially variant intensity-dependent spatial (IDS) summation. It is shown that the recovery from the IDS bandpass data is particularly advantageous in applications for which robustness to local and temporal variations in illumination is important. It is concluded that the edge primitives extracted from bandpassed images can be an efficient way to store, transmit, and represent images.

Alter-Gartenberg, Rachel↗

Automated analysis for fluid flow topology

A new approach for visualizing vector data sets was developed by reducing the original vector field to a set of critical points and their connections, and was applied to fluid flow data sets. The critical point representation allows for considerable reduction in the data complexity. The representations are displayed as surfaces which are much simpler than the original data set, yet retain all the pertinent flow topology information. It is suggested that topological representations may be useful for database comparison.

Helman, James↗