1 / 31

Motion and Manipulation

Motion and Manipulation. 2008/09 Frank van der Stappen Game and Media Technology. Context. Robotics. Games (VEs). Geometry. Motion Planning. Robotics. Motion Planning. Autonomous Virtual Humans (Creatures). Motions. User in VE: Collision detection Autonomous entity: motion planning.

Download Presentation

Motion and Manipulation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Motion and Manipulation 2008/09 Frank van der Stappen Game and Media Technology

  2. Context Robotics Games (VEs) Geometry

  3. Motion Planning • Robotics

  4. Motion Planning • Autonomous Virtual Humans (Creatures)

  5. Motions • User in VE: Collision detection • Autonomous entity: motion planning

  6. Linkages • Kinematic constraints

  7. Linkages

  8. Linkages • VR Hardware

  9. Holding and Grasping

  10. Anthropomorphic robot arms/hands + advanced sensory systems = expensive not always reliable complex control Conventional Manipulation

  11. RISC • ‘Simplicity in the factory’[Whitney 86]instead of‘ungodly complex robot hands’[Tanzer & Simon 90] • Reduced Intricacy in Sensing and Control[Canny & Goldberg 94] = • simple ‘planable’ physical actions, by • simple, reliable hardware components • simple or even no sensors

  12. Manipulation Tasks • Fixturing, grasping • Feeding push, squeeze, topple, pull, tap, roll, vibrate, wobble, drop, … Parts Feeder

  13. Parallel-Jaw Grippers • Every 2D part can be oriented by a sequence of push or squeeze actions. • Shortest sequence is efficiently computable [Goldberg 93].

  14. Feeding with ‘Fences’ • Every 2D part can be oriented by fences over conveyor belt. • Shortest fence design efficiently computable[Berretty, Goldberg, Overmars, vdS 98].

  15. Feeding by Toppling • Shortest sequence of pins and their heights efficiently computable [Zhang, Goldberg, Smith, Berretty, Overmars 01].

  16. Vibratory Bowl Feeders • Shapes of filtering traps efficiently computable[Berretty, Goldberg, Overmars, vdS 01].

  17. Course Material • Steven M. LaValle, Planning Algorithms, 2006, Chapters 3-6. Hardcopy approximately € 50-60. http://msl.cs.uiuc.edu/planning/index.html. Free! • Robert J. Schilling, Fundamentals of Robotics: Analysis and Control, 1990, Chapters 1 and 2 (partly). Copies available. • Matthew T. Mason, Mechanics of Robotic Manipulation, 2001. Price approximately € 50.

  18. Teacher Frank van der Stappen http://people.cs.uu.nl/frankst/ • Office: Centrumgebouw Noord C226; phone: 030 2535093; email: frankst@cs.uu.nl • Program leader for Game and Media Technology; MSc projects on manufacturing and motion planning

  19. Classes • Monday 9:00-10:45 in BBL-513, starting September 8. • Wednesday 9:00-10:45 in BBL-503, starting September 3.

  20. Exam Form • Written exam about the theory of motion and manipulation; weight 60%. • Summary report (> 10 pages of text) on two assigned papers followed by a 15-minute discussion; weight 40%. • Additional requirments: • Need to score at least 5.0 for written exam to pass course. • Need to score at least 4.0 to be admitted to second chance

  21. Geometric Models • Moving robot, stationary obstacles • Boundary representation vs. solid representation • Polygons/polyhedra • Convex / nonconvex • Semi-algebraic parts • Other models

  22. Representations Obstacles/robot • polygons/polyhedra (convex/non-convex) • semi-algebraic sets Represented • as solids • by their boundaries convex q p X

  23. Polygonal Models • Boundary representation List vertices in counterclockwise order: (x1,y1),(x2,y2),(x3,y3),(x4,y4), … (x4,y4) (x3,y3) (x2,y2) (x1,y1)

  24. Polygonal Models • Solid representation for convex polygons: intersection of half-planes

  25. Polygonal Models • Solid representation for convex polygons: intersection of half-planes Bounded by a line y=ax+b or ax+by+c=0 Zero level set of f(x,y)=ax+by+c

  26. f1(x,y)=2x+y+1 f2(x,y)=-2x-y-1 Half-planes H1={ (x,y) | f1(x,y)≤0 } H2={ (x,y) | f2(x,y)≤0 }

  27. Polygonal Models • Convex m-gon: intersection of m half-planes Hi, X = H1 ∩ H2 ∩ ... ∩ Hm. • Polygon with n vertices: union of k convex polygons, X = X1 U X2 U … U Xk. • Complex polygonal sets: unions of intersections too.

  28. Polyhedral Models • Boundary representation: vertices, edges, polygonal faces, e.g. doubly-connected edge list (DCEL). • Solid: union of intersection of half-spacesH = { (x,y,z) | f(x,y,z) ≤ 0 } withf(x,y,z) = ax+by+cz+d.

  29. Semi-Algebraic Sets • Union of intersection of sets H = { (x,y) | f(x,y) ≤ 0 }, where f(x,y) is now a polynomial in x and y with real coefficients (in 2D). f(x,y)=-x2+y f(x,y)=x2+y2-4 non-convex H H bounded

  30. Semi-Algebraic Sets

  31. Holes

More Related