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

### From inside the book

Results 1-3 of 72

Page 83

( a ) Genetic representation of an encoded

dimensional points . The numbers in the nodes of the binary tree represent the

order in which the nodes are processed ( postorder traversal of the binary tree ) .

( a ) Genetic representation of an encoded

**path**. Ad ; ' s represent ( D - 1 ) -dimensional points . The numbers in the nodes of the binary tree represent the

order in which the nodes are processed ( postorder traversal of the binary tree ) .

Page 282

Try to find a

configurations . Continue to the next iteration ( line 6 ) if no collision - free

found . 12 . Optimize y ' . 13 . if L ( ' ) < 10 ) then x + x ' , y = y ' . 14. until the

termination ...

Try to find a

**path**w ' between Iinit ( x ' ) and 9 goal ( 2 ' ) through the newconfigurations . Continue to the next iteration ( line 6 ) if no collision - free

**path**isfound . 12 . Optimize y ' . 13 . if L ( ' ) < 10 ) then x + x ' , y = y ' . 14. until the

termination ...

Page 283

For the purpose of this paper , we define the cost of a

takes an n - joint manipulator to execute the

achieve maximum velocity in negligible amount of time . Thus if each joint of A

has ...

For the purpose of this paper , we define the cost of a

**path**to be the time that ittakes an n - joint manipulator to execute the

**path**, assuming that all joints canachieve maximum velocity in negligible amount of time . Thus if each joint of A

has ...

### 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