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 R3. 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 

Joshua Wolf Shenk: The Power of Two
6 October 2014
Conferences & Talks  

Automated Data Integration
Eric Huang, Author, Saigopal Nelaturi
27 October 2014
Conferences & Talks  

Global Competitiveness: The Role of Innovation and Productivity
Stephen Hoover, CEO, PARC
27 October 2014 | Toronto, Canada
Conferences & Talks  

The Internet of Everything
Stephen Hoover, CEO, PARC
28 October 2014 | Toronto, Canada
Conferences & Talks  

Open Forum: Cities and the Digital Frontier
Mike Steep
30 October 2014
George E. Pake Auditorium, PARC | Palo Alto, CA

Churchill Club