The complexity of sensing by point sampling

In assembly tasks it is often necessary to recognize parts arriving via a conveyor belt or a parts feeder at some robot work cell. Generally the parts feeder will have reduced the number of possible poses of the parts to a small nite set. In order to distinguish between the remaining poses of the parts some simple sensing or probing operation may be used. In this paper we consider the problem of nding the minimum number of sensing points required to distinguish between a nite set of polygonal shapes. For instance, we might imagine embedding a series of point light detectors in a feeder tray. Then we would be interested in the question \What is the minimum number of light detectors that can fully distinguish between all the possible shapes?" Or we might imagine a set of mechanical probes that touches the feeder at a nite number of predetermined points. Then we would ask \What are the minimum number of probing points and where should the probes be located in order to distinguish all the possible shapes?" We address these questions in this paper.

[1]  ChazelleBernard,et al.  An optimal algorithm for intersecting line segments in the plane , 1992 .

[2]  Steven Salzberg,et al.  Testing Orthogonal Shapes , 1995, Comput. Geom..

[3]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[4]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[5]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[6]  Steven Skiena,et al.  Decision trees for geometric models , 1993, SCG '93.

[7]  Bruce Randall Donald,et al.  Towards a Theory of Information Invariants for Cooperating Autonomous Mobile Robots , 1993 .

[8]  Esther M. Arkin,et al.  Testing Simple Polygons , 1993, CCCG.

[9]  Randy C. Brost,et al.  Automatic Grasp Planning in the Presence of Uncertainty , 1988, Int. J. Robotics Res..

[10]  Chee-Keng Yap,et al.  AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..

[11]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[12]  Michael A. Erdmann,et al.  Understanding Action and Sensing by Designing Action-Based Sensors , 1995, Int. J. Robotics Res..

[13]  Thomas C. Shermer,et al.  Probing Polygons Minimally Is Hard , 1992, Comput. Geom..

[14]  Balas K. Natarajan On detecting the orientation of polygons and polyhedra , 1987, SCG '87.

[15]  Kathleen Ann Rebecca Romanik Approximate testing theory , 1992 .

[16]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[17]  Carsten Lund,et al.  Proof verification and the intractability of approximation problems , 1992, FOCS 1992.

[18]  Phokion G. Kolaitis,et al.  Approximation properties of NP minimization classes , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[19]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[20]  Matthew T. Mason,et al.  An exploration of sensorless manipulation , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[21]  Franco P. Preparata,et al.  Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.

[22]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[23]  John Canny,et al.  A RISC Paradigm for Industrial Robotics , 1993 .

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[26]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[27]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[28]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .