ProceedingsIEEE Computer Society Press, 2001 - Artificial intelligence |
From inside the book
Results 1-3 of 54
Page 16
... Feasible velocities and feasible avoidance veloci- ties This section formulates an on - line motion planning problem where a mobile robot should be navigated from a start point to an end point in the populous mov- ing obstacles ...
... Feasible velocities and feasible avoidance veloci- ties This section formulates an on - line motion planning problem where a mobile robot should be navigated from a start point to an end point in the populous mov- ing obstacles ...
Page 222
... feasible actions is the set of transitions between a feasible parent subassembly and two feasi- ble child subassemblies that are complementary with respect to the parent subassembly . 7. With the sets of feasible subassemblies and ...
... feasible actions is the set of transitions between a feasible parent subassembly and two feasi- ble child subassemblies that are complementary with respect to the parent subassembly . 7. With the sets of feasible subassemblies and ...
Page 462
... feasible operations are sought again ( using the operative constraints ) . 3. And so on until obtaining the final components ( or until an interruption defined by a criterion for stop ) . For each subassembly , all the feasible ...
... feasible operations are sought again ( using the operative constraints ) . 3. And so on until obtaining the final components ( or until an interruption defined by a criterion for stop ) . For each subassembly , all the feasible ...
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