Geometric Reasoning About Mechanical Assembly Randall H. Wilson and Jean-Claude Latombe Andreas Edlund Romain Thibaux.

Slides:



Advertisements
Similar presentations
CS 336 March 19, 2012 Tandy Warnow.
Advertisements

Chapter 8 Topics in Graph Theory
Graph Theory Arnold Mesa. Basic Concepts n A graph G = (V,E) is defined by a set of vertices and edges v3 v1 v2Vertex (v1) Edge (e1) A Graph with 3 vertices.
PROBLEM SOLVING AND SEARCH
Review Binary Search Trees Operations on Binary Search Tree
Convex drawing chapter 5 Ingeborg Groeneweg. Summery What is convex drawing What is convex drawing Some definitions Some definitions Testing convexity.
MINIMUM COST FLOWS: NETWORK SIMPLEX ALGORITHM A talk by: Lior Teller 1.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 CHAPTER 4 - PART 2 GRAPHS 1.
LECTURE 3 Geometric Modelling
Randomized Motion Planning for Car-like Robots with C-PRM Guang Song and Nancy M. Amato Department of Computer Science Texas A&M University College Station,
C++ Programming: Program Design Including Data Structures, Third Edition Chapter 21: Graphs.
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)
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) January, 12, 2009.
Automated Layout and Phase Assignment for Dark Field PSM Andrew B. Kahng, Huijuan Wang, Alex Zelikovsky UCLA Computer Science Department
Geometric reasoning about mechanical assembly By Randall H. Wilson and Jean-Claude Latombe Henrik Tidefelt.
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 Assembly Planning.
Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.
Connected Components, Directed Graphs, Topological Sort COMP171.
CS 326 A: Motion Planning Assembly Planning.
Greedy Algorithms Reading Material: Chapter 8 (Except Section 8.5)
Graphs. Graphs Many interesting situations can be modeled by a graph. Many interesting situations can be modeled by a graph. Ex. Mass transportation system,
Randomized Motion Planning for Car-like Robots with C-PRM Guang Song, Nancy M. Amato Department of Computer Science Texas A&M University College Station,
Algorithmic Robotics and Motion Planning Dan Halperin Tel Aviv University Fall 2006/7 Assembly planning.
CS 326 A: Motion Planning Assembly Planning.
CISC220 Fall 2009 James Atlas Nov 13: Graphs, Line Intersections.
Randomized Planning for Short Inspection Paths Tim Danner and Lydia E. Kavraki 2000 Presented by Dongkyu, Choi On the day of 28 th May 2003 CS326a: Motion.
1 Structures and Strategies for State Space Search 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.
Roadmap Methods How do I get there? Visibility Graph Voronoid Diagram.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners by Burchan Bayazit Department of Computer Science.
Assembly Planning “A Framework for Geometric Reasoning About Tools in Assembly” Randall H. Wilson Presentation by Adit Koolwal & Julie Letchner.
Important Problem Types and Fundamental Data Structures
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.
A brief and sketchy intro to 3D Convex Hulls Rodrigo Silveira GEOC 2010/11 - Q2.
May Motion Planning Shmuel Wimer Bar Ilan Univ., Eng. Faculty Technion, EE Faculty.
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
T. Bajd, M. Mihelj, J. Lenarčič, A. Stanovnik, M. Munih, Robotics, Springer, 2010 ROBOT ASSEMBLY T. Bajd and M. Mihelj.
Algorithm Course Dr. Aref Rashad February Algorithms Course..... Dr. Aref Rashad Part: 5 Graph Algorithms.
Introduction to Graphs. Introduction Graphs are a generalization of trees –Nodes or verticies –Edges or arcs Two kinds of graphs –Directed –Undirected.
Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Graphs.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Graphs. 2 Graph definitions There are two kinds of graphs: directed graphs (sometimes called digraphs) and undirected graphs Birmingham Rugby London Cambridge.
Haptic Rendering Part 2 4/CY/B3 Part 1. Collision detection and response Nic Melder Part 2. Manipulation and polygon transitions Nic Melder.
Unit – V Graph theory. Representation of Graphs Graph G (V, E,  ) V Set of vertices ESet of edges  Function that assigns vertices {v, w} to each edge.
CSCI 115 Chapter 8 Topics in Graph Theory. CSCI 115 §8.1 Graphs.
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver Chapter 13: Graphs Data Abstraction & Problem Solving with C++
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
1 Directed Graphs Chapter 8. 2 Objectives You will be able to: Say what a directed graph is. Describe two ways to represent a directed graph: Adjacency.
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
CSE 421 Algorithms Richard Anderson Winter 2009 Lecture 5.
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
Assembly Planning. Levels of Problems  Parts are assumed free-flying  Assembly sequence planning  Tools/fixtures are taken into account  Entire manipulation.
Incremental convex hulls BEN LEVY| DISCRETE ALGORITHMIC GEOMETRY
Partial Reconfigurable Designs
The minimum cost flow problem
Last lecture Configuration Space Free-Space and C-Space Obstacles
What is a Graph? a b c d e V= {a,b,c,d,e} E= {(a,b),(a,c),(a,d),
An Algorithm for Bayesian Network Construction from Data
Criticality-Based Motion Planning (2)
Geometric Reasoning About Mechanical Assembly
Richard Anderson Winter 2009 Lecture 6
EMIS 8374 Search Algorithms Updated 9 February 2004
Richard Anderson Lecture 5 Graph Theory
EMIS 8374 Search Algorithms Updated 12 February 2008
GRAPHS.
INTRODUCTION A graph G=(V,E) consists of a finite non empty set of vertices V , and a finite set of edges E which connect pairs of vertices .
Presentation transcript:

Geometric Reasoning About Mechanical Assembly Randall H. Wilson and Jean-Claude Latombe Andreas Edlund Romain Thibaux

Assembly planning ● Assembly planning: – Initially: ● A bunch of loose pieces. – Goal: ● An assembled product. ● Uses: – Find assembly sequence. – Help contruct the building robots. – Analyze complexity of the product.

Virtual Manipulation Systems ● Hierachical approach. – First find just the sequence to assemble the product in the first iteration. – Introduce actual assembly robot in later iterations. ● In this paper: – Free flying parts.

Assembly instruction ● m is a subset of parts of the assembly. ● An assembly instruction: – Changes m's position and orientation. – Maintains the relative positions of the parts in m. ● m is a subassembly.

Assembly algorithm ● The algorithm is represented as a partial ordering where the nodes are assembly instructions. ● The algorithm is correct if all instructions represent collision- free motions.

Blocking structure ● The goal assembly is considerably more constrained than initial state. ● Start from goal and search backwards.

Blocking graph ● Previous approach: – Generate-and-test. ● Generate-and-test is inefficient because the contact analysis is done many times for no reason. ● Better to do a complete contact analysis first and store it. – A blocking graph is a compact representation of the results of this analysis.

Directional blocking graph ● Represents how the parts block each other in the assembly in every direction. ● A graph for each direction.

Directional blocking graph ● Various kinds of blocking graphs: – Infinitesimal translation. – Infinite translation. – Generalized motions (with rotations as well).

Terminology ● Locally free – Can translate infinitesimally in direction d without collision. ● Strongly connected component – Maximal subassembly such that for every pair of parts, a path exists between them.

Non-directional blocking graph ● Separate the set of directions into regular regions. ● One directional blocking graph per region.

Non-directional blocking graph ● Isolate every pair of parts that are in contact.

Non-directional blocking graph ● Find cone of allowed directions.

Non-directional blocking graph ● Each regular region represent a separate relationship between the part.

Non-directional blocking graph ● Repeat for next pair in contact.

Incremental updates ● Build the NDBG during the design of the product. ● Modification of a part can be represented as a deletion followed by an addition of a part. ● Delete: – Remove the corresponding node and all arcs connected to it. ● Add: – The a node and arcs to the other parts that are in contact.

3D

Face Edge Vertex

A B C 3D Incremental A B C

3D Incremental A B C AC B

Infinite translations

S5S5 3 Translations + 3 Rotations Translations + rotations

Complexity measures

A B C Blocking Graph A B A B C Assembly sequence Complexity measures NDBG …and more ! (next article) Summary