ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 69
Page 27
... connected to the current roadmap , or as a new connector if it improves the connectivity of the roadmap ( i.e. it can be connected to two different connected components ) . An advantage of this algorithm is the small size of the ...
... connected to the current roadmap , or as a new connector if it improves the connectivity of the roadmap ( i.e. it can be connected to two different connected components ) . An advantage of this algorithm is the small size of the ...
Page 279
... connection state to Block Tail Target position < Initial state > Head New head Flow direction < Final state > Modules ... connected modules ID 1 Rule then : step 1 : < Motion scheme applied > Motion scheme ID 1 base p2 rot ( 90 , -90 ) ...
... connection state to Block Tail Target position < Initial state > Head New head Flow direction < Final state > Modules ... connected modules ID 1 Rule then : step 1 : < Motion scheme applied > Motion scheme ID 1 base p2 rot ( 90 , -90 ) ...
Page 339
... connects more than one part . Example : If three links are connected to a grounded pivot , one should terminate the path after reaching to feature node corresponding to grounded pivot instead of moving on to any of the links connected ...
... connects more than one part . Example : If three links are connected to a grounded pivot , one should terminate the path after reaching to feature node corresponding to grounded pivot instead of moving on to any of the links connected ...
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