ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 80
Page 56
... represents P. nodes represent parts of P. leaves represent elementary components and such that the associated to each results from the part assembly of the parts node associated to each two predecessors . One assembly graph may represent ...
... represents P. nodes represent parts of P. leaves represent elementary components and such that the associated to each results from the part assembly of the parts node associated to each two predecessors . One assembly graph may represent ...
Page 369
... represent the involved processes [ 1-4 ] . When precedence graphs are used to generate plans , the nodes represent manufacturing or assembly operations and the arcs represent precedence relations between operations , expressing the ...
... represent the involved processes [ 1-4 ] . When precedence graphs are used to generate plans , the nodes represent manufacturing or assembly operations and the arcs represent precedence relations between operations , expressing the ...
Page 391
... represented and attached to places and transitions as knowledge annotations . For example , the incidence matrix of the P / T net can represent the liaison matrix ; the directed arcs can represent the partial precedence constraints ...
... represented and attached to places and transitions as knowledge annotations . For example , the incidence matrix of the P / T net can represent the liaison matrix ; the directed arcs can represent the partial precedence constraints ...
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