Simplifying a Lifted Plan Graph Using Domain Splitting
Image process planning, lifted plan graph and induced CSP splitting states and actions in lifted plan graph enables improved arc consistency in underlying CSP.
Petrie, Karen↗
SEARCH · Search NASA
Results for “graph states”
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.
Interpretable Graph Neural Networks for Predicting the Functional State of Protein Kinases
Explore the source record for details and available documents.
Ashwin Ravichandran↗
Performability analysis using semi-Markov reward processes
Beaudry (1978) proposed a simple method of computing the distribution of performability in a Markov reward process. Two extensions of Beaudry's approach are presented. The method is generalized to a semi-Markov reward process by removing the restriction requiring the association of zero reward to absorbing states only. The algorithm proceeds by replacing zero-reward nonabsorbing states by a probabilistic switch; it is therefore related to the elimination of vanishing states from the reachability graph of a generalized stochastic Petri net and to the elimination of fast transient states in a decomposition approach to stiff Markov chains. The use of the approach is illustrated with three applications.
Ciardo, Gianfranco↗
A VLSI decomposition of the deBruijn graph
The nth order deBruijn graph Bn is the state diagram for an n-stage binary shift register. It is a directed graph with 2 to the n vertices, each labeled with an n-bit binary string, and 2 to the n+1 edges, each labeled with an (n+1)-bit binary string. It is shown that Bn can be built by appropriately connecting together with extra edges many isomorphic copies of a fixed graph, which is called a building block for Bn. The efficiency of such a building block is refined as the fraction of the edges of Bn which are present in the copies of the building block. It is then shown that for any alpha less than 1, there exists a graph which is a building block for Bn of efficiency greater than alpha for all sufficiently large n. The results are illustrated by showing how a special hierarchical family of building blocks has been used to construct a very large Viterbi decoder which will be used on the Galileo mission.
Collins, Oliver↗
Becoming Reactive by Concretization
One way to build a reactive system is to construct an action table indexed by the current situation or stimulus. The action table describes what course of action to pursue for each situation or stimulus. This paper describes an incremental approach to constructing the action table through achieving goals with a hierarchical search system. These hierarchies are generated with transformations called concretizations, which add constraints to a problem and which can reduce the search space. The basic idea is that an action for a state is looked up in the action table and executed whenever the action table has an entry for that state; otherwise, a path is found to the nearest (cost-wise in a graph with costweighted arcs) state that has a mappring from a state in the next highest hierarchy. For each state along the solution path, the successor state in the path is cached in the action table entry for that state. Without caching, the hierarchical search system can logarithmically reduce search. When the table is complete the system no longer searches: it simply reacts by proceeding to the state listed in the table for each state. Since the cached information is specific only to the nearest state in the next highest hierarchy and not the goal, inter-goal transfer of reactivity is possible. To illustrate our approach, we show how an implemented hierarchical search system can completely reactive.
Prieditis, Armand↗
Isentropic decompression of fluids from crustal and mantle pressures
Criteria are derived according to which the flow of single-phase magmatic fluids and the rarefaction expansion of low-viscosity liquids and gases may be considered approximately isentropic. Graphs of entropy vs. density with contours of constant pressure and mass fraction are used to examine the possible thermodynamic histories of H2O and CO2 decompressing isentropically from crustal and upper mantle pressures; these graphs offer a simple visual representation of a number of thermodynamic variables involved in isentropic processes. It is shown how the graphs can be used to examine the behavior of volatiles that (1) ascend in volcanic systems originating at different depths within the earth, and (2) decompress from a shock Hugoniot state. Entropy-density graphs are presented separately for H2O and CO2.
Kieffer, S. W.↗
Ionic charge states of N, Ne, Mg, Si and S in solar energetic particle events
The mean ionic charges and source-region temperatures of flare-accelerated N, Ne, Mg, Si and S in three large solar-energetic-particle events during 1978-1979 are determined from ISEE-3 observations, extending the findings of Hovestadt et al. (1981) and Gloeckler et al. (1981) for C, He, O, and Fe. The results are presented in tables and graphs, and the charge states are shown to correspond to different source temperatures even in the same flare, assuming equilibration in the hot plasma. The electron temperatures range from 2 x 10 to the 6th K for C, N, O, Si, and S, 4 x 10 to the 6th K for Ne and Fe, and 7 x 10 to the 6th K for Mg. The possibility that these temperature inconsistencies reflect different stages in the approach to equilibrium is considered.
Luhn, A.↗
Computer Aids Delineation Of Boundaries In Farmlands
Computer-aided stratification (CAS) procedure developmental procedure of image-processing computer equipment and programs partly automating delineation of boundaries between areas. These areas, "primary sampling units", are images of primarily agricultural lands composed by melding digital Landsat Thematic Mapper data and Digital Line Graph data from United States Geological Survey. CAS output data used as inputs for subsequent sampling procedures from which statistics on uses of agricultural lands developed.
Slyle, R.↗
Planning Assembly Of Large Truss Structures In Outer Space
Report dicusses developmental algorithm used in systematic planning of sequences of operations in which large truss structures assembled in outer space. Assembly sequence represented by directed graph called "assembly graph", in which each arc represents joining of two parts or subassemblies. Algorithm generates assembly graph, working backward from state of complete assembly to initial state, in which all parts disassembled. Working backward more efficient than working forward because it avoids intermediate dead ends.
De Mello, Luiz S. Homem↗
Decentralized Observer with a Consensus Filter for Distributed Discrete-Time Linear Systems
This paper presents a decentralized observer with a consensus filter for the state observation of a discrete-time linear distributed systems. In this setup, each agent in the distributed system has an observer with a model of the plant that utilizes the set of locally available measurements, which may not make the full plant state detectable. This lack of detectability is overcome by utilizing a consensus filter that blends the state estimate of each agent with its neighbors' estimates. We assume that the communication graph is connected for all times as well as the sensing graph. It is proven that the state estimates of the proposed observer asymptotically converge to the actual plant states under arbitrarily changing, but connected, communication and sensing topologies. As a byproduct of this research, we also obtained a result on the location of eigenvalues, the spectrum, of the Laplacian for a family of graphs with self-loops.
embedded consensus↗
Properties of heuristic search strategies
A directed graph is used to model the search space of a state space representation with single input operators, an AND/OR is used for problem reduction representations, and a theorem proving graph is used for state space representations with multiple input operators. These three graph models and heuristic strategies for searching them are surveyed. The completeness, admissibility, and optimality properties of search strategies which use the evaluation function f = (1 - omega)g = omega(h) are presented and interpreted using a representation of the search process in the plane. The use of multiple output operators to imply dependent successors, and thus obtain a formalism which includes all three types of representations, is discussed.
Vanderbrug, G. J.↗
Screening of Li-Based Solid Electrolytes Using Bond-Valence Methods and Graph Neural Networks
Li-based solid-state electrolyte (Li-SSE) materials enable safer, all-solid-state batteries but the computational search for candidates with favorable stability and Li-ion conductivity is challenging due to the size of the search space and the cost of evaluating transport properties with ab initio methods. We present a high-throughput screening approach for Li-SSE materials using a combination of bond-valence methods and graph neural networks. We demonstrate the screening approach with a dataset containing tens of thousands of Li-containing compounds. Furthermore, we combine the machine-learning screening procedure with an isovalent substitution scheme to generate and screen additional Li SSE candidates beyond existing databases. Finally, we discuss relative importances of geometric and bond-valence quantities in the training of graph neural networks, providing insight for future modeling of ionic conductivity in Li-SSE materials.
Materials discovery↗
Bond graph for modeling valves and switches
Digital graph element represents two-state devices. It can be used in modeling mechanical stops, backlash, and other discontinuities that occur whenever subsystems are connected or disconnected.
Gebben, V. D.↗
Synchronous meteorological and geostationary operational environmental satellites operational experience
The mode of operation that is of interest in this discussion is a solar array battery load-sharing mode. The battery is loaded for a fraction of a second and then charged, so the cycle is a 100 millisecond load, followed by a 500 millisecond charge. The purpose of the experiment was to evaluate the charge efficiency and the state of charge. Charge/discharge ratio graphs are presented.
Haas, R. J.↗
Computer-aided boundary delineation of agricultural lands
The National Agricultural Statistics Service of the United States Department of Agriculture (USDA) presently uses labor-intensive aerial photographic interpretation techniques to divide large geographical areas into manageable-sized units for estimating domestic crop and livestock production. Prototype software, the computer-aided stratification (CAS) system, was developed to automate the procedure, and currently runs on a Sun-based image processing system. With a background display of LANDSAT Thematic Mapper and United States Geological Survey Digital Line Graph data, the operator uses a cursor to delineate agricultural areas, called sampling units, which are assigned to strata of land-use and land-cover types. The resultant stratified sampling units are used as input into subsequent USDA sampling procedures. As a test, three counties in Missouri were chosen for application of the CAS procedures. Subsequent analysis indicates that CAS was five times faster in creating sampling units than the manual techniques were.
Cheng, Thomas D.↗
Robot Acquisition of Active Maps Through Teleoperation and Vector Space Analysis
The work performed under this contract was in the area of intelligent robotics. The problem being studied was the acquisition of intelligent behaviors by a robot. The method was to acquire action maps that describe tasks as sequences of reflexive behaviors. Action maps (a.k.a. topological maps) are graphs whose nodes represent sensorimotor states and whose edges represent the motor actions that cause the robot to proceed from one state to the next. The maps were acquired by the robot after being teleoperated or otherwise guided by a person through a task several times. During a guided task, the robot records all its sensorimotor signals. The signals from several task trials are partitioned into episodes of static behavior. The corresponding episodes from each trial are averaged to produce a task description as a sequence of characteristic episodes. The sensorimotor states that indicate episode boundaries become the nodes, and the static behaviors, the edges. It was demonstrated that if compound maps are constructed from a set of tasks then the robot can perform new tasks in which it was never explicitly trained.
Peters, Richard Alan, II↗
Simulator for heterogeneous dataflow architectures
A new simulator is developed to simulate the execution of an algorithm graph in accordance with the Algorithm to Architecture Mapping Model (ATAMM) rules. ATAMM is a Petri Net model which describes the periodic execution of large-grained, data-independent dataflow graphs and which provides predictable steady state time-optimized performance. This simulator extends the ATAMM simulation capability from a heterogenous set of resources, or functional units, to a more general heterogenous architecture. Simulation test cases show that the simulator accurately executes the ATAMM rules for both a heterogenous architecture and a homogenous architecture, which is the special case for only one processor type. The simulator forms one tool in an ATAMM Integrated Environment which contains other tools for graph entry, graph modification for performance optimization, and playback of simulations for analysis.
Malekpour, Mahyar R.↗
Task scheduling in dataflow computer architectures
Dataflow computers provide a platform for the solution of a large class of computational problems, which includes digital signal processing and image processing. Many typical applications are represented by a set of tasks which can be repetitively executed in parallel as specified by an associated dataflow graph. Research in this area aims to model these architectures, develop scheduling procedures, and predict the transient and steady state performance. Researchers at NASA have created a model and developed associated software tools which are capable of analyzing a dataflow graph and predicting its runtime performance under various resource and timing constraints. These models and tools were extended and used in this work. Experiments using these tools revealed certain properties of such graphs that require further study. Specifically, the transient behavior at the beginning of the execution of a graph can have a significant effect on the steady state performance. Transformation and retiming of the application algorithm and its initial conditions can produce a different transient behavior and consequently different steady state performance. The effect of such transformations on the resource requirements or under resource constraints requires extensive study. Task scheduling to obtain maximum performance (based on user-defined criteria), or to satisfy a set of resource constraints, can also be significantly affected by a transformation of the application algorithm. Since task scheduling is performed by heuristic algorithms, further research is needed to determine if new scheduling heuristics can be developed that can exploit such transformations. This work has provided the initial development for further long-term research efforts. A simulation tool was completed to provide insight into the transient and steady state execution of a dataflow graph. A set of scheduling algorithms was completed which can operate in conjunction with the modeling and performance tools previously developed. Initial studies on the performance of these algorithms were done to examine the effects of application algorithm transformations as measured by such quantities as number of processors, time between outputs, time between input and output, communication time, and memory size.
Katsinis, Constantine↗