ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 25
Page 57
... disassembly plan ( one of many possible ) has thus been described by specifying the order of part removal and the motions required to move the parts . All disassembly plans can be generated by combi- natorially choosing each part as a ...
... disassembly plan ( one of many possible ) has thus been described by specifying the order of part removal and the motions required to move the parts . All disassembly plans can be generated by combi- natorially choosing each part as a ...
Page 62
... disassembly tasks . procedure GenerateTasks ( subassembly ) begin if it is a single - component assembly then return No Task repeat begin Figure 10a : Example assembly with four components . begin put assembly into the initial AND / OR ...
... disassembly tasks . procedure GenerateTasks ( subassembly ) begin if it is a single - component assembly then return No Task repeat begin Figure 10a : Example assembly with four components . begin put assembly into the initial AND / OR ...
Page 242
... disassembly Petri net is safe . The initial marking Mo is such that Mo ( Pproduct ) and Mo ( p ) = 0 Vp Є P , p Pproduct . Pproduct belongs to all P - semiflows . Thus the number of tokens in any P - semiflow is 1 and the net is covered ...
... disassembly Petri net is safe . The initial marking Mo is such that Mo ( Pproduct ) and Mo ( p ) = 0 Vp Є P , p Pproduct . Pproduct belongs to all P - semiflows . Thus the number of tokens in any P - semiflow is 1 and the net is covered ...
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