ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 44
Page 13
... obstacles , where the multiple obstacles always change their velocities . For more applications of mobile robots to real world , the robots are expect- ed to work well in everyday space such that people are walking around . The robot ...
... obstacles , where the multiple obstacles always change their velocities . For more applications of mobile robots to real world , the robots are expect- ed to work well in everyday space such that people are walking around . The robot ...
Page 14
... obstacles are mapped into a two - dimensional " velocity space " . Then velocity of mobile robot is di- rectly planned using the Velocity Obstacle in velocity space . More detailed review on the planning problem for moving obstacles are ...
... obstacles are mapped into a two - dimensional " velocity space " . Then velocity of mobile robot is di- rectly planned using the Velocity Obstacle in velocity space . More detailed review on the planning problem for moving obstacles are ...
Page 17
... Obstacle Robot : The same time interval Fig.6 Path 2 consider- ing only velocity change obstacle 1 goal maximum velocity of obstacles maximum acceleration of obstacles sensor detectable range sensor cycle Ur max = 2.0m / s Vomax = 1.5m ...
... Obstacle Robot : The same time interval Fig.6 Path 2 consider- ing only velocity change obstacle 1 goal maximum velocity of obstacles maximum acceleration of obstacles sensor detectable range sensor cycle Ur max = 2.0m / s Vomax = 1.5m ...
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