This paper presents an interval propagation algorithm for variables in planar single-loop linkages. Given intervals of allowed values for all variables, the algorithm provides, for every variable, the whole set of values, with out over-estimation, for which the linkage can actually be assembled. We show further how this algorithm can be integrated in a branch-and-prune search scheme, in order to solve the position analysis of general planar multi-loop linkages. Experimental results are included, comparing the method’s perfor mance with that of previous techniques given for the same task.

Peer Reviewed