Solving inverse configuration space problems by adaptive sampling

Given two shapes in relative motion, an important class of inverse configuration problems are solved by determining relative configurations that maintain set-inclusion relationships (non-interference, containment, or contact) between the shapes. This class of inverse problems includes the well-known problem of constructing a configuration space obstacle, as well as many other problems in computational design such as sweep decomposition, accessibility analysis, and dynamic packaging. We show that solutions to such problems may be efficiently approximated directly in the 6D configuration space SE(3)SE(3) of relative motions by adaptive sampling. The proposed method relies on a well-known fact that the manifold of the group SE(3)SE(3) is a Cartesian product of two manifold subgroups: the group of rotations SO(3)SO(3) and the group of translations R3R3. This property allows generating desired configurations by combining samples that are generated in these subgroups independently and adaptively. We demonstrate the effectiveness of the proposed approach on several inverse problems including the problem of sweep decomposition that arises in reverse engineering applications.

► Formulation of inverse configuration space problems.
► Efficient adaptive sampling of rotations using properties of the rotation group.
► Application to sweep decomposition problems in design and manufacturing.