ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 23
Page 15
... sampling for planning are constants all the time . 3.2 Application for on - line collision avoidance The idea of ... sampling time . The sampling rate of actual sensor system for mobile robot to detect obstacles is consid- erably low ...
... sampling for planning are constants all the time . 3.2 Application for on - line collision avoidance The idea of ... sampling time . The sampling rate of actual sensor system for mobile robot to detect obstacles is consid- erably low ...
Page 27
... sampling strategy in order to create a higher density of nodes near the boundary of the free - space . The gaussian sampler generates pairs of configurations separated by a gaussian random distance . It only retains a collision - free ...
... sampling strategy in order to create a higher density of nodes near the boundary of the free - space . The gaussian sampler generates pairs of configurations separated by a gaussian random distance . It only retains a collision - free ...
Page 87
... sample ( x ; | ; ) in the distribution P ( i , g + 1 ) is obtained by first sampling R ( i , g ) and then sampling Q ( i , g ) ยท 4. Set g g + 1 , and repeat from Step 2 until some stopping criterion is met . The construction of the ...
... sample ( x ; | ; ) in the distribution P ( i , g + 1 ) is obtained by first sampling R ( i , g ) and then sampling Q ( i , g ) ยท 4. Set g g + 1 , and repeat from Step 2 until some stopping criterion is met . The construction of the ...
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