CS 326 A: Motion Planning Assembly Planning.

Slides:



Advertisements
Similar presentations
Understanding the complex dynamics of a cam-follower impacting system
Advertisements

The Expressivity of Quantifying over Regions Ernest Davis March 20, 2007.
A. S. Morse Yale University University of Minnesota June 4, 2014 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
Introduction to Robotics Lecture One Robotics Club -Arjun Bhasin.
Fall Path Planning from text. Fall Outline Point Robot Translational Robot Rotational Robot.
Two Major Types of Mechanical Assembly
THREE-DIMENSIONAL KINEMATICS OF RIGID BODIES
Sampling From the Medial Axis Presented by Rahul Biswas April 23, 2003 CS326A: Motion Planning.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Criticality-Based Motion Planning (2)
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Introduction abridged version.
Geometric reasoning about mechanical assembly By Randall H. Wilson and Jean-Claude Latombe Henrik Tidefelt.
Deadlock-Free and Collision- Free Coordination of Two Robot Manipulators Patrick A. O’Donnell and Tomás Lozano- Pérez by Guha Jayachandran Guha Jayachandran.
Assembly Planning. Levels of Problems  Parts are assumed free-flying  Assembly sequence planning  Tools/fixtures are taken into account  Entire manipulation.
Geometric Reasoning About Mechanical Assembly By Randall H. Wilson and Jean-Claude Latombe Presented by Salik Syed and Denise Jones.
CS 326 A: Motion Planning Coordination of Multiple Robots.
CS 326 A: Motion Planning Criticality-Based Planning.
Motion Planning. Basic Topology Definitions  Open set / closed set  Boundary point / interior point / closure  Continuous function  Parametric curve.
Geometric Reasoning About Mechanical Assembly Randall H. Wilson and Jean-Claude Latombe Andreas Edlund Romain Thibaux.
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Algorithmic motion planning, an overview.
1 Motion Planning for Multiple Robots B. Aronov, M. de Berg, A. Frank van der Stappen, P. Svestka, J. Vleugels Presented by Tim Bretl.
Knot Tying with Single Piece Fixtures Matthew Bell & Devin Balkcom Dartmouth College.
CS 326 A: Motion Planning Assembly Planning.
Navigation and Motion Planning for Robots Speaker: Praveen Guddeti CSE 976, April 24, 2002.
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Assembly planning.
Mechanics of Rigid Bodies
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Constraint-Based Motion Planning using Voronoi Diagrams Maxim Garber and Ming C. Lin Department of Computer.
Complexity Issues Mark Allen Weiss: Data Structures and Algorithm Analysis in Java Lydia Sinapova, Simpson College.
CS 326 A: Motion Planning Assembly Planning.
CS 326 A: Motion Planning Coordination of Multiple Robots.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
Assembly Planning “A Framework for Geometric Reasoning About Tools in Assembly” Randall H. Wilson Presentation by Adit Koolwal & Julie Letchner.
Pebble games for rigidity Overview. The game of pebbling was first suggested by Lagarias and Saks, as a tool for solving a particular problem in number.
SDC PUBLICATIONS © 2012 Chapter 16 Assembly Modeling Learning Objectives:  Understand the Assembly Modeling Methodology  Create Parts in the Assembly.
Homework
Kinematics Fundamentals
Objectives: The student will be able to: Distinguish between the different types of friction. Use free body diagrams and Newton's laws of motion to solve.
Pebble Game Algorithm Demonstration
Kinematic (stick or skeleton) Diagrams
Kinematics Fundamentals
Bearing and Degrees Of Freedom (DOF). If a farmer goes to milk her cows in the morning carrying a stool under one hand and a pail under another the other.
© Manfred Huber Autonomous Robots Robot Path Planning.
Union College Mechanical Engineering ESC020: Rigid Body Mechanics1 Kinetics of Particles  Free Body Diagrams  Newton’s Laws  Euler’s Laws.
Aquinas Hobor and Cristian Gherghina (National University of Singapore) TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
PRE-TRIANGULATIONS Generalized Delaunay Triangulations and Flips Franz Aurenhammer Institute for Theoretical Computer Science Graz University of Technology,
T. Bajd, M. Mihelj, J. Lenarčič, A. Stanovnik, M. Munih, Robotics, Springer, 2010 ROBOT ASSEMBLY T. Bajd and M. Mihelj.
University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction to computer vision Chapter 2: Image.
Introduction to Robot Motion Planning Robotics meet Computer Science.
COSMOSMotion Slides.
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Time Parallel Simulations I Problem-Specific Approach to Create Massively Parallel Simulations.
Some NP-complete Problems in Graph Theory Prof. Sin-Min Lee.
Spring Rigid Body Simulation. Spring Contents Unconstrained Collision Contact Resting Contact.
DESIGN FOR XXX Design Strategies. Design for X Design Strategies 1/4/ Part shape strategies:  adhere to specific process design guidelines  if.
CIEG 212 Solid Mechanics Introductory Material by Victor N. Kaliakin.
High Performance Embedded Computing © 2007 Elsevier Lecture 4: Models of Computation Embedded Computing Systems Mikko Lipasti, adapted from M. Schulte.
CS 261 – Nov. 17 Graph properties – Bipartiteness – Isomorphic to another graph – Pseudograph, multigraph, subgraph Path Cycle – Hamiltonian – Euler.
Exponential and log graphs Logarithms Identify all the graphs in the diagrams below. (2,16) (0,1) 0 y x  (3,125) 0 y x (0,1)  0 y 1 (4,16) x  0 y.
Assembly Planning. Levels of Problems  Parts are assumed free-flying  Assembly sequence planning  Tools/fixtures are taken into account  Entire manipulation.
About length contraction Moving bodies are short.
Kinematics of machines ( )
K.J. INSTITUTE OF ENGINEERING & TECHNOLOGY
EQ: How do we know if polygons are similar?
Degree of Freedom (DOF) :
ME 202 Mechanical Engineering for Civil Engineers
States… Associative Property Examples Non-Examples.
Criticality-Based Motion Planning (2)
Geometric Reasoning About Mechanical Assembly
Graphplan/ SATPlan Chapter
Graphplan/ SATPlan Chapter
Knot Tying Matthew Bell & Devin Balkcom Dartmouth College.
Presentation transcript:

CS 326 A: Motion Planning Assembly Planning

Problem Discriminator (42 parts): mechanical safety device designed to prevent accidental operation of a system.

Another Example

Levels of Problems  Parts are assumed free-flying  Assembly sequence planning  Tools/fixtures are taken into account  Entire manipulation system is taken into account  Manipulation planning

Levels of Problems  Parts are assumed free-flying  Assembly sequence planning  Tools/fixtures are taken into account  Entire manipulation system is taken into account  Manipulation planning

Assembly Sequence Planning Example of a multi-robot coordination problem, but … 1. Very constrained goal state, but unconstrained initial state  Disassembly planning 2. Many dofs, but simple paths  Motion space

Various “Interesting” Cases Multi-hand: An assembly on n parts may require up to n hands for its (dis-)assembly [Natarajan] Non-monotonic 2-handed assembly: No single part can be added or removed:

Examples  With translations only  monotone  two-handed  With translations only  non-monotone, 2-handed  monotone, 3-handed  With general motions  monotone, 2-handed

Complexity of Partitioning  Assembly partitioning problem: - Given a set of non-overlapping polygons, - Decide if a proper subset of them can be removed as a rigid body without colliding with the other polygons.  This problem is NP-complete

OR Gate for u i  u j  u k

Planning Approaches  Generate-and-test: Hypothesize a subassembly and test if it can separated from the rest using contact analysis …  But … exponential number of subassemblies: O(2 n ) subassemblies, but only two pairs can be separated

Planning Approaches  Generate-and-test  Generate-and-test plus caching  Non-directional blocking graph (limited to single-step motions)  Interference diagram

Directional Blocking Graphs  Directional blocking graphs for infinitesimal (local) translations Property P: Blocking graph

 Assembly sequencing in polynomial time Non-Directional Blocking Graph The NDBG is a partition of a motion space into cells

Extension to 3-D

Other Extensions  Generalized infinitesimal motions in 2-D and 3-D  Extended translations  Multiple translations (interference diagram)

Applications  Answer questions such as: oHow many parts need to be removed to extract a given part P? oCan the product be assembled by adding a single part at a time? oHow much can the assembly processed by parallelized?  Design for manufacturing and servicing  Design of manufacturing systems