ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 39
Page 57
... subassembly . A single part is the most basic sub- assembly and the entire assembly is the largest possi- ble subassembly . A subassembly is denoted as a list of other subassemblies . The disassembly process out- lined above would be ...
... subassembly . A single part is the most basic sub- assembly and the entire assembly is the largest possi- ble subassembly . A subassembly is denoted as a list of other subassemblies . The disassembly process out- lined above would be ...
Page 62
... subassemblies . List 4. Algorithm to generate disassembly tasks . procedure GenerateTasks ( subassembly ) begin if ... subassemblies in the AND / OR graph are decomposed to single - part subassemblies return the final AND / OR graph end ...
... subassemblies . List 4. Algorithm to generate disassembly tasks . procedure GenerateTasks ( subassembly ) begin if ... subassemblies in the AND / OR graph are decomposed to single - part subassemblies return the final AND / OR graph end ...
Page 322
... subassembly stability and directionality appx values for attributes of subassemblies created in stage 5 and select type of assembly processes finalize design by determining more detailed aspects of design objects final assembly planning ...
... subassembly stability and directionality appx values for attributes of subassemblies created in stage 5 and select type of assembly processes finalize design by determining more detailed aspects of design objects final assembly planning ...
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