1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, U.C. Berkeley.

Slides:



Advertisements
Similar presentations
Contact Mechanics B659: Principles of Intelligent Robot Motion Spring 2013 Kris Hauser.
Advertisements

1 Motion and Manipulation Configuration Space. Outline Motion Planning Configuration Space and Free Space Free Space Structure and Complexity.
Robot Grasp Planning using Parallel Sampling to Estimate Uncertainty in Pose, Shape, and Mechanics Melissa Goldstein Edward Lee Frank Ong Josh Goldberg.
AERSP 301 Finite Element Method
Configuration Space. Recap Represent environments as graphs –Paths are connected vertices –Make assumption that robot is a point Need to be able to use.
CAGING OF RIGID POLYTOPES VIA DISPERSION CONTROL OF POINT FINGERS Peam Pipattanasomporn Advisor: Attawith Sudsang 1.
Kinematics & Grasping Need to know: Representing mechanism geometry Standard configurations Degrees of freedom Grippers and graspability conditions Goal.
Department of Computer Science, Iowa State University Robot Grasping of Deformable Objects Yan-Bin Jia (joint work with Ph.D. students Feng Guo and Huan.
LECTURE SERIES on STRUCTURAL OPTIMIZATION Thanh X. Nguyen Structural Mechanics Division National University of Civil Engineering
Some Ideas Behind Finite Element Analysis
Chapter 17 Design Analysis using Inventor Stress Analysis Module
CS447/ Realistic Rendering -- Solids Modeling -- Introduction to 2D and 3D Computer Graphics.
1 Last lecture  Configuration Space Free-Space and C-Space Obstacles Minkowski Sums.
ECIV 720 A Advanced Structural Mechanics and Analysis
Putting the Turing into Manufacturing: Algorithmic Automation and Recent Developments in Feeding and Fixturing Ken Goldberg, UC Berkeley.
Motion Planning. Basic Topology Definitions  Open set / closed set  Boundary point / interior point / closure  Continuous function  Parametric curve.
Configuration Space CS 326 A: Motion Planning
1 Dissertation Workshop: Algorithms, Models and Metrics for the Design of Workholding Using Part Concavities K. Gopalakrishnan IEOR, U.C. Berkeley.
Gripping Parts at Concave Vertices K. “Gopal” Gopalakrishnan Ken Goldberg U.C. Berkeley.
1 Last lecture  Path planning for a moving Visibility graph Cell decomposition Potential field  Geometric preliminaries Implementing geometric primitives.
1 Computing Deform Closure Grasps K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, UC Berkeley.
Algorithms, Models and Metrics for Workholding using Part Concavities. K. Gopalakrishnan IEOR, U.C. Berkeley.
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
CS 326A: Motion Planning Configuration Space. Motion Planning Framework Continuous representation (configuration space and related spaces + constraints)
Correspondence & Symmetry
1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, U.C. Berkeley.
Ch. 2: Rigid Body Motions and Homogeneous Transforms
A Study on Object Grasp with Multifingered Robot Hand Ying LI, Ph.D. Department of Mechanical Engineering Kagoshima University, Japan.
Gripping Sheet Metal Parts at Vertices K. Gopalakrishnan A Project for CS 287.
BINARY MORPHOLOGY and APPLICATIONS IN ROBOTICS. Applications of Minkowski Sum 1.Minkowski addition plays a central role in mathematical morphology 2.It.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
Mechanics of Rigid Bodies
1 Computing Deform Closure Grasps K. “Gopal” Gopalakrishnan Ken Goldberg UC Berkeley.
ECIV 720 A Advanced Structural Mechanics and Analysis Lecture 12: Isoparametric CST Area Coordinates Shape Functions Strain-Displacement Matrix Rayleigh-Ritz.
1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, UC Berkeley.
1 On the Existence of Form- Closure Configurations on a Grid A.Frank van der Stappen Presented by K. Gopalakrishnan.
1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, U.C. Berkeley.
Introduction to Robot Motion Planning. Example A robot arm is to build an assembly from a set of parts. Tasks for the robot: Grasping: position gripper.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
MANE 4240 & CIVL 4240 Introduction to Finite Elements
Finite Element Modeling and Analysis with a Biomechanical Application Alexandra Schönning, Ph.D. Mechanical Engineering University of North Florida ASME.
General Procedure for Finite Element Method FEM is based on Direct Stiffness approach or Displacement approach. A broad procedural outline is listed.
Motion and Stress Analysis by Vector Mechanics Edward C. Ting Professor Emeritus of Applied Mechanics Purdue University, West Lafayette, IN National Central.
Intro to 3D Models Angel Angel: Interactive Computer Graphics5E © Addison-Wesley
An introduction to the finite element method using MATLAB
Department of Computer Science, Iowa State University Robot Grasping of Deformable Planar Objects Yan-Bin Jia (with Ph.D. students Feng Guo and Huan Lin.
Introduction to Robot Motion Planning Robotics meet Computer Science.
1 20-Oct-15 Last course Lecture plan and policies What is FEM? Brief history of the FEM Example of applications Discretization Example of FEM softwares.
Algorithms, Models and Metrics for the Design of Workholding Using Part Concavities K. Gopalakrishnan, Ken Goldberg, IEOR, U.C. Berkeley.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
Medical Image Analysis Image Registration Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Planning for Deformable Parts. Holding Deformable Parts How can we plan holding of deformable objects?
Geometric Objects and Transformation
Computation of Force Closure Grasps from Finite Contact Point Set Nattee Niparnan Advisor: Dr. Attawith Sudsang.
11/11/20151 Trusses. 11/11/20152 Element Formulation by Virtual Work u Use virtual work to derive element stiffness matrix based on assumed displacements.
Robot Grasp Planning using Parallel Sampling to Estimate Uncertainty in Pose, Shape, and Mechanics Melissa Goldstein Edward Lee Frank Ong Josh Goldberg.
Illustration of FE algorithm on the example of 1D problem Problem: Stress and displacement analysis of a one-dimensional bar, loaded only by its own weight,
1 Dissertation Workshop. Algorithms, Models and Metrics for the Design of Workholding using Part Concavities. K. Gopalakrishnan IEOR, U.C. Berkeley. Thesis.
1 Dissertation Workshop. Algorithms, Models and Metrics for the Design of Workholding using Part Concavities. K. Gopalakrishnan IEOR, U.C. Berkeley. Thesis.
The Spinning Top Chloe Elliott. Rigid Bodies Six degrees of freedom:  3 cartesian coordinates specifying position of centre of mass  3 angles specifying.
Two Finger Caging of Concave Polygon Peam Pipattanasomporn Advisor: Attawith Sudsang.
1 Representation. 2 Objectives Introduce concepts such as dimension and basis Introduce coordinate systems for representing vectors spaces and frames.
Uncertainty in Grasping and Feeding Frank van der Stappen Utrecht University Shanghai, China, May 9, 2011.
Basic Geometric Nonlinearities Chapter Five - APPENDIX.
University of Pennsylvania Vijay Kumar 1 Stability of Enveloping Grasps Vijay Kumar GRASP Laboratory University of Pennsylvania Philadelphia, PA
NUS CS 5247 David Hsu Configuration Space. 2 What is a path?
MASKS © 2004 Invitation to 3D vision Lecture 6 Introduction to Algebra & Rigid-Body Motion Allen Y. Yang September 18 th, 2006.
Real-Time Configuration Space Transforms for Obstacle Avoidance Wyatt S. Newman and Michael S. Branicky.
FEA convergence requirements.
Implementation of 2D stress-strain Finite Element Modeling on MATLAB
Presentation transcript:

1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, U.C. Berkeley.

2 Workholding: Rigid parts Number of contacts –[Reuleaux, 1876], [Somoff, 1900] –[Mishra, Schwarz, Sharir, 1987], [Markenscoff, 1990] Nguyen regions –[Nguyen, 1988] Form and Force Closure –[Rimon, Burdick, 1995] Immobilizing three finger grasps –[Ponce, Burdick, Rimon, 1995] [Mason, 2001]

3 Workholding: Rigid parts Caging Grasps –[Rimon, Blake, 1999] Summaries of results –[Bicchi, Kumar, 2000] –[Mason, 2001] C-Spaces for closed chains –[Milgram, Trinkle, 2002] Fixturing hinged parts –[Cheong, Goldberg, Overmars, van der Stappen, 2002] Contact force prediction –[Wang, Pelinescu, 2003]

4 C-Space C-Space (Configuration Space): [Lozano-Perez, 1983] Dual representation of part position and orientation. Each degree of part freedom is one C-space dimension. y x  /3 (5,4) y x  4 5  /3 (5,4,-  /3) Physical space C-Space

5 Avoiding Collisions: C-obstacles Obstacles prevent parts from moving freely. Images in C-space are called C-obstacles. Rest is C free. Physical space C-Space x y

6 Workholding and C-space Multiple contacts. 1 Contact = 1 C-obstacle. C free = Collision with no obstacle. Surface of C-obstacle: Contact, not collision. Physical space C-Space x  y

7 Form Closure A part is grasped in Form Closure if any infinitesimal motion results in collision. Form Closure = an isolated point in C-free. Force Closure = ability to resist any wrench. Physical space C-Space x  y

8 Grasp planning: Combining Geometric and Physical models - [Joukhadar, Bard, Laugier, 1994] Bounded force-closure -[Wakamatsu, Hirai, Iwata, 1996] Minimum Lifting Force - [Howard, Bekey, 1999] Holding Deformable Parts

9 Manipulation of flexible sheets -[Kavraki et al, 1998] Quasi-static path planning. - [Anshelevich et al, 2000] Robust manipulation - [Wada, Hirai, Mori, Kawamura, 2001]

10 Deformable parts “Form closure” does not apply: Can always avoid collisions by deforming the part.

11 Deformation Space: A Generalization of Configuration Space. Based on Finite Element Mesh. D-Space

12 Deformable Polygonal parts: Mesh Planar Part represented as Planar Mesh. Mesh = nodes + edges + Triangular elements. N nodes Polygonal boundary.

13 D-Space A Deformation: Position of each mesh node. D-space: Space of all mesh deformations. Each node has 2 DOF. D-Space: 2N-dimensional Euclidean Space. 30-dimensional D-space

14 Nominal mesh configuration Deformed mesh configuration Deformations Deformations (mesh configurations) specified as list of translational DOFs of each mesh node. Mesh rotation also represented by node displacements. Nominal mesh configuration (undeformed mesh): q 0. General mesh configuration: q. q0q0 q

15 D-Space: Example Simple example: 3-noded mesh, 2 fixed. D-Space: 2-dimensional Euclidean Space. D-Space shows moving node’s position. x y Physical space D-Space q0q0

16 Topological Constraints: D T x y Physical space D-Space Mesh topology maintained. Non-degenerate triangles only. DTDT

17 Topology violating deformation Undeformed part Allowed deformation Self Collisions and D T

18 D-Obstacles x y Physical space D-Space Collision of any mesh triangle with an object. Physical obstacle A i has an image DA i in D-Space. A1A1 DA 1

19 D-Space: Example Physical space x y D-Space D free = D T  [  (DA i C )]

20 Free Space: D free Slice with only node 5 moving. Part and mesh x y Slice with only node 3 moving. x 3 y 3 x 5 y 5 x 5 y 5 x 5 y 5 Physical space D-Space

21 Nodal displacement X = q - q 0 : vector of nodal translations. Equivalent to moving origin in D-Space to q 0. D- space q0q0 q

22 Potential Energy Linear Elasticity. K = FEM stiffness matrix. (2N  2N matrix for N nodes.) Forces at nodes: F = K X. Potential Energy: U(q) = (1/2) X T K X

23 Potential Energy “Surface” U : D free  R  0 Equilibrium: q where U is at a local minimum. Stable Equilibrium: q where U is at a strict local minimum. Stable Equilibrium = “Deform Closure Grasp” q U(q)

24 Potential Energy Needed to Escape from a Stable Equilibrium Consider: Stable equilibrium q A, Equilibrium q B. Capture Region: K(q A )  D free, such that any configuration in K(q A ) returns to q A. q A qBqB q U(q) K( q A )

25 U A (q A ) = Increase in Potential Energy needed to escape from q A. = minimum external work needed to escape from q A. U A : Measure of “Deform Closure Grasp Quality” q A qBqB q U(q) UAUA Potential Energy Needed to Escape from a Stable Equilibrium K( q A )

26 Deform Closure Stable equilibrium = Deform Closure where U A > 0. qAqA qBqB q U(q)

27 Theorem: Definition of Deform closure grasp and UA is frame-invariant. Proof: Consider D-spaces D 1 and D 2. - Consider q 1  D1, q 2  D 2. such that physical meshes are identical. Theorem 1: Frame Invariance x y x y D1:D1: D2:D2:

28 There exists distance preserving linear transformation T such that q 2 = T q 1. It can be shown that U A2 (q 2 ) = U A1 (q 1 ) Theorem 1: Frame Invariance x y x y

29 Form-closure of rigid part Theorem 2: Form Closure and Deform Closure  Deform-closure of equivalent deformable part. 

30 Numerical Example 4 Joules547 Joules

31 High Dimensional. Computing D T and DA i. Exploit symmetry. Computing D free DA i D free DTCDTC

32 Consider obstacle A and one triangular element. Consider the slice D e of D, corresponding to the 6 DOF of this element. Along all other axes of D, D e is constant. Extruded cross-section is a prism. The shape of DA e is same for all elements. Computing DA i

33 Thus, DA is the union of identical prisms with orthogonal axes. Center of D A is the deformation where the part has been shrunk to a point inside A. Similar approach for D T. Computing DA i

34 Two-point Deform Closure: Given contact nodes: Determine optimal jaw separation  *. Future work 

35 If Quality metric Q = U A. Maximum U A trivially at   = 0 Naïve Quality Metric

36 New Quality Metric Plastic deformation. Occurs when strain exceeds e L.

37 New Quality Metric Additional work U L done by jaws for plastic deformation. New Q = min { U A, U L } Stress Strain Plastic Deformation A B C eLeL A B C

38 Potential Energy Surface Potential Energy Jaw 1 position Jaw 2 position

39 Algorithm for U A (  i )

40 Algorithm for U A (  i )

41 U Vertex v (traversed on path of minimum work) U(v) U(v*) Algorithm for U A (  i )

42 Numerical Example Undeformed  = 10 mm. Optimal   = 5.6 mm. Foam Rubber e L = 0.8. FEM performed using ANSYS. Computing Deform Closure Grasps, K. "Gopal" Gopalakrishnan and Ken Goldberg, submitted to Workshop on Algorithmic Foundations of Robotics (WAFR), Oct

43 x y z 3D Meshes Tetrahedral elements: - 3 DOF per node. Box elements: - Translational + Rotational DOF. Sheet metal: - Shell elements.

44 Framework for describing all deformations. Defined Deform Closure. Proved Frame Invariance and equivalence to Form-Closure. Exploiting symmetry in computing D free. Optimal two-point deform closure grasps. Summary