Search results

1 – 4 of 4
Article
Publication date: 1 June 1997

Jeff Wiegley, Ken Goldberg, Mike Peshkin and Mike Brokowski

Reviews Peshkin and Sanderson (1988) who showed that parts can be aligned as they move on a conveyor belt against a passive sequence of fences. Describes the first complete…

337

Abstract

Reviews Peshkin and Sanderson (1988) who showed that parts can be aligned as they move on a conveyor belt against a passive sequence of fences. Describes the first complete algorithm to design such sequences for a given convex polygonal part. The algorithm is complete in the sense that it is guaranteed to find a design if one exists and to terminate with a negative report otherwise. Based on an exact breadth‐first search of the design space, the algorithm is also guaranteed to find the design requiring the fewest fences. Describes the algorithm and compares results with those previously reported. Conjectures that a fence design exists to orient any convex polygonal part defined by a sequence of rational vertices.

Details

Assembly Automation, vol. 17 no. 2
Type: Research Article
ISSN: 0144-5154

Keywords

Content available
Article
Publication date: 1 December 1998

59

Abstract

Details

Assembly Automation, vol. 18 no. 4
Type: Research Article
ISSN: 0144-5154

Article
Publication date: 1 July 2006

Onno C. Goemans, Ken Goldberg and A. Frank van der Stappen

Proposes a simple bowl feeder primitive, consisting of one horizontally mounted convex polygonal metal “blade” that can feed a broad class of three‐dimensional polyhedral parts by…

Abstract

Purpose

Proposes a simple bowl feeder primitive, consisting of one horizontally mounted convex polygonal metal “blade” that can feed a broad class of three‐dimensional polyhedral parts by reorienting and rejecting all but those in a desired orientation. Owing to its simplicity, the proposed primitive allows for the development of methods to automate its design process.

Design/methodology/approach

Presents a computational geometric approach to construct the solution space for a given part and then use this space to report all designs that feed the part.

Findings

Given a polyhedral part and its center of mass as input, the complete algorithm identifies all single blade solutions that feed the part. The output is either the set of all valid blade designs or a notification that the part cannot be fed using a single blade.

Research limitations/implications

Aims to take a first step in the design of complete algorithms for three‐dimensional parts in the context of vibratory bowls. Future research encompasses the relaxation of several simplifying assumptions with regard to the physical modeling of the motion and interaction with the part.

Practical implications

Algorithms like the one proposed can be applied to generate an initial vibratory bowl design. The strength of our algorithm lies in its completeness which means that it identifies the complete universe of all possible designs. Such a rigorous exploration can neither be accomplished through human trail‐and‐error nor through heuristic approaches to automated design.

Originality/value

Proposes the first complete algorithm for automated design of a 3D part manipulator for vibratory bowls, which may serve as a building block for fully automated bowl design.

Details

Assembly Automation, vol. 26 no. 3
Type: Research Article
ISSN: 0144-5154

Keywords

Content available
Article
Publication date: 1 July 2006

Mike Tao Zhang

535

Abstract

Details

Assembly Automation, vol. 26 no. 3
Type: Research Article
ISSN: 0144-5154

1 – 4 of 4