ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 16
Page 10
... sequences are noted in [ 10 ] but these can be more simply categorized as either forward searching or backward searching approaches [ 11 ] . Backward search- ing typically generates feasible disassembly sequences ( a decomposition or ...
... sequences are noted in [ 10 ] but these can be more simply categorized as either forward searching or backward searching approaches [ 11 ] . Backward search- ing typically generates feasible disassembly sequences ( a decomposition or ...
Page 57
... disassembly sequences . As there may be a very large number of plans , possibly with identical subplans , a compact efficient notation is required . We will use a set - based notation , for- mally presented by Homem de Mello and ...
... disassembly sequences . As there may be a very large number of plans , possibly with identical subplans , a compact efficient notation is required . We will use a set - based notation , for- mally presented by Homem de Mello and ...
Page 242
... disassembly Petri net is safe . The initial marking Mo is such that Mo ( Pproduct ) and Mo ( p ) = 0 Vp Є P , p ... sequences . Each disassem- bly operation is included in at least one disassembly sequence , thus the necessary condition ...
... disassembly Petri net is safe . The initial marking Mo is such that Mo ( Pproduct ) and Mo ( p ) = 0 Vp Є P , p ... sequences . Each disassem- bly operation is included in at least one disassembly sequence , thus the necessary condition ...
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