ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 54
Page 10
... nodes . Evidence of these sensing nodes will be propagated to root node , and using these poste- rior probability to decide if this crossing can guide the mobile robot to the goal . cost . We use a parameter t ( 0 ≤ t≤ 1 ) to balance ...
... nodes . Evidence of these sensing nodes will be propagated to root node , and using these poste- rior probability to decide if this crossing can guide the mobile robot to the goal . cost . We use a parameter t ( 0 ≤ t≤ 1 ) to balance ...
Page 90
... node ( 20 parts dis- tributor nodes , 1 printed circuit board fabrication node and 1 printed circuit assembly node ) distributed environ- ment . We assume that the search at any parts distributor node occurs over the full set of module ...
... node ( 20 parts dis- tributor nodes , 1 printed circuit board fabrication node and 1 printed circuit assembly node ) distributed environ- ment . We assume that the search at any parts distributor node occurs over the full set of module ...
Page 339
... node . It creates a redundant loop . However , a part node other than the starting part node may be revisited . to 3. If a path visits a feature node that is linked fixed part node , path should immediately terminate to fixed part node ...
... node . It creates a redundant loop . However , a part node other than the starting part node may be revisited . to 3. If a path visits a feature node that is linked fixed part node , path should immediately terminate to fixed part node ...
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