ProceedingsIEEE Computer Society Press, 2003 - Artificial intelligence |
From inside the book
Results 1-3 of 53
Page 92
3 Precedence hypergraphs Now , let us introduce an extension of the classical
precedence graphs , that allows to take into ... We shall briefly present this
algorithm on a new presentation , as a graph transformation , and propose an
extension ...
3 Precedence hypergraphs Now , let us introduce an extension of the classical
precedence graphs , that allows to take into ... We shall briefly present this
algorithm on a new presentation , as a graph transformation , and propose an
extension ...
Page 100
Using the connectivity graph , we generate all possible partitions of G into two -
connected subassemblies . For each part pi , we generate all subassemblies
containing m parts Pi = { P1 , . . . , Pi , . . . , Pm } by depth first search . If the rest of
the ...
Using the connectivity graph , we generate all possible partitions of G into two -
connected subassemblies . For each part pi , we generate all subassemblies
containing m parts Pi = { P1 , . . . , Pi , . . . , Pm } by depth first search . If the rest of
the ...
Page 124
Thus the initial problem ( 1 ) - ( 8 ) can be reduced to a problem of finding the
shortest path in multi - graph G with at most mo arcs . This problem is stated as
follows : ( NK , N£ » € DS , k = 1 . . . . m , 1 , 1 " = 1 . . . Mai ne sno , k = 1 , . . . m ; m
( x ) ...
Thus the initial problem ( 1 ) - ( 8 ) can be reduced to a problem of finding the
shortest path in multi - graph G with at most mo arcs . This problem is stated as
follows : ( NK , N£ » € DS , k = 1 . . . . m , 1 , 1 " = 1 . . . Mai ne sno , k = 1 , . . . m ; m
( x ) ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Microassembly Microfactory | 1 |
Microassembly and Microfactory | 2 |
Scheduling | 16 |
Copyright | |
7 other sections not shown
Other editions - View all
Common terms and phrases
actuator algorithm allows applied approach assembly planning assembly sequences assembly system assigned Automation blocks cell complete components computation configuration connected considered constraints corresponding cost cycle defined depends described determined developed device direction disassembly effect environment equation equipment evaluation example execution Figure final flexible force France function geometric given graph grasping gripper handling holons industrial initial integrated Introduction machining manipulation manufacturing material measured mechanical method micro motion move object obtained operation optimal orientation parameters path performance piezoelectric position possible precedence presented problem Proceedings programming proposed provides References relation representation represents respectively robot scheduling selected sensor shape shown shows simulation solution space step structure surface task Task Planning tion tolerance torque transition virtual volume workstation