This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Similar articles in Web of Science Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by Ostrovsky-Berman, Y. Articles by Joskowicz, L. Search for Related Content Social Bookmarking                         What's this?

Relative Position Computation for Assembly Planning With Planar Toleranced Parts

School of Engineering and Computer Science, The Hebrew University of Jerusalem, Israel, yaronber{at}cs.huji.ac.il

Leo Joskowicz

School of Engineering and Computer Science, The Hebrew University of Jerusalem, Israel

In this paper we present a new framework for worst-case toleranced assembly planning of planar mechanical systems. Unlike most assembly planners, which produce plans for nominal parts, our framework incorporates the inherent imprecision of the manufacturing process, which introduces uncertainties in the shape and size of the assembly parts. It accounts for the uncertainty of the relative part placements in the assembled state and allows planning for all assembly instances. Our framework is more general than existing approaches in terms of the part model, the tolerance specification model, and the type of motions used in the assembly sequences. We describe efficient algorithms for computing the sensitivity of part positioning to variations in part geometries, and for incorporating these computations into the geometric core of existing assembly planners for nominal parts. We show that the cost of accounting for toleranced parts in planning is a multiplicative factor which is a polynomial of low degree in the number of tolerance parameters. Our implementation and experiments on five assembly models show that tolerancing significantly reduces the volume of the space of valid motions for assembly sequence planning, and that for translational motions this reduction depends linearly on the size of the tolerance intervals. We conclude that geometric computation for assembly planning with tolerance parts is time efficient and practical.

Key Words: motion planning • assembly planning • geometric constraint solving • tolerance analysis • tolerance envelopes

The International Journal of Robotics Research, Vol. 25, No. 2, 147-170 (2006)
DOI: 10.1177/0278364906060133


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?