Tao Zhang Gordon Smith Ken Goldberg ALPHA Lab, UC Berkeley The Toppling Graph: Designing Pin Sequence for Part Feeding Robert-Paul Berretty Mark Overmars.

Slides:



Advertisements
Similar presentations
Robot Grasp Planning using Parallel Sampling to Estimate Uncertainty in Pose, Shape, and Mechanics Melissa Goldstein Edward Lee Frank Ong Josh Goldberg.
Advertisements

Wednesday March 1st Dr. Moran
Analysis of Algorithms CS Data Structures Section 2.6.
Trig Graphs. y = sin x y = cos x y = tan x y = sin x + 2.
Computer Science A family of rigid body models: connections between quasistatic and dynamic multibody systems Jeff Trinkle Computer Science Department.
EXAMPLE 1 Solve a multi-step problem
4.5 Graphs of Sine and Cosine y = sin x Fill in the following chart for sin x.
Convex Hull obstacle start end Convex Hull Convex Hull
Care & Feeding of Machines Feeding parts –vibratory feed bowls –conveyors –pick & place Material obtained from: –Boothroyd, Automatic Assembly –Ken Goldberg,
Visibility Computations: Finding the Shortest Route for Motion Planning COMP Presentation Eric D. Baker Tuesday 1 December 1998.
A Geometric Approach to Designing a Programmable Force Field with a Unique Stable Equilibrium for Parts in the Plane Attawith Sudsang and Lydia E. Kavraki.
Computer Science Robotics at Rensselaer Faculty: Srinivas Akella Wes Huang Volkan Isler Jeff Trinkle John Wen Thanks to Barry Bharathm from the GRASP Lab.
Putting the Turing into Manufacturing: Algorithmic Automation and Recent Developments in Feeding and Fixturing Ken Goldberg, UC Berkeley.
CS 326 A: Motion Planning Part Feeding.
Gripping Parts at Concave Vertices K. “Gopal” Gopalakrishnan Ken Goldberg U.C. Berkeley.
Trajectory Simplification
1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, U.C. Berkeley.
CS3381 Des & Anal of Alg ( SemA) City Univ of HK / Dept of CS / Helena Wong 8. Approximation Alg Approximation.
Motion and Manipulation 2009/2010 Frank van der Stappen Game and Media Technology.
Lengths of Plane Curves
CS 326 A: Motion Planning Manipulation Planning.
Motion and Manipulation 2008/09 Frank van der Stappen Game and Media Technology.
Vladlen Koltun, UC Berkeley Joint work with Sariel Har-Peled, Dezhen Song and Ken Goldberg Efficient Algorithms for Shared Camera Control.
Gripping Sheet Metal Parts at Vertices K. Gopalakrishnan A Project for CS 287.
Networked robots ken goldberg, uc berkeley
Alyce Brady CS 510: Computer Algorithms Depth-First Graph Traversal Algorithm.
Maximal Cliques in UDG: Polynomial Approximation Rajarshi Gupta, Jean Walrand Dept of EECS, UC Berkeley Olivier Goldschmidt, OPNET Technologies International.
1 Computing Deform Closure Grasps K. “Gopal” Gopalakrishnan Ken Goldberg UC Berkeley.
An Implicit Time-Stepping Method for Multibody Systems with Intermittent Contact Nilanjan Chakraborty, Stephen Berard, Srinivas Akella, and Jeff Trinkle.
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
Orienting Polygonal Parts without Sensors Kenneth Y. Goldberg Presented by Alan Chen.
1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, UC Berkeley.
Magnetic Position Sensors Reed switches (sense permanent magnet) Inductive proximity sensors (eddy current) Hall Sensors (sense permanent magnet)
1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, U.C. Berkeley.
Graph the function y = |4 cos x|
1 D-Space and Deform Closure: A Framework for Holding Deformable Parts K. “Gopal” Gopalakrishnan, Ken Goldberg IEOR and EECS, U.C. Berkeley.
This is the graph of y = sin xo
Practice for tomorrow’s test (solutions included).
Computer-Aided Design and Manufacturing Laboratory: Rotational Drainability Sara McMains UC Berkeley.
Care & Feeding of Machines Feeding parts –orientation –singulation Material obtained from: –Boothroyd, Automatic Assembly –Ken Goldberg, UCB Industrial.
Putting the Turing into Manufacturing: Algorithmic Automation and Recent Developments in Feeding and Fixturing Ken Goldberg, UC Berkeley IEEE ICRA 2007.
Random Generation and Enumeration of Bipartite Permutation Graphs Toshiki Saitoh (JAIST, Japan) Yota Otachi (Gunma Univ., Japan) Katsuhisa Yamanaka (UEC,
Parametric Equations. You throw a ball from a height of 6 feet, with an initial velocity of 90 feet per second and at an angle of 40º with the horizontal.
1 Example 1(a) Sketch the graph of f(x) = 3sin x. Solution The graph of f plots the point (x,3sin x) at three times the height of the point (x,sin x) on.
CSCI 3160 Design and Analysis of Algorithms Chengyu Lin.
1 Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen Chang, Chia-Lin Yang National Taiwan.
Robot Grasp Planning using Parallel Sampling to Estimate Uncertainty in Pose, Shape, and Mechanics Melissa Goldstein Edward Lee Frank Ong Josh Goldberg.
Algorithm for obtaining the connected components of a graph Samia Qader 252a-az HW # 6 all examples obtained from LEDA software in directory: 252a/handout/demo/graphwin/graphwin.
Vibratory Bowl Feeder “The real problem is not part transfer but part orientation” -Frank Riley, Bodine Corp.
GRAPHING ON A COORDINATE PLANE. VOCABULARY Coordinate system- a system which uses one or more numbers or coordinates, to uniquely determine the position.
EXAMPLE 1 Graph a vertical translation Graph y = 2 sin 4x + 3. SOLUTION STEP 1 Identify the amplitude, period, horizontal shift, and vertical shift. Amplitude:
Two Finger Caging of Concave Polygon Peam Pipattanasomporn Advisor: Attawith Sudsang.
9-2 Reflections Objective: To find reflection images of figures.
Community detection via random walk Draft slides.
Uncertainty in Grasping and Feeding Frank van der Stappen Utrecht University Shanghai, China, May 9, 2011.
(0, 1 ) (1,0)  (r,0) (0,r) Circle of radius r. (0,1) (1,0)  (r,0) (0,r) (cos ,sin  ) 1.
Calculus 6-R Unit 6 Applications of Integration Review Problems.
Open Problems 1. Autoplace: locate the robot base to minimize total travel time. 2. Cable Routing: route cables to minimize total turning angle. 3. Design.
Motions are Repetitive Design changes Intermittently
3B Reflections 9-2 in textbook
Objective- To find the slope of a line given
Feeding Polyhedral Parts
Algorithms + Data Structures = Programs -Niklaus Wirth
Care & Feeding of Machines
Bowl Feeders - Trap Design
Motion and Manipulation
10.4 Parametric Equations.
7.6 Graphing Systems of Linear Inequalities
What is your best guess as to how the given function
Graphing on a Coordinate plane
Presentation transcript:

Tao Zhang Gordon Smith Ken Goldberg ALPHA Lab, UC Berkeley The Toppling Graph: Designing Pin Sequence for Part Feeding Robert-Paul Berretty Mark Overmars CS Dept., Utrecht Univ.

The Problem:

Pin Sequence Design: An Example

The Solution: Designing Pin Sequence

Related Work Lozano-Perez [86]: part feeding as a dual of motion planning Erdmann and Mason [88]: sensorless manipulation Trinkle [92]: orienting parts in the vertical plane using gripper Goldberg [93]: orienting parts in the horizontal plane using gripper

Fences over conveyor belts: –Peshkin and Sanderson [88]: a numerical search algorithm –Akella et al. [97]: 1-JOC analysis –Berretty et al. [97]: a polynomial-time algorithm –Wiegley et al. [98]: a complete algorithm Toppling manipulation –Lynch [99]: toppling analysis –Zhang et al. [00]: compensatory grasping

Compute critical pin heights Approach Plan pin sequence

Critical Pin Heights Toppling Graph

Radius function R(  ): height of the COM as the part rotates Vertex height functions V i (  ): height of vertex i as the part rotates Functions 

Rolling Height Function X Z

1 w il (  ) = (2  t z i cos  il –  cos(  il -  ) –  cos il - 2  t x i sin  il +  t  sin(  il -  ) +  t  sin il ) / (2  t sin(  il -  i )), H il (  ) = x i sin  + z i cos  + w il sin(  i +  ). Rolling Height Function: Computation

Rolling Height Function: Graph h =c=c cc h  =0

Jamming Height Functions X Z

Toppling Graph B BBB

Physical Experiment using an Adept Flex Feeder conveyor belt;  t = 53   2  and  p = 5   2 . Comparison of prediction with experiment.

Pin Planning

Pin Planning (Cont.) Total running time: O(n 3n ) in the worst case n n -1 1 O(n3)O(n3) O(n3)O(n3) O(n3)O(n3)

Conclusion Toppling Graph –Vertex height functions –Rolling height functions –Jamming height functions Pin sequence planning

Future Work Optimal gripper jaw design -- topple parts by a set of pins

Future Work(Cont.)