ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 88
Page 17
... Path 2 consider- ing only velocity change obstacle 1 goal maximum velocity of obstacles maximum acceleration of ... path . The robot does not know the trajectory of the obstacle in advance . Path 1 ( Fig.5 ) shows the resultant path ...
... Path 2 consider- ing only velocity change obstacle 1 goal maximum velocity of obstacles maximum acceleration of ... path . The robot does not know the trajectory of the obstacle in advance . Path 1 ( Fig.5 ) shows the resultant path ...
Page 268
... path - planning algorithm syn- chronously selects shortest paths of multiple mobile robots . Therefore , it is time consuming because of hard combi- nation search . On the other hand , a local path - planning algorithm independently ...
... path - planning algorithm syn- chronously selects shortest paths of multiple mobile robots . Therefore , it is time consuming because of hard combi- nation search . On the other hand , a local path - planning algorithm independently ...
Page 339
... path is defined as a sequence of successive part and feature nodes starting from any part node and ending at fixed part node ( see Fig . 1 ) . A valid path needs to obey following rules : 1. The union ... paths and any other path until 339.
... path is defined as a sequence of successive part and feature nodes starting from any part node and ending at fixed part node ( see Fig . 1 ) . A valid path needs to obey following rules : 1. The union ... paths and any other path until 339.
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