## ProceedingsIEEE Computer Society Press, 1999 - Artificial intelligence |

### From inside the book

Results 1-3 of 62

Page 15

The digraph of this relation is G = ( S , O . ) and we call it precedence graph . For

a given set of symbols S and for a given set of

order relation og and its precedence graph G are uniquely defined We consider ...

The digraph of this relation is G = ( S , O . ) and we call it precedence graph . For

a given set of symbols S and for a given set of

**complete**sequence 12 , the partialorder relation og and its precedence graph G are uniquely defined We consider ...

Page 16

In a given

the partial sequence S " , i = 1 , 2 , . . . m . In example ... A

the form as , deS2 , where S , is either bc or cb and S2 is either fg or gf . Theorem

...

In a given

**complete**sequence o the segment Si , i = 1 , 2 , . . . m is instanced bythe partial sequence S " , i = 1 , 2 , . . . m . In example ... A

**complete**sequence hasthe form as , deS2 , where S , is either bc or cb and S2 is either fg or gf . Theorem

...

Page 17

Theorem 3 : Let w1 , W2 € be two

sequence of permutations p such that W , P > 02 . Proof : We write the sequences

wi and wz in the form ( 5 ) and we use m times the result of theorem 2 as follows :

6.

Theorem 3 : Let w1 , W2 € be two

**complete**sequences . Then it exists asequence of permutations p such that W , P > 02 . Proof : We write the sequences

wi and wz in the form ( 5 ) and we use m times the result of theorem 2 as follows :

6.

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

ASSEMBLY | 1 |

FeatureBased Assembly Model and MultiAgents System structure for ComputerAided Assembly | 8 |

Construction of the Precedence Graphs Equivalent to a Given Set of Assembly Sequences | 14 |

Copyright | |

42 other sections not shown

### Other editions - View all

### Common terms and phrases

acts algorithm allows analysis applied approach assembly planning assembly process assembly sequence automatically Automation complete components Computer configuration connection considered constraints coordinate corresponding cost defined described Design for Assembly detailed determined developed direction disassembly Engineering evaluation example Figure Finally force frame function geometric given graph IEEE implemented initial insertion integration International joint kinematic knowledge limit machining manipulator manufacturing material measurement mechanical method motion move node object obstacles obtained operation optimal orientation path performed planner position possible presented problem Proc process planning proposed recycling References region relation representation represented respect robot rotation selection shown shows simulation solution space specific sphere stage step strategy structure subassembly surface task testing tool trajectory variables vector