ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 10
Page 112
... path in C - space In the following , a simplified sequence of the algorithm is introduced , detailed information can ... Representation of the different trajectory combinations in C - Space ( Po - So ; P = S4 ) 3.2 Shifting path points ...
... path in C - space In the following , a simplified sequence of the algorithm is introduced , detailed information can ... Representation of the different trajectory combinations in C - Space ( Po - So ; P = S4 ) 3.2 Shifting path points ...
Page 113
... Path direction N ° of iteration Status of the path point 110 1 = 2 i = 3 i4 X X Case 7 2 X X Case 7 +3 45 X X X 0 X 0 X Case 7 X X Case 6 X X Case 5 X X X 0 X Figure 7 : Representation of the different path combi- nation . 0 000 i - 1 ...
... Path direction N ° of iteration Status of the path point 110 1 = 2 i = 3 i4 X X Case 7 2 X X Case 7 +3 45 X X X 0 X 0 X Case 7 X X Case 6 X X Case 5 X X X 0 X Figure 7 : Representation of the different path combi- nation . 0 000 i - 1 ...
Page 290
... representation described in the problem definition . The output is used to control the SPM tip with the Probe ... path , i.e. , a single linear path from the initial position of the object to its final destination . The assignment is ...
... representation described in the problem definition . The output is used to control the SPM tip with the Probe ... path , i.e. , a single linear path from the initial position of the object to its final destination . The assignment is ...
Contents
Session M1B Assembly Planning Room | 27 |
Session M1C Production System1 Room C | 61 |
Concurrent Requirement Specification for Conceptual Design of Modular Assembly Cells | 79 |
Copyright | |
17 other sections not shown
Other editions - View all
Common terms and phrases
4th IEEE International air hoist algorithm applied approach Assembly and Task assembly model assembly planning assembly process assembly sequences assembly system assembly task automatic B-spline Bayesian network calculated camera cell components computed configuration constraints contact point coordinate cost defined described developed disassembly disassembly sequences dynamic environment evaluation feasible finger flexible force Fukuoka function genetic algorithm geometric holons IEEE International Symposium information entropy input Japan kinematic liaison Lie algebra machine manipulation manufacturing matrix mechanical method misalignment mobile robot module motion planning node obstacles obtained operation optimal parameters path Petri Petri net Planning Soft Research pneumatic circuit possible precedence graph problem proposed Radon transform recycling represented Robotics and Automation rotation self-organizing map sensor shown in Figure simulation Soft Research Park solutions specific step subassembly Symposium on Assembly Task Planning Soft tion trajectory vector velocity