Publication View

Geometric Sensing of Known Planar Shapes

Abstract
Industrial assembly involves sensing the pose (orientation and position) of a part. Efficient and reliable sensing strategies can be developed for an assembly task if the shape of the part is known in advance. In this article we investigate two problems of determining the pose of a polygonal part of known shape for the cases of a continuum and a finite number of possible poses respectively. The first problem, named sensing by inscription, involves determining the pose of a convex n-gon from a set of m supporting cones. An algorithm with running time O(nm) that almost always reduces to O(n+m log n) is presented to solve for all possible poses of the polygon. We prove that the number of possible poses cannot exceed 6n, given m 2 supporting cones with distinct vertices. Simulation experiments demonstrate that two supporting cones are sufficient to determine the real pose of the n-gon in most cases. Our results imply that sensing in practice can be carried out by obtaining viewing angle...

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.44.1928
Source http://www.ri.cmu.edu/pub_files/pub1/jia_yan_bin_1996_1/jia_yan_bin_1996_1.ps.gz
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type text
Language English
Relation 10.1.1.44.5650, 10.1.1.49.9648, 10.1.1.114.3864, 10.1.1.88.8144, 10.1.1.56.8597, 10.1.1.18.8552, 10.1.1.31.1743, 10.1.1.3.2493, 10.1.1.19.3333, 10.1.1.39.7134, 10.1.1.30.1642, 10.1.1.36.5562, 10.1.1.36.3225, 10.1.1.46.1480, 10.1.1.17.3589, 10.1.1.14.2893, 10.1.1.36.9020, 10.1.1.65.7103, 10.1.1.70.2166, 10.1.1.70.4946, 10.1.1.71.6051, 10.1.1.80.7853, 10.1.1.87.7934, 10.1.1.14.5589, 10.1.1.10.7968, 10.1.1.61.1341