ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 40
Page 142
... transition is enabled for a current marking M iff m ( p ) > ( p ) . An enabled transition may be chosen to fire . The firing of the ith transition consists of removing I ( p ) tokens from each of its input places and adding O ( p ...
... transition is enabled for a current marking M iff m ( p ) > ( p ) . An enabled transition may be chosen to fire . The firing of the ith transition consists of removing I ( p ) tokens from each of its input places and adding O ( p ...
Page 144
... transition T1 Ume = 0 prev_bloc next bloc M2 - fire transition T11 time = 0 M3 - fire transition T7 time = 0 mrk start cur_mrk M1-2 - fire transition T2 time = 1 end mrk prev bloc M30 - fire transition T11 time = 1 [ next bloc M1-3 ...
... transition T1 Ume = 0 prev_bloc next bloc M2 - fire transition T11 time = 0 M3 - fire transition T7 time = 0 mrk start cur_mrk M1-2 - fire transition T2 time = 1 end mrk prev bloc M30 - fire transition T11 time = 1 [ next bloc M1-3 ...
Page 156
... transition only has one constraint equation , and the change of sign indicates the direction of the transition . Finally , between two ( topologically- ) neighbor free states , the transition is given by the constraint equation common ...
... transition only has one constraint equation , and the change of sign indicates the direction of the transition . Finally , between two ( topologically- ) neighbor free states , the transition is given by the constraint equation common ...
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