ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 12
Page 202
... processor nCUBE21 , a 512 - processor CM52 , and a 16- processor network of Sun workstations [ 6 ] . 3 Parallel Motion Planning In recent years parallel search algorithms have been shown to be effective for solving combinatorially ex ...
... processor nCUBE21 , a 512 - processor CM52 , and a 16- processor network of Sun workstations [ 6 ] . 3 Parallel Motion Planning In recent years parallel search algorithms have been shown to be effective for solving combinatorially ex ...
Page 203
... processor solution time . If E [ T ] is less than E [ T1 ] , then , on average , the k pro- cessor randomized allocation formulation will deliver speedup over the uniprocessor algorithm . ยท If E [ T ] is less than E [ T1 ] then , on k ...
... processor solution time . If E [ T ] is less than E [ T1 ] , then , on average , the k pro- cessor randomized allocation formulation will deliver speedup over the uniprocessor algorithm . ยท If E [ T ] is less than E [ T1 ] then , on k ...
Page 204
... processor by successively execut- ing randomized parallel search on a fixed number of processors . This is done as follows . Let T1 be a random variable which denotes the time taken by uniprocessor randomized search to find a solution ...
... processor by successively execut- ing randomized parallel search on a fixed number of processors . This is done as follows . Let T1 be a random variable which denotes the time taken by uniprocessor randomized search to find a solution ...
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