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.
Lesson 5.4.  You may have noticed that many equations can be solved by undoing the order of operations.  This strategy also applies for more complex.
Motion Planning for Point Robots CS 659 Kris Hauser.
A Limit Case of the “Ring Problem” E. Barrabés 1, J.M. Cors 2 and G.R.Hall 3 1 Universitat de Girona 2 Universitat Politècnica de Catalunya 3 Boston University.
Symmetry & boundary conditions Joël Cugnoni, LMAF/EPFL, 2009.
Introduction University of Bridgeport 1 Introduction to ROBOTICS.
Multi-Robot Motion Planning Jur van den Berg. Outline Recap: Configuration Space for Single Robot Multiple Robots: Problem Definition Multiple Robots:
1 Last lecture  Configuration Space Free-Space and C-Space Obstacles Minkowski Sums.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Criticality-Based Motion Planning (2)
Montek Singh COMP Nov 15,  Two different technologies ◦ TODAY: DNA as biochemical computer  DNA molecules encode data  enzymes, probes.
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.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001 Lecture 4 Chapter 6: Arrangements Monday,
CS 326 A: Motion Planning Assembly Planning.
Geometric Reasoning About Mechanical Assembly Randall H. Wilson and Jean-Claude Latombe Andreas Edlund Romain Thibaux.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Criticality-Based Motion Planning.
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.
CS 326A: Motion Planning Criticality-Based Motion Planning: Target Finding.
CS 326 A: Motion Planning Exploring and Inspecting Environments.
CS 326 A: Motion Planning Manipulation Planning.
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Assembly planning.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
The University of North Carolina at CHAPEL HILL A Simple Path Non-Existence Algorithm using C-obstacle Query Liang-Jun Zhang.
CS 326 A: Motion Planning Assembly Planning.
CS 326 A: Motion Planning Coordination of Multiple Robots.
Complexity Issues in Robot Motion Planning Elif Tosun MTH 353 Final Paper.
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.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 O’Rourke Chapter 8 Motion Planning.
Assembly Planning “A Framework for Geometric Reasoning About Tools in Assembly” Randall H. Wilson Presentation by Adit Koolwal & Julie Letchner.
Development Processes and Organizations
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.
Kinematics Fundamentals
Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.
7.1 Solving Linear Systems by Graphing Systems of Linear Equations Solving Systems of Equations by Graphing.
Kinematics Fundamentals
Joël Cugnoni, LMAF/EPFL,  A FE model has a symmetry if and only if geometry, materials and loading all have the same symmetry !!  Symmetries help.
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
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.
Basic Assembly Constraints and Concepts
UNC Chapel Hill M. C. Lin Point Location Reading: Chapter 6 of the Textbook Driving Applications –Knowing Where You Are in GIS Related Applications –Triangulation.
Jonathan Harris Technology 3 rd Period.  The property of the space in which we live and move that indicates motion can take place in three mutually perpendicular.
9/15/2004EE 42 fall 2004 lecture 7 Lecture #7 Graphical analysis, Capacitors Finish graphical analysis Capacitors Circuits with Capacitors Next week, we.
T. Bajd, M. Mihelj, J. Lenarčič, A. Stanovnik, M. Munih, Robotics, Springer, 2010 ROBOT ASSEMBLY T. Bajd and M. Mihelj.
Introduction to Robot Motion Planning Robotics meet Computer Science.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Introduction to Motion Planning
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
CIEG 212 Solid Mechanics Introductory Material by Victor N. Kaliakin.
Two Finger Caging of Concave Polygon Peam Pipattanasomporn Advisor: Attawith Sudsang.
Structure and Function of Living Systems Directions: Draw the following chart NEATLY in your journal using the entire page. Cut out the eight diagrams.
Assembly Planning. Levels of Problems  Parts are assumed free-flying  Assembly sequence planning  Tools/fixtures are taken into account  Entire manipulation.
Hi6Hi5 Hi2 Hi4 Hi3 Product (assembly) xz – horizontal plane.
ASSEMBLY AND DISASSEMBLY: AN OVERVIEW AND FRAMEWORK FOR COOPERATION REQUIREMENT PLANNING WITH CONFLICT RESOLUTION in Journal of Intelligent and Robotic.
Kinematics of machines ( )
Continuum Mechanics (MTH487)
Technology Basic Mechanical Functions Work book and text book NEEDED
Criticality-Based Motion Planning (2)
Geometric Reasoning About Mechanical Assembly
Statics Dr. Aeid A. Abdulrazeg Course Code: CIVL211
Presentation transcript:

CS 326 A: Motion Planning Assembly Planning

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

Levels of Problems  Parts are assumed free-flying (1 st paper)  Assembly sequence planning  Tools/fixtures are taken into account (2 nd paper)  Entire manipulation system is taken into account  Manipulation planning (Laumond’s paper)

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

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

Set of Assembly Sequences as an AND/OR Graph [L. Homem de Mello and Sanderson]

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 remove:

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

Non-Directional Blocking Graphs  NDBG for infinitesimal (local) translations No assembly sequence  no solution  NDBG for extended translations Assembly sequence  solution Incremental construction of NDBG

Criticality-Based Motion Planning C-space, Motion space, … Define property P Find where P changes  geometric arrangement: - critical curves/surfaces, - regular regions (cells) Approach is practical only in low-dimensional spaces: - Complexity of the arrangement - Sensitivity to floating point errors

Assembly Sequences Generated Using NBBGs Sandia National Labs (R. Wilson) Munich University (F. Schwarzer)

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