ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 40
Page 102
... C - Space of the object to generate nodes of a graph . II . Calculate the region of the feasible finger positions . III . Calculate the movable directions of the object using the algorithm described in the previous section , and connect ...
... C - Space of the object to generate nodes of a graph . II . Calculate the region of the feasible finger positions . III . Calculate the movable directions of the object using the algorithm described in the previous section , and connect ...
Page 111
... C - space [ 2 ] . That means obstacles are not re- ally existing in C - space , they are represented by a fast , hierarchical distance calculation [ 3 ] done in 3D- workspace during the search ( Fig . 2 ) . Therefor we call it implicit ...
... C - space [ 2 ] . That means obstacles are not re- ally existing in C - space , they are represented by a fast , hierarchical distance calculation [ 3 ] done in 3D- workspace during the search ( Fig . 2 ) . Therefor we call it implicit ...
Page 112
... C - space In the following , a simplified sequence of the algorithm is introduced , detailed information can be found in the referred sections : 1. Create points depending on the points P for the modification of the path ( section 3.2 ) ...
... C - space In the following , a simplified sequence of the algorithm is introduced , detailed information can be found in the referred sections : 1. Create points depending on the points P for the modification of the path ( section 3.2 ) ...
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