ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 83
Page 221
... operations , which amounts to assuming that a product can be assembled by any succession of the operations . Fitted with acyclic precedence constraints , the Bin Packing Problem becomes the Line Balancing Problem ( [ Chow , 90 ] ...
... operations , which amounts to assuming that a product can be assembled by any succession of the operations . Fitted with acyclic precedence constraints , the Bin Packing Problem becomes the Line Balancing Problem ( [ Chow , 90 ] ...
Page 245
... operation is more efficient than two binary operations . Then it determines the ternary operations that are missed by the assembly sequences planners with binary operations . This method is an extension of the traditional assembly ...
... operation is more efficient than two binary operations . Then it determines the ternary operations that are missed by the assembly sequences planners with binary operations . This method is an extension of the traditional assembly ...
Page 248
... operation ) . Such an operation will be noted ( X1 , X2 , X3 ) . The main difficulty in the assembly sequences planning problem with ternary operations is that it is unrealistic to generate all the ternary assembly operations with an ...
... operation ) . Such an operation will be noted ( X1 , X2 , X3 ) . The main difficulty in the assembly sequences planning problem with ternary operations is that it is unrealistic to generate all the ternary assembly operations with an ...
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