ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 49
Page 55
... Transition Diagrams ( ASTD ) present some interesting features . Unfortunately there is no easy method for the building of these ASTD . This paper contributes to the simplification of genera- tion of ASTD . The systematic determination ...
... Transition Diagrams ( ASTD ) present some interesting features . Unfortunately there is no easy method for the building of these ASTD . This paper contributes to the simplification of genera- tion of ASTD . The systematic determination ...
Page 233
... transition in a disassembly tree . In such a tree , the places and the transitions represent respectively the stocks and the activity factor of the stations . Each transition T has a crossing speed V : V = U.min ( m , 1 , min ; ( C ; -m ...
... transition in a disassembly tree . In such a tree , the places and the transitions represent respectively the stocks and the activity factor of the stations . Each transition T has a crossing speed V : V = U.min ( m , 1 , min ; ( C ; -m ...
Page 388
... transition nets and Petri nets 2.2 Design Object Models The central design process inherent in design with ob- jects ... transition " model is used to represent the mechanical systems and assemblies , in which each part is represented as ...
... transition nets and Petri nets 2.2 Design Object Models The central design process inherent in design with ob- jects ... transition " model is used to represent the mechanical systems and assemblies , in which each part is represented as ...
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