ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 84
Page 39
... represented as a sequence of these states . If instead of the binary values a weight , calculated as 2p - 1 where p ... represented as the binary vector : { 0,0,1,1 } can be represented in ASV form as : 0 +0 + 2 + 1 = 3 Using this method ...
... represented as a sequence of these states . If instead of the binary values a weight , calculated as 2p - 1 where p ... represented as the binary vector : { 0,0,1,1 } can be represented in ASV form as : 0 +0 + 2 + 1 = 3 Using this method ...
Page 313
... represented explicitly as linear combinations of the bases , and Lie algebra also makes it easy to synthesize alternatives ( A13 in Fig . 1 ) since all of them can be represented only by finite combinations of the bases . These ...
... represented explicitly as linear combinations of the bases , and Lie algebra also makes it easy to synthesize alternatives ( A13 in Fig . 1 ) since all of them can be represented only by finite combinations of the bases . These ...
Page 388
... represented as the architecture [ 4 ] , as shown in Fig.2 , with five main types of objects involved : namely ... represented as a place and each joint is represented as a transition . Therefore , a mechanical system or assembly can be ...
... represented as the architecture [ 4 ] , as shown in Fig.2 , with five main types of objects involved : namely ... represented as a place and each joint is represented as a transition . Therefore , a mechanical system or assembly can be ...
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