ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 17
Page 87
... cycle , thus reducing design cycle time . A number of factors influence the difficulty in exe- cuting an assembly task . These include picking , mov- ing , and positioning parts and tools . We focus on dif- ficulty arising from spatial ...
... cycle , thus reducing design cycle time . A number of factors influence the difficulty in exe- cuting an assembly task . These include picking , mov- ing , and positioning parts and tools . We focus on dif- ficulty arising from spatial ...
Page 221
... cycle time as the capacity of the bins , the problem becomes one of distributing the operations among workstations in such a way that no workstation overflows the cycle time and the minimum number of workstations is used . Thus the Bin ...
... cycle time as the capacity of the bins , the problem becomes one of distributing the operations among workstations in such a way that no workstation overflows the cycle time and the minimum number of workstations is used . Thus the Bin ...
Page 243
... cycle time : Let T ; be the delay associated to transition t ;. The minimum cycle time of an MG is given by [ 14 ] : r = max { ( Σ Ti ) / Mo ( Ck ) } iECK where Mo ( C ) denotes the number of tokens in Ck in marking Mo. In the MG's ...
... cycle time : Let T ; be the delay associated to transition t ;. The minimum cycle time of an MG is given by [ 14 ] : r = max { ( Σ Ti ) / Mo ( Ck ) } iECK where Mo ( C ) denotes the number of tokens in Ck in marking Mo. In the MG's ...
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