ProceedingsIEEE Computer Society Press, 1995 - Artificial intelligence |
From inside the book
Results 1-3 of 56
Page 182
... configuration space can be parameterized by ( x , y , 0 , 0 , ) ; z is not a configuration variable because it is unobservable . k refers to the dimensionality of configuration space ( k = dim ( C ) ) . Definition 2 Indering coordinate ...
... configuration space can be parameterized by ( x , y , 0 , 0 , ) ; z is not a configuration variable because it is unobservable . k refers to the dimensionality of configuration space ( k = dim ( C ) ) . Definition 2 Indering coordinate ...
Page 183
... Configuration Space Sampling In this section , we discuss and analyze conventional methods for constructing indexing tables which in- clude regular and random configuration space sam- pling . In these configuration space sampling ap ...
... Configuration Space Sampling In this section , we discuss and analyze conventional methods for constructing indexing tables which in- clude regular and random configuration space sam- pling . In these configuration space sampling ap ...
Page 184
... space boundaries can be projected down onto configuration space . Thereby , we can enumerate the cells in the ar- rangement in configuration space rather than indexing space . 5.1 Discretization Boundary Curves - Discretization boundary ...
... space boundaries can be projected down onto configuration space . Thereby , we can enumerate the cells in the ar- rangement in configuration space rather than indexing space . 5.1 Discretization Boundary Curves - Discretization boundary ...
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