Analysis of Multifingered Hands Kerr and Roth 1986.

Slides:



Advertisements
Similar presentations
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Advertisements

© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
B659: Principles of Intelligent Robot Motion Spring 2013 David Tidd.
Manipulator Dynamics Amirkabir University of Technology Computer Engineering & Information Technology Department.
Manipulator’s Inverse kinematics
Continuing with Jacobian and its uses ME 4135 – Slide Set 7 R. R. Lindeke, Ph. D.
Chapter 4 Systems of Linear Equations; Matrices Section 2 Systems of Linear Equations and Augmented Matrics.
Kinematics & Grasping Need to know: Representing mechanism geometry Standard configurations Degrees of freedom Grippers and graspability conditions Goal.
Mapping Human Hands to Robotic Hands Literature Review HANDS.DVI Kick Off IIT, January 2011.
Department of Computer Science, Iowa State University Robot Grasping of Deformable Objects Yan-Bin Jia (joint work with Ph.D. students Feng Guo and Huan.
Inverse Kinematics Set goal configuration of end effector
Mechanics of Machines Dr. Mohammad Kilani
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
1Notes  Handing assignment 0 back (at the front of the room)  Read the newsgroup!  Planning to put 16mm films on the web soon (possibly tomorrow)
Robot Modeling and the Forward Kinematic Solution ME 4135 Lecture Series 4 Dr. R. Lindeke – Fall 2011.
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
Ch. 3: Forward and Inverse Kinematics
A Study on Object Grasp with Multifingered Robot Hand Ying LI, Ph.D. Department of Mechanical Engineering Kagoshima University, Japan.
IK: Choose these angles!
Forward Kinematics.
Inverse Kinematics How do I put my hand here? IK: Choose these angles!
ME Robotics DIFFERENTIAL KINEMATICS Purpose: The purpose of this chapter is to introduce you to robot motion. Differential forms of the homogeneous.
Manipulator Dynamics Amirkabir University of Technology Computer Engineering & Information Technology Department.
CSCE 689: Forward Kinematics and Inverse Kinematics
Single Point of Contact Manipulation of Unknown Objects Stuart Anderson Advisor: Reid Simmons School of Computer Science Carnegie Mellon University.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
1 Chapter 2 Matrices Matrices provide an orderly way of arranging values or functions to enhance the analysis of systems in a systematic manner. Their.
3.7. O THER G AME P HYSICS A PPROACHES Overview of other game engine physics approaches.
LINEAR PROGRAMMING SIMPLEX METHOD.
Definition of an Industrial Robot
February 21, 2000Robotics 1 Copyright Martin P. Aalund, Ph.D. Computational Considerations.
Row rows A matrix is a rectangular array of numbers. We subscript entries to tell their location in the array Matrices are identified by their size.
Lecture 2: Introduction to Concepts in Robotics
Chapter 2 Robot Kinematics: Position Analysis
Chapter 5 Trajectory Planning 5.1 INTRODUCTION In this chapters …….  Path and trajectory planning means the way that a robot is moved from one location.
This presentation shows how the tableau method is used to solve a simple linear programming problem in two variables: Maximising subject to two  constraints.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Manipulator’s Forward kinematics
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
KINEMATIC CHAINS & ROBOTS (I).
11/10/2015Handout 41 Robotics kinematics: D-H Approach.
Review: Differential Kinematics
Kinematic Redundancy A manipulator may have more DOFs than are necessary to control a desired variable What do you do w/ the extra DOFs? However, even.
Kinematics. The function of a robot is to manipulate objects in its workspace. To manipulate objects means to cause them to move in a desired way (as.
1cs426-winter-2008 Notes  Will add references to splines on web page.
Outline: Introduction Solvability Manipulator subspace when n<6
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
Physics Instructor: Dr. Tatiana Erukhimova Lecture 6.
Rick Parent - CIS681 Reaching and Grasping Reaching control synthetic human arm to reach for object or position in space while possibly avoiding obstacles.
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.
Manipulator Kinematics Treatment of motion without regard to the forces that cause it. Contents of lecture: vResume vDirect kinematics vDenavit-Hartenberg.
Matrices When data from a table (or tables) needs to be manipulated, easier to deal with info in form of a matrix. Fresh Soph Jun Sen A B 7 C 1 6.
Linear Programming Many problems take the form of maximizing or minimizing an objective, given limited resources and competing constraints. specify the.
IK: Choose these angles!
Character Animation Forward and Inverse Kinematics
Chap 10. Sensitivity Analysis
3.7. Other Game Physics Approaches
Special English for Industrial Robot
Multi-Limb Robots on Irregular Terrain
Linear Programming.
Inverse Kinematics 12/30/2018.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
KINEMATIC CHAINS & ROBOTS (I)
Outline: Introduction Solvability Manipulator subspace when n<6
Special English for Industrial Robot
Matrices are identified by their size.
Chapter 4 . Trajectory planning and Inverse kinematics
Presentation transcript:

Analysis of Multifingered Hands Kerr and Roth 1986

Outline  1. contribution of this paper  1.1 Selection of Internal Grasp Forces  1.2 Manipulating Objects within the Hand  1.3 Hand Workspaces  2. limitation of this paper  3. future direction of this paper

1.1 Selection of Internal Grasp Forces  Determining how hard to squeeze an object in order to ensure a secure grasp  -f=WC ( 1 )  C=C p +C h ( 2 )  ( 3 )  C h = N ( 4 )

1.1 Selection of Internal Grasp Forces  Determining how hard to squeeze an object in order to ensure a secure grasp  Equation 1 shows that all forces must be balanced  Then we consider friction at the contact points  the friction cannot exceed the maximum available force due to friction, determined by the coefficient of static friction at each point  and the tangential components of the friction must balance out the contact forces so that the object does not move  Then we set up 2 nd ~8 th equations

1.1 Selection of Internal Grasp Forces  Friction constraints  For each contact,we have the constraint (5)  We must also ensure that the tangential components of the contact forces do not exceed the magnitude of the equilibrating friction force. Using a Coulomb friction model,this constraint is written as (6)

1.1 Selection of Internal Grasp Forces  If we choose to use four planes, the linear approximation to equation 6 is written as the set of equations  similarly for torsional friction...  ( 7 ) (8)

1.1 Selection of Internal Grasp Forces  joint torque limits  we also know the max torque that each finger can exert… so the other constraints are that this max torque cannot be exceeded and min torque is required.  (9)

1.1 Selection of Internal Grasp Forces  Through a series of computation and substituting  (10)  (11)

1.1 Selection of Internal Grasp Forces  Optimal selection of internal grasp force  An optimal selection of is one for which we are furthest from violating any one of the constraints.the distance of some point from the plane formed by the ith constraint of equation is given by (12)  reformulating the formula to pose this problem as a standard linear optimization problem,we get (13)

1.1 Selection of Internal Grasp Forces  These inequalities are written in more conventional form if we create a vector which is the vector augmented with the distance variable, d. Equation 13 then becomes  (14)  the function we wish to maximize (15)  Equations 14 and 15 form a linear programming problem in its standard form, which is readily solved by the Simplex method.

1.2. Manipulating Objects within the Hand  determining the motion of each finger joint required to achieve a desired motion of the object.  The motion of the contact point on each fingertip is identical to the motion of the corresponding contact position on the object.If the inverse kinematic solution for each finger is known, the required finger-joint motions are easily calculated.

1.2. Manipulating Objects within the Hand  Here,we will consider only the case of pure rolling between the object and the fingertip.  In the meantime We will consider the minimum case of fingers with three joints.

Consider a simple case that a finger in contact with an object

1.2. Manipulating Objects within the Hand Going through the computation of math (16)-(23) for first row,(24)-(29) for The second row

1.2. Manipulating Objects within the Hand  Finally we got

1.3. Hand Workspaces  4 assumptions:  The type of contact present between the fingertips and the object is considered to be point contact with friction,and the contact points do not change during the motion.  The hand workspace will be defined for a particular configuration of contact points on the object and for particular locations of the contact points on the fingertips.

1.3. Hand Workspaces  The workspace for each fingertip5 is known and is considered fixed relative to the palm of the hand.  Collisions or intersections between the object and the finger links or between the finger links them- selves will be ignored.  with these four assumptions, determining the workspace for a hand can be reduced to the problem illustrated in figure 6 for a three-fingered hand.

1.3. Hand Workspaces

 Rather than deal with the complete six- dimensional configuration space of the object, we will define the total workspace of the hand as the volume swept out by one particular point q fixed in the object as the object is moved through all possible configurations. For our purposes, we will choose q to be the spatial center of the contact points on the object.

2. Limitations of this paper  Assumptions  1. for selection of internal grasp force, the paper assume there are only friction constraint and joint torque constraint.  2. for manipulating objects within the hand, the paper,Here,we will consider only the case of pure rolling between the object and the fingertip.  3. for hand workspaces, all the four assumptions are too restrictive for practical purposes.

3. Future Direction of this paper  1.Adding other types of constraints,to make a real case  2. for hand workspaces,the treatment of this problem here has not ad- dressed many of the important issues relating to the workspace. The first of these is the range of orientations possible at each point in the total workspace.  3. the analysis here assumes that the contact points are fixed on both the fingertips and the object.  4. The last important point not addressed above is that of intersection between the object and the fingers and between the fingers themselves.

3. Future Direction of this paper  There is no discussion about the influence of the size and shape on manipulation. And it’s important.  there is no discussion about how to decide a particular configuration and orientation of the end-effector to pick an object from many different possible configurations and orientations  In the meantime,The issue of singular configurations had not been covered.

Thank YOU!