ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 84
Page 71
... obtained ( as in [ 13 ] ) such that VA ; E ĵ * € free , Ai E [ Amin , Amar ] . The computation of these intervals permits us to rewrite the functions ; € jk so that the resulting paths are always collision - free that is to map A , in ...
... obtained ( as in [ 13 ] ) such that VA ; E ĵ * € free , Ai E [ Amin , Amar ] . The computation of these intervals permits us to rewrite the functions ; € jk so that the resulting paths are always collision - free that is to map A , in ...
Page 224
... obtained or the maximum number of workstations ( obtained in la ) is reached . 4. Among the solutions obtained for the various line ' lengths ' , select the one that minimizes the total cost of the line . Note that for the first two ...
... obtained or the maximum number of workstations ( obtained in la ) is reached . 4. Among the solutions obtained for the various line ' lengths ' , select the one that minimizes the total cost of the line . Note that for the first two ...
Page 344
... obtain for gross - motion planning problems with this form of uncertainty , and have only been previously obtained by considering very specific cases [ 9 ] . Each dynamic programming iteration can be considered_as the construction of an ...
... obtain for gross - motion planning problems with this form of uncertainty , and have only been previously obtained by considering very specific cases [ 9 ] . Each dynamic programming iteration can be considered_as the construction of an ...
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