ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 32
Page 40
... final assembly can be formed in three separate ways : i . ) The joining of the { CAP } to the sub- assembly { STICK , RECEPTACLE , HANDLE } ii . ) The joining of the sub - assembly { CAP , STICK } and sub - assembly { HANDLE ...
... final assembly can be formed in three separate ways : i . ) The joining of the { CAP } to the sub- assembly { STICK , RECEPTACLE , HANDLE } ii . ) The joining of the sub - assembly { CAP , STICK } and sub - assembly { HANDLE ...
Page 95
... final result when N = 10 and t = 3 . We see the computed solution is in good agreement with strict solution . But if tf lengthened , the strict solution becomes complex and the solution can not be described well by B- spline when N = 10 ...
... final result when N = 10 and t = 3 . We see the computed solution is in good agreement with strict solution . But if tf lengthened , the strict solution becomes complex and the solution can not be described well by B- spline when N = 10 ...
Page 408
... final product , being the assembly of the parts . In high labour cost countries production is usually automated ... final goal would then be for the tolerance analysis software to take the processes and the assembly capabilities as input ...
... final product , being the assembly of the parts . In high labour cost countries production is usually automated ... final goal would then be for the tolerance analysis software to take the processes and the assembly capabilities as input ...
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