ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 86
Page 11
... defined as the component , cj , i.e. range ( f ) = cj . Subsequently , the inverse can be defined , range 1 ( c ) = f . Note that the inverse may not be unique since more than one operation can produce the component Cj . Definition 4 ...
... defined as the component , cj , i.e. range ( f ) = cj . Subsequently , the inverse can be defined , range 1 ( c ) = f . Note that the inverse may not be unique since more than one operation can produce the component Cj . Definition 4 ...
Page 30
... defined in the common ontology : 1 ) Termination nodes : The START and END termination nodes delimit the beginning and end of the graph structure respectively . 2 ) Task nodes : Task nodes represent the tasks being executed in a plan ...
... defined in the common ontology : 1 ) Termination nodes : The START and END termination nodes delimit the beginning and end of the graph structure respectively . 2 ) Task nodes : Task nodes represent the tasks being executed in a plan ...
Page 155
... defined by : D : ( r6 < 0 ) Now , if the coordinates and orientation of the peg are known , we can calculate the region where the peg is . This region is limited by several constraint equations . Each constraint defines an edge between ...
... defined by : D : ( r6 < 0 ) Now , if the coordinates and orientation of the peg are known , we can calculate the region where the peg is . This region is limited by several constraint equations . Each constraint defines an edge between ...
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