ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 83
Page 127
... algorithm that accepts a fixture design , produced by the Brost - Goldberg algorithm , and augments it by inserting in certain grid holes foolproofing pins that make the in- correct loading impossible.The algorithm is complete in the ...
... algorithm that accepts a fixture design , produced by the Brost - Goldberg algorithm , and augments it by inserting in certain grid holes foolproofing pins that make the in- correct loading impossible.The algorithm is complete in the ...
Page 248
... algorithm fails and is unable to produce any sequence with binary operations . The case illustrated by the product C is even more complex : A valid binary assembly sequence is found by the bi - partition algorithm , but the assembly ...
... algorithm fails and is unable to produce any sequence with binary operations . The case illustrated by the product C is even more complex : A valid binary assembly sequence is found by the bi - partition algorithm , but the assembly ...
Page 334
... algorithm for adjusting a ro- bot motion plan in order to make it feasible in spite of control and sensing uncertainties in the robot config- uration . The type of motion plan considered consists of a nominal commanded path , augmented ...
... algorithm for adjusting a ro- bot motion plan in order to make it feasible in spite of control and sensing uncertainties in the robot config- uration . The type of motion plan considered consists of a nominal commanded path , augmented ...
Contents
A New Approach for the Specification of Assembly Systems | 9 |
Plan Representation and Generation for Manufacturing Tasks | 22 |
Lessons Learned from a Second Generation Assembly Planning System | 41 |
Copyright | |
33 other sections not shown
Other editions - View all
Common terms and phrases
algorithm analysis applied approach Artificial Intelligence assembly model assembly operations assembly planning assembly sequences assembly task camera cell clearance collision common ontology components Computer Conf Conference on Robotics configuration space constraints convex coordinates corresponding Cspace decomposition defined described disassembly domain ellipsoid equation example execution feasible fixels fixture function geometric global goal graph grasp gripper handler IEEE implemented initial input insertion intersection knowledge representation machine manipulator Manufacturing Systems mating method motion planning moving nodes object obstacles octree ontology optimal orientation parameters path path planning performance Petri net Petri nets planner position problem Proc process planning rendezvous-point represent representation robot motion Robotics and Automation scheduling sensor shown in Figure simulation snap fastener solution strategy structure subassemblies subgoal task planning ternary operations tion tool trajectory transition uncertainty vector voxels workcell workpieces