ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 36
Page 190
... intersect each other . In these cases , portions of the envelope of the moving polygon's plane ( a developable ... intersection graph can be traversed to find the boundary of the swept volume . Computing the intersections of these ...
... intersect each other . In these cases , portions of the envelope of the moving polygon's plane ( a developable ... intersection graph can be traversed to find the boundary of the swept volume . Computing the intersections of these ...
Page 388
... intersection testing between convex pieces is carried out with a linear programming technique which also provides where the intersection has occurred . Furthermore , multiple intersection tests can be run in parallel . As a result , a ...
... intersection testing between convex pieces is carried out with a linear programming technique which also provides where the intersection has occurred . Furthermore , multiple intersection tests can be run in parallel . As a result , a ...
Page 391
... intersection , it is sufficient to determine whether the problem has a feasible region or not . If two convex pieces share a common space , its linear programming problem has a feasible region . In linear programming , some artificial ...
... intersection , it is sufficient to determine whether the problem has a feasible region or not . If two convex pieces share a common space , its linear programming problem has a feasible region . In linear programming , some artificial ...
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