ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 60
Page 142
... input places and adding O ( p . ) tokens to each of its output places . The basic Petri net can be used to analysis the qualitative performance , such as boundedness , liveness , and reversibility of the system . But it is difficult to ...
... input places and adding O ( p . ) tokens to each of its output places . The basic Petri net can be used to analysis the qualitative performance , such as boundedness , liveness , and reversibility of the system . But it is difficult to ...
Page 150
... input buffers until their allotted reservation time . Hence , whenever a machine is available for processing and there exists parts in its input buffer , the machine remains idle until it is time to fulfill the reservation of a part ...
... input buffers until their allotted reservation time . Hence , whenever a machine is available for processing and there exists parts in its input buffer , the machine remains idle until it is time to fulfill the reservation of a part ...
Page 281
... input places of tk . That is a boolean expression in which can got place constraints , registers of net and input variables of tk . • a postcondition corresponding to object attribution condition after firing of tk . . An Action Aj ...
... input places of tk . That is a boolean expression in which can got place constraints , registers of net and input variables of tk . • a postcondition corresponding to object attribution condition after firing of tk . . An Action Aj ...
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