Heuristically Ordered Search in State Graphs

AbstractForty years ago the notion of configuration space (C-space) revolutionised robot motion planning for rigid and articulated objects. Despite great progress, handling deformable materials has remained elusive because of their infinite-dimensional shape-state space. Finding low-complexity representations has become a pressing research goal. This work tries to make a tiny step in this direction by proposing a state representation for textiles relying on the C-space of some distinctive points. A stratification of the configuration space for n points in the cloth is derived from that of the flag manifold, and topological techniques to determine adjacencies in manipulation-centred state graphs are developed. Their algorithmic implementation permits obtaining cloth state–space representations of different granularities and tailored to particular purposes. An example of their usage to distinguish between cloth states having different manipulation affordances is provided. Suggestions on how the proposed state graphs can serve as a common ground to link the perception, planning and manipulation of textiles are also made.

Download Full-text

REPRESENTATIONS AND IDENTIFICATIONS OF STRUCTURAL AND MOTION STATE CHARACTERISTICS OF MECHANISMS WITH VARIABLE TOPOLOGIES

Transactions of the Canadian Society for Mechanical Engineering ◽

10.1139/tcsme-2006-0003 ◽

2006 ◽

Vol 30 (1) ◽

pp. 19-40 ◽

Cited By ~ 17

Author(s):

Hong-Sen Yan ◽

Chin-Hsing Kuo

Keyword(s):

Topological Structure ◽

Topological Analysis ◽

State Machines ◽

Matrix Representations ◽

Motion State ◽

New Concepts ◽

Synthesis Of Mechanisms ◽

Analysis And Synthesis ◽

Finite State ◽

State Graphs

A mechanism that encounters a certain changes in its topological structure during operation is called a mechanism with variable topologies (MVT). This paper is developed for the structural and motion state representations and identifications of MVTs. For representing the topological structures of MVTs, a set of methods including graph and matrix representations is proposed. For representing the motion state characteristics of MVTs, the idea of finite-state machines is employed via the state tables and state graphs. And, two new concepts, the topological homomorphism and motion homomorphism, are proposed for the identifications of structural and motion state characteristics of MVTs. The results of this work provide a logical foundation for the topological analysis and synthesis of mechanisms with variable topologies.

Download Full-text

Cognitive assembly planning using state graphs

Advances in Human Factors, Ergonomics, and Safety in Manufacturing and Service Industries - Advances in Human Factors and Ergonomics Series ◽

10.1201/ebk1439834992-26 ◽

2010 ◽

pp. 243-252 ◽

Cited By ~ 3

Author(s):

Daniel Ewert ◽

Eckart Hauck ◽

Daniel Schilberg ◽

Sabina Jeschke

Keyword(s):

Assembly Planning ◽

State Graphs

Download Full-text

Clock Synchronization State Graphs Based on Clock Precision Difference

Distributed and Parallel Computing - Lecture Notes in Computer Science ◽

10.1007/11564621_4 ◽

2005 ◽

pp. 34-39

Author(s):

Ying Zhao ◽

Wanlei Zhou ◽

Yingying Zhang ◽

E. J. Lanham ◽

Jiumei Huang

Keyword(s):

Clock Synchronization ◽

State Graphs

Download Full-text

Breakout detection for fast EDM drilling by classification of machining state graphs

The International Journal of Advanced Manufacturing Technology ◽

10.1007/s00170-019-04530-3 ◽

2019 ◽

Vol 106 (5-6) ◽

pp. 1645-1656 ◽

Cited By ~ 1

Author(s):

Weiwen Xia ◽

Zilun Li ◽

Yaou Zhang ◽

Wansheng Zhao

Keyword(s):

State Graphs ◽

Edm Drilling

Download Full-text

An Authorization Mechanism for a Document Database

ASME 1994 8th Annual Database Symposium ◽

10.1115/edm1994-0508 ◽

1994 ◽

Author(s):

Hannu Peltonen ◽

Kari Alho ◽

Tomi Männistö ◽

Reijo Sulonen

Keyword(s):

Relational Database ◽

Database Administrator ◽

Specific Protocol ◽

Document Database ◽

State Graphs ◽

Database Operations ◽

Special Language

Abstract A programmable authorization mechanism for an engineering document database is described. The database stores documents and their versions in a commercial relational database. Documents and other objects contain user-defined attributes. Release and approval procedures of the documents are described by means of state graphs that specify the possible states of a document and the transitions between them. The system consists of centralized server and client programs, which communicate with the server using a specific protocol. The database administrator must be able to formulate rules that tell who is allowed to do particular database operations; rules that tell which operations are allowed in particular document states; and rules that describe consistency invariants between attributes. These rules are expressed by means of authorization procedures written in a special language. Whenever the server receives an operation request, it executes the corresponding authorization procedure. The system can thus be easily adapted to an organization without actually modifying the client or server programs.

Download Full-text