ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 85
Page 125
... task is veri- fied , the control algorithm accesses these reference da- ta files and executes the desired task ( s ) through the HEXA robot . Хо Y : Zb -Ye Xe Xt Σ the HEXA base co- ordinate system Ze the end - effector co- ordinate ...
... task is veri- fied , the control algorithm accesses these reference da- ta files and executes the desired task ( s ) through the HEXA robot . Хо Y : Zb -Ye Xe Xt Σ the HEXA base co- ordinate system Ze the end - effector co- ordinate ...
Page 127
... task failure . The initial task execution time is set as 4.0 [ s ] and is decremented by a step of 0.1 [ s ] until an execution failure is observed . Consequently , it was possible to execute the same task in as little as 1.2 [ s ] . y ...
... task failure . The initial task execution time is set as 4.0 [ s ] and is decremented by a step of 0.1 [ s ] until an execution failure is observed . Consequently , it was possible to execute the same task in as little as 1.2 [ s ] . y ...
Page 312
... 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 a required path , and the latter is the task that puts the ...
... 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 a required path , and the latter is the task that puts the ...
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