ProceedingsIEEE Computer Society Press, 1999 - Artificial intelligence |
From inside the book
Results 1-3 of 85
Page 265
The parameter space must be quantized ( strictly speaking , 0 is sampled and p is
quantized ) . The selection of the ... Typically they are chosen to obtain a
parameter space of about the same size of the coordinate space . The building of
the ...
The parameter space must be quantized ( strictly speaking , 0 is sampled and p is
quantized ) . The selection of the ... Typically they are chosen to obtain a
parameter space of about the same size of the coordinate space . The building of
the ...
Page 275
The characterization of free space becomes more accurate in the workspace than
in configuration space , resulting in a more efficient description of trajectories . In
addition , by avoiding configuration space computation , the framework ...
The characterization of free space becomes more accurate in the workspace than
in configuration space , resulting in a more efficient description of trajectories . In
addition , by avoiding configuration space computation , the framework ...
Page 288
The following discussion also applies to obstacles in { PxPy , Pz space . The c -
space obstacle C ( A , B , 00 ) describes the set of positions of A , with orientation
Oo , resulting in interference with B . It can be expressed as the Minkowski sum of
...
The following discussion also applies to obstacles in { PxPy , Pz space . The c -
space obstacle C ( A , B , 00 ) describes the set of positions of A , with orientation
Oo , resulting in interference with B . It can be expressed as the Minkowski sum of
...
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 | |
38 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 force frame framework 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 operations 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