ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 77
Page 7
... Path Length vs. Assembly Diffi- culty Figure 6 shows that normalized path length varies in a manner that matches our intuitive expectation - the closer the parts need to be packed together , a greater distance they need to be moved . The ...
... Path Length vs. Assembly Diffi- culty Figure 6 shows that normalized path length varies in a manner that matches our intuitive expectation - the closer the parts need to be packed together , a greater distance they need to be moved . The ...
Page 70
... path exist with resolution e ; The " history of " routine is simply a concatenation of the manipulation paths of the ancestors of Ln + 1 and the transfer path found by SEARCH . 1.3 Implementing EXPLORE SEARCH with Manhattan Paths Manhattan ...
... path exist with resolution e ; The " history of " routine is simply a concatenation of the manipulation paths of the ancestors of Ln + 1 and the transfer path found by SEARCH . 1.3 Implementing EXPLORE SEARCH with Manhattan Paths Manhattan ...
Page 71
... paths in free can be represented by a vector ↑ Є Rn ** but that not all Є Rn ** represent a path in free , since A ; E could code an invalid value such that the path * goes into CB . However , intervals [ Amin , Amar ] can be easily ...
... paths in free can be represented by a vector ↑ Є Rn ** but that not all Є Rn ** represent a path in free , since A ; E could code an invalid value such that the path * goes into CB . However , intervals [ Amin , Amar ] can be easily ...
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