ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 82
Page 55
... method for the building of these ASTD . This paper contributes to the simplification of genera- tion of ASTD . The systematic determination of ASTD proposed here is an indirect generation by assembly graphs . A global schema shows the ...
... method for the building of these ASTD . This paper contributes to the simplification of genera- tion of ASTD . The systematic determination of ASTD proposed here is an indirect generation by assembly graphs . A global schema shows the ...
Page 220
... method to automatically derive all the feasible subassemblies and transitions between them from assembly drawings . The method uses repre- sentation of the precedence relations via Boolean expres- sions . As a result , the transition ...
... method to automatically derive all the feasible subassemblies and transitions between them from assembly drawings . The method uses repre- sentation of the precedence relations via Boolean expres- sions . As a result , the transition ...
Page 312
... method for kinematic synthesis of mechanisms from assembly task specifications in a conceptual design . The assembly task is classified into continuous path or positioning task . The former is the task that moves a mechanical part along ...
... method for kinematic synthesis of mechanisms from assembly task specifications in a conceptual design . The assembly task is classified into continuous path or positioning task . The former is the task that moves a mechanical part along ...
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