ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 5
Page 299
... voxels . In the case cited it is a 3 - D space that requires breaking down , allowing algorithms designed to ... voxel is a voxel which is wholly or partially filled with a component . An empty voxel is one that is completely empty . The ...
... voxels . In the case cited it is a 3 - D space that requires breaking down , allowing algorithms designed to ... voxel is a voxel which is wholly or partially filled with a component . An empty voxel is one that is completely empty . The ...
Page 300
... voxels that are full in that branch . p ( 0 ) - p ( 7 ) . Each table entry also contains eight indicators related to ... voxels perpendicular to the chosen plane . If all the voxels in the column or row are empty then the corresponding ...
... voxels that are full in that branch . p ( 0 ) - p ( 7 ) . Each table entry also contains eight indicators related to ... voxels perpendicular to the chosen plane . If all the voxels in the column or row are empty then the corresponding ...
Page 301
... voxel ( or the set of voxels represented by one entry in the table ) is empty or full . When information from a sensor is added to the composite 3 - D model of the robot's workspace , then it is necessary to check for any intersection ...
... voxel ( or the set of voxels represented by one entry in the table ) is empty or full . When information from a sensor is added to the composite 3 - D model of the robot's workspace , then it is necessary to check for any intersection ...
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