COMP Robotics: An Introduction

Slides:



Advertisements
Similar presentations
Jason Clark Inverse Kinematics Jason Clark
Advertisements

Inverse Kinematics Professor Nicola Ferrier ME 2246,
Manipulator’s Inverse kinematics
Kinematics & Grasping Need to know: Representing mechanism geometry Standard configurations Degrees of freedom Grippers and graspability conditions Goal.
Animation Following “Advanced Animation and Rendering Techniques” (chapter 15+16) By Agata Przybyszewska.
Forward and Inverse Kinematics CSE 3541 Matt Boggus.
Chris Hall Aerospace and Ocean Engineering
Dynamics of Articulated Robots Kris Hauser CS B659: Principles of Intelligent Robot Motion Spring 2013.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
Rational Trigonometry Applied to Robotics
Ch. 7: Dynamics.
“Inverse Kinematics” The Loop Closure Problem in Biology Barak Raveh Dan Halperin Course in Structural Bioinformatics Spring 2006.
UNC Chapel Hill M. C. Lin Reading Assignments Principles of Traditional Animation Applied to 3D Computer Animation, by J. Lasseter, Proc. of ACM SIGGRAPH.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
Ch. 4: Velocity Kinematics
3D orientation.
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 20: Inverse Kinematics Ravi Ramamoorthi Most slides courtesy.
Forward Kinematics.
Kinematics. ILE5030 Computer Animation and Special Effects2 Kinematics The branch of mechanics concerned with the motions of objects without regard to.
Dr. Y.P. Daniel Chang Weidong Zhang Velocity Transformation Based Multi-Body Approach for Vehicle Dynamics Abstract: An automobile is a complex close loop.
CSCE 689: Computer Animation Rotation Representation and Interpolation
CSCE 441: Computer Graphics Rotation Representation and Interpolation
CSCE 641: Computer Graphics Rotation Representation and Interpolation Jinxiang Chai.
ME Robotics DIFFERENTIAL KINEMATICS Purpose: The purpose of this chapter is to introduce you to robot motion. Differential forms of the homogeneous.
CSCE 689: Forward Kinematics and Inverse Kinematics
Serial and Parallel Manipulators
Inverse Kinematics (part 1) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Winter 2005.
Inverse Kinematics Jacobian Matrix Trajectory Planning
Introduction to ROBOTICS
역운동학의 구현과 응용 Implementation of Inverse Kinematics and Application 서울대학교 전기공학부 휴먼애니메이션연구단 최광진
Advanced Graphics (and Animation) Spring 2002
Definition of an Industrial Robot
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Kinematic Linkages.
Feb 17, 2002Robotics 1 Copyright Martin P. Aalund, Ph.D. Kinematics Kinematics is the science of motion without regard to forces. We study the position,
Advanced Programming for 3D Applications CE Bob Hobbs Staffordshire university Human Motion Lecture 3.
Inverse Kinematics.
Lecture 2: Introduction to Concepts in Robotics
Inverse Kinematics.
Simulation and Animation
1 Fundamentals of Robotics Linking perception to action 2. Motion of Rigid Bodies 南台科技大學電機工程系謝銘原.
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
Inverting the Jacobian and Manipulability
Review: Differential Kinematics
M. Zareinejad 1. 2 Grounded interfaces Very similar to robots Need Kinematics –––––– Determine endpoint position Calculate velocities Calculate force-torque.
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.
1cs426-winter-2008 Notes  Will add references to splines on web page.
Just a quick reminder with another example
Inverse Kinematics for Robotics using Neural Networks. Authors: Sreenivas Tejomurtula., Subhash Kak
Kinematic Synthesis October 6, 2015 Mark Plecnik.
INTRODUCTION TO DYNAMICS ANALYSIS OF ROBOTS (Part 4)
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
Learning from the Past, Looking to the Future James R. (Jim) Beaty, PhD - NASA Langley Research Center Vehicle Analysis Branch, Systems Analysis & Concepts.
Numerical Methods for Inverse Kinematics Kris Hauser ECE 383 / ME 442.
Fundamentals of Computer Animation
Velocity Propagation Between Robot Links 3/4 Instructor: Jacob Rosen Advanced Robotic - MAE 263D - Department of Mechanical & Aerospace Engineering - UCLA.
CSCE 441: Computer Graphics Forward/Inverse kinematics
Character Animation Forward and Inverse Kinematics
Manipulator Dynamics 1 Instructor: Jacob Rosen
INVERSE MANIPULATOR KINEMATICS
Computer Animation Algorithms and Techniques
Zaid H. Rashid Supervisor Dr. Hassan M. Alwan
University of Bridgeport
Reading Assignments Principles of Traditional Animation Applied to 3D Computer Animation, by J. Lasseter, Proc. of ACM SIGGRAPH 1987 Computer Animation:
Mobile Robot Kinematics
Inverse Kinematics, Jacobians
CSCE 441: Computer Graphics Forward/Inverse kinematics
Computer Animation Algorithms and Techniques
Skeletal Motion, Inverse Kinematics
Chapter 4 . Trajectory planning and Inverse kinematics
Robotics 1 Copyright Martin P. Aalund, Ph.D.
Presentation transcript:

COMP790-072 Robotics: An Introduction Kinematics & Inverse Kinematics UNC Chapel Hill M. C. Lin

Forward Kinematics UNC Chapel Hill M. C. Lin

What is f ? UNC Chapel Hill M. C. Lin

What is f ? UNC Chapel Hill M. C. Lin

Other Representations Separate Rotation + Translation: T(x) = R(x) + d Rotation as a 3x3 matrix Rotation as quaternion Rotation as Euler Angles Homogeneous TXF: T=H(R,d) UNC Chapel Hill M. C. Lin

Forward Kinematics As DoF increases, there are more transformation to control and thus become more complicated to control the motion. Motion capture can simplify the process for well-defined motions and pre-determined tasks. UNC Chapel Hill M. C. Lin

Forward vs. Inverse Kinematics UNC Chapel Hill M. C. Lin

Inverse Kinematics (IK) As DoF increases, the solution to the problem may become undefined and the system is said to be redundant. By adding more constraints reduces the dimensions of the solution. It’s simple to use, when it works. But, it gives less control. Some common problems: Existence of solutions Multiple solutions Methods used UNC Chapel Hill M. C. Lin

Numerical Methods for IK Analytical solutions not usually possible Large solution space (redundancy) Empty solution space (unreachable goal) f is nonlinear due to sin’s and cos’s in the rotations. Find linear approximation to f -1 Numerical solutions necessary Fast Reasonably accurate Yet Robust UNC Chapel Hill M. C. Lin

The Jacobian UNC Chapel Hill M. C. Lin

The Jacobian UNC Chapel Hill M. C. Lin

The Jacobian UNC Chapel Hill M. C. Lin

Computing the Jacobian To compute the Jacobian, we must compute the derivatives of the forward kinematics equation The forward kinematics is composed of some matrices or quaternions UNC Chapel Hill M. C. Lin

Matrix Derivatives UNC Chapel Hill M. C. Lin

Rotation Matrix Derivatives UNC Chapel Hill M. C. Lin

Angular Velocity Matrix UNC Chapel Hill M. C. Lin

UNC Chapel Hill M. C. Lin

UNC Chapel Hill M. C. Lin

Computing J+ Fairly slow to compute Instability around singularities Breville’s method: J+(JJT)-1 Complexity: O(m2n) ~ 57 multiply per DOF with m = 6 Instability around singularities Jacobian loses rank in certain configur. UNC Chapel Hill M. C. Lin

Jacobian Transpose Use JT rather than J+ Avoid excessive inversion Avoid singularity problem UNC Chapel Hill M. C. Lin

Principles of Virtual Work Work = force x distance Work = torque x angle UNC Chapel Hill M. C. Lin

Jacobian Transpose Essentially we’re taking the distance to the goal to be a force pulling the end-effector. With J-1, the solution was exact to the linearized problem, but this is no longer so. UNC Chapel Hill M. C. Lin

Jacobian Transpose UNC Chapel Hill M. C. Lin

Jacobian Transpose In effect this JT method solves the IK problem by setting up a dynamical system that obeys the Aristotilean laws of physics: F = m v ;  = I and the steepest descent method. The J+ method is equivalent to solving by Newtonian method UNC Chapel Hill M. C. Lin

Pros & Cons of Using JT + Cheaper evaluation + No singularities - Scaling Problems J+ has minimal norm at every step and JT doesn’t have this property. Thus joint far from end-effector experience larger torque, thereby taking disproportionately large time steps Use a constant matrix to counteract - Slower Convergence than J+ Roughly 2x slower [Das, Slotine & Sheridan] UNC Chapel Hill M. C. Lin

Cyclic Coordinate Descend (CCD) Just solve 1-DOF IK-problem repeatedly up the chain 1-DOF problems are simple & have analytical solutions UNC Chapel Hill M. C. Lin

CCD Math - Prismatic UNC Chapel Hill M. C. Lin

CCD Math - Revolute UNC Chapel Hill M. C. Lin

CCD Math - Revolute You can optimize orientation too, but need to derive orientation error and minimize the combination of two You can derive expression to minimize other goals too. Shown here is for point goals, but you can define the goal to be a line or plane. UNC Chapel Hill M. C. Lin

Pros and Cons of CCD + Simple to implement + Often effective + Stable around singular configuration + Computationally cheap + Can combine with other more accurate optimizations - Can lead to odd solutions if per step not limited, making method slower - Doesn’t necessarily lead to smooth motion UNC Chapel Hill M. C. Lin

References UNC Chapel Hill M. C. Lin