Trap Design for Vibratory Bowl Feeders

The vibratory bowl feeder is the oldest and still most common approach to the automated feeding (orienting) of industrial parts. In this paper, the authors consider a class of vibratory bowl filters that can be described by removing polygonal sections from the track; this class of filters is referred to as traps. For an n-sided polygonal part and an m-sided polygonal trap, an O(n2m log n) algorithm is given to decide whether the part in a specific orientation will safely move across the trap or will fall through the trap and thus be filtered out. For an n-sided convex polygonal part and m-sided convex polygonal trap, this bound is improved to O((n+m) log n). Furthermore, the authors show how to design various trap shapes, ranging from simple traps to general polygons, which will filter out all but one of the different stable orientations of a given part. Although the runtimes of the design algorithms are exponential in the number of trap parameters, many industrial part feeders use few-parameter traps (balconies, canyons, slots); in these cases, the running times of the algorithms range from linear to low-degree polynomial.

[1]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[2]  Arthur C. Sanderson,et al.  Planning robotic manipulation strategies for workpieces that slide , 1988, IEEE J. Robotics Autom..

[3]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[4]  Marie-Françoise Roy,et al.  On the combinatorial and algebraic complexity of Quanti erEliminationS , 1994 .

[5]  John Hershberger,et al.  Finding the Upper Envelope of n Line Segments in O(n log n) Time , 1989, Inf. Process. Lett..

[6]  Tomás Recio,et al.  Algorithms in Real Algebraic Geometry and Applications to Computational Geometry , 1990, Discrete and Computational Geometry.

[7]  Alan D. Christiansen,et al.  Automated design of part feeders using a genetic algorithm , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[8]  Bryan Kok Ann Ngoi,et al.  A computer-aided framework for the selection and sequencing of orientating devices for the vibratory bowl feeder , 1994 .

[9]  Saugata Basu,et al.  New results on quantifier elimination over real closed fields and applications to constraint databases , 1999, JACM.

[10]  Balas K. Natarajan,et al.  Some Paradigms for the Automated Design of Parts Feeders , 1989, Int. J. Robotics Res..

[11]  John F. Canny,et al.  Designing parts feeders using dynamic simulation , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[12]  Arthur C. Sanderson,et al.  The motion of a pushed, sliding workpiece , 1988, IEEE J. Robotics Autom..

[13]  S. Basu,et al.  Algorithms in semi-algebraic geometry , 1996 .

[14]  Kevin M. Lynch,et al.  Parts Feeding on a Conveyor with a One Joint Robot , 2000, Algorithmica.

[15]  Bud Mishra,et al.  Algorithmic Algebra , 1993, Texts and Monographs in Computer Science.

[16]  Gary P. Maul,et al.  A systems model and simulation of the vibratory bowl feeder , 1997 .

[17]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[18]  R.-P.M. Berretty,et al.  Geometric design of part feeders , 2000 .

[19]  Kevin M. Lynch,et al.  Stable Pushing: Mechanics, Controllability, and Planning , 1995, Int. J. Robotics Res..

[20]  Matthew Thomas Mason,et al.  Manipulator grasping and pushing operations , 1982 .

[21]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[22]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[23]  Mark H. Overmars,et al.  Trap design for vibratory bowl feeders , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[24]  Matthew T. Mason,et al.  Posing Polygonal Objects in the Plane by Pushing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[25]  Bernard Chazelle,et al.  Computational geometry: a retrospective , 1994, STOC '94.

[26]  Ken Goldberg,et al.  A complete algorithm for designing passive fences to orient parts , 1997 .

[27]  Bruce Randall Donald,et al.  Algorithms for Sensorless Manipulation Using a Vibrating Surface , 2000, Algorithmica.

[28]  Pankaj K. Agarwal,et al.  Minimal trap design , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[29]  Matthew T. Mason,et al.  An exploration of sensorless manipulation , 1986, IEEE J. Robotics Autom..

[30]  Mark H. Overmars,et al.  Computing fence designs for orienting parts , 1998, Comput. Geom..

[31]  Ken Goldberg,et al.  Optimal Curved Fences for Part Alignment on a Belt , 1995 .

[32]  Frank J. Riley Assembly Automation: A Management Handbook , 1984 .