ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 82
Page 39
... possible to express any state as a unique number that is the sum of the weighted vectors . The parts in a product can be arbitrarily assigned numbers in any sequence as the method does not require identification of a " base " or similar ...
... possible to express any state as a unique number that is the sum of the weighted vectors . The parts in a product can be arbitrarily assigned numbers in any sequence as the method does not require identification of a " base " or similar ...
Page 40
... possible assembly steps can be represented as : i . ) 8 + 7 = 15 ii . ) 12 + 3 = 15 iii . ) 1 + 14 = 15 A feature of the ASV method is that it is possible to simply store all the possible assembly states as a simple ordered list as ...
... possible assembly steps can be represented as : i . ) 8 + 7 = 15 ii . ) 12 + 3 = 15 iii . ) 1 + 14 = 15 A feature of the ASV method is that it is possible to simply store all the possible assembly states as a simple ordered list as ...
Page 462
... possible operations have to be produced . Then , in a second time , the feasibility of the possible operations has to be studied . An operation is feasible if it satisfy the operative constraints . For a geometric operation , the CG ...
... possible operations have to be produced . Then , in a second time , the feasibility of the possible operations has to be studied . An operation is feasible if it satisfy the operative constraints . For a geometric operation , the CG ...
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