Exact interval propagation for the efficient solution of planar linkages

Abstract

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