home › event - solving inverse configuration space problems by adaptive sampling

EVENT:

Solving Inverse Configuration Space Problems By Adaptive Sampling
Conferences & Talks

 

description

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) of relative motions by adaptive sampling. The proposed method relies on a well-known fact that the manifold of the group SE(3) is a Cartesian product of two manifold subgroups: the group of rotations SO(3) and the group of translations R^3. 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.

 

upcoming events   view all 

PARC at Clean Energy Ministerial Startups & Solutions Showcase
Matthew Klenk, Filip Dvorak
1 June 2016 - 2 June 2016 | San Francisco, CA
Conferences & Talks  

Passive Radiative Cooling
Bernard Casse
2 June 2016 | Hollywood Beach, FL
Conferences & Talks  

Man + Machine
Rob McHenry
22 June 2016 | San Jose, CA
Conferences & Talks  

Designing for Longevity: The 10,000 Year Clock Project
Alexander Rose
30 June 2016 | George E. Pake Auditorium, PARC
PARC Forum