ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 85
Page 204
... solutions ) from the actual single processor solution distribution . We have developed a method , called the T estima- tion method , capable of computing accurate estimates of both the time needed by a parallel algorithm to solve a ...
... solutions ) from the actual single processor solution distribution . We have developed a method , called the T estima- tion method , capable of computing accurate estimates of both the time needed by a parallel algorithm to solve a ...
Page 205
... solution times for the problem shown in Figure 2. The graphs compare the rel- ative upward and downward prediction error delivered by the T1 and T methods . The ... solution . Given enough processors a solution is found in short time 205.
... solution times for the problem shown in Figure 2. The graphs compare the rel- ative upward and downward prediction error delivered by the T1 and T methods . The ... solution . Given enough processors a solution is found in short time 205.
Page 222
... solution . This means that a feasible solution to the line design problem is constructed at the outset . This initial solution is usually not a very good one - the optimization process starts from it to find the optimum . The user has a ...
... solution . This means that a feasible solution to the line design problem is constructed at the outset . This initial solution is usually not a very good one - the optimization process starts from it to find the optimum . The user has a ...
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