Kinematic Synthesis 2 October 8, 2015 Mark Plecnik.

Slides:



Advertisements
Similar presentations
CIE Centre A-level Pure Maths
Advertisements

Roots & Zeros of Polynomials I
Roots & Zeros of Polynomials
5.1 Real Vector Spaces.
More Vectors.
Mechanics of Machines Dr. Mohammad Kilani
Colloquium, School of Mathematcs University of Minnesota, October 5, 2006 Computing the Genus of a Curve Numerically Andrew Sommese University of Notre.
8 CHAPTER Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1.
1 All figures taken from Design of Machinery, 3 rd ed. Robert Norton 2003 MENG 372 Chapter 5 Analytical Position Synthesis.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
Mechanical Engineering Dept, SJSU
ON MULTIVARIATE POLYNOMIAL INTERPOLATION
§ 10.5 Systems of Nonlinear Equations in Two Variables.
Solving Systems of Equations Algebraically
Linear Systems The definition of a linear equation given in Chapter 1 can be extended to more variables; any equation of the form for real numbers.
LINEAR EQUATION IN TWO VARIABLES. System of equations or simultaneous equations – System of equations or simultaneous equations – A pair of linear equations.
The Rational Zero Theorem
Solving Equations Containing To solve an equation with a radical expression, you need to isolate the variable on one side of the equation. Factored out.
1 1.1 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra SYSTEMS OF LINEAR EQUATIONS.
Solving Systems of Linear Equations
Bell Work: Find the values of all the unknowns: R T = R T T + T = 60 R = 3 R =
Dimensional Synthesis of RPC Serial Robots
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
MATH – High School Common Core Vs Tested Kansas Standards Please note: For informational purposes, all Common Core standards are listed, and the tested.
Mechanics of Machines Dr. Mohammad Kilani Class 3 Position Analysis.
Table of Contents Solving Linear Systems of Equations - Dependent Systems The goal in solving a linear system of equations is to find the values of the.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Polynomial Functions. A Polynomial is an expression that is either a real number, a variable, or a product of real numbers and variables with whole number.
9.9 The Fundamental Theorem of Algebra
视觉的三维运动理解 刘允才 上海交通大学 2002 年 11 月 16 日 Understanding 3D Motion from Images Yuncai Liu Shanghai Jiao Tong University November 16, 2002.
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Precalculus Complex Zeros V. J. Motto. Introduction We have already seen that an nth-degree polynomial can have at most n real zeros. In the complex number.
Real Zeros of a Polynomial Function Objectives: Solve Polynomial Equations. Apply Descartes Rule Find a polynomial Equation given the zeros.
2.5 ZEROS OF POLYNOMIAL FUNCTIONS Copyright © Cengage Learning. All rights reserved.
Chapter 1 - Fundamentals Equations. Definitions Equation An equation is a statement that two mathematical statements are equal. Solutions The values.
Systems of Equations and Inequalities Systems of Linear Equations: Substitution and Elimination Matrices Determinants Systems of Non-linear Equations Systems.
Algebra 1 Notes Lesson 7-4 Elimination Using Multiplication.
Introduction Synthetic division, along with your knowledge of end behavior and turning points, can be used to identify the x-intercepts of a polynomial.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
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.
1 Section 5.3 Linear Systems of Equations. 2 THREE EQUATIONS WITH THREE VARIABLES Consider the linear system of three equations below with three unknowns.
3-2 Solving Linear Systems Algebraically Objective: CA 2.0: Students solve system of linear equations in two variables algebraically.
Kinematic Synthesis October 6, 2015 Mark Plecnik.
Complex Zeros and the Fundamental Theorem of Algebra.
Determining 3D Structure and Motion of Man-made Objects from Corners.
Topic VII: Polynomial Functions Solving Polynomial Equations Roots and Zeros.
Systems of Equations and Inequalities 9. Systems of Equations 9.1.
Sect. 4.5: Cayley-Klein Parameters 3 independent quantities are needed to specify a rigid body orientation. Most often, we choose them to be the Euler.
Roots & Zeros of Polynomials I
Solving Systems of Equations in Two Variables; Applications
Solving Systems of Equations in Three Variables
The Fundamental Theorem of Algebra and Complete Factorization
Copyright © Cengage Learning. All rights reserved.
PROGRAMME F6 POLYNOMIAL EQUATIONS.
Copyright © Cengage Learning. All rights reserved.
Appendix A.5 Solving Equations.
Solving Equations Containing
Solving Equations Containing
Roots & Zeros of Polynomials I
Inverse Kinematics 12/30/2018.
Polynomials CA 10.0.
Solving Equations Containing
Roots & Zeros of Polynomials I
2 Equations, Inequalities, and Applications.
Roots & Zeros of Polynomials I
Chapter 4 . Trajectory planning and Inverse kinematics
Solving Equations Containing
Copyright © Cengage Learning. All rights reserved.
Presentation transcript:

Kinematic Synthesis 2 October 8, 2015 Mark Plecnik

Planar Kinematics With Complex Numbers θ (a x + ia y ) + (b x + ib y ) = (a x +b x ) + i(a y +b y ) e iθ (a x + ia y ) = (cosθ + isinθ)(a x + ia y ) = (a x cosθ – a y sinθ) + i(a x sinθ + a y cosθ) a b x y x y Re Im Re Im a

Motion Generation of a Crank Any two planar positions define a pole A P0P0 P1P1 θ1θ1 T 1 (P 0 −A) T 1 =e iθ ₁ Sum up this vector loop: A+T 1 (P 0 −A)=P 1 A is the only unknown and this equation is linear

Path Generation of a Crank P2P2 P1P1 P0P0 θ1θ1 θ2θ2 T 1 (P 0 −A) T 2 (P 0 −A) T 2 =e iθ 2 T 1 =e iθ 1, Now we can sum 2 loop equations: A+T 1 (P 0 −A)=P 1 A+T 2 (P 0 −A)=P 2 This time as unknowns, we don’t know A, T 1, or T 2 Since T 1 and T 2 are rotation operators, we know they must satisfy constraints A because 4 equations & 5 unknowns

In order to accommodate these new conjugate unknowns, we append new conjugate loop equations. Path Generation of a Crank -2 In all we have 6 equations in 6 unknowns: Unknowns: Bézout’s Theorem: the maximum number of roots of a polynomial system is the product of the degrees of each equation In this case, the degree is 2 6 = 64. Meaning there are 64 solutions. Which means there are 64 cranks which travel through 3 points. That can’t be true!

Path Generation of a Crank -3 substitute into which are 2 linear equations in 2 unknowns, therefore there is 1 solution Phew! That’s good because we know there is only 1 circle that goes through 3 points, and its coordinates will be at A = A x + iA y. Looks like our original estimate of 64 was a vast overestimation!, and obtain

Motion Generation of a Four-bar Graphical method: It exists but it’s cumbersome See Geometric Design of Linkages by McCarthy and Soh …and where does the number 5 come from?

Motion Generation of a Four-bar -2 θjθj A B C D P0P0 ψjψj ϕjϕj PjPj Q j (C−A) T j (P 0 −C) S j (D−B) T j (P 0 −D) T j =e iθ j Q j =e i ϕ j,S j =e iψ j, A + Q j (C−A) + T j (P 0 −C) = P j B + S j (D−B) + T j (P 0 −D) = P j Then append conjugate loop equations: and unit magnitude equations for the unknown rotation operators: Knowns:Unknowns: N is no. of positions

Motion Generation of a Four-bar -3 θjθj A B C D P0P0 ψjψj ϕjϕj PjPj Q j (C−A) T j (P 0 −C) S j (D−B) T j (P 0 −D) The equations corresponding to the 2 halves of the linkage are symmetric: A + Q j (C−A) + T j (P 0 −C) = P j B + S j (D−B) + T j (P 0 −D) = P j AQj(C−A)Qj(C−A) C As well, the unknowns can be partitioned so that we can focus on one half of the linkage at a time Each half is called an RR chain. If we can find at least two RR chains, we can combine them to create a four-bar linkage.

Solving for an RR Chain Equations to solve: N is no. of positions Find N such that there is an equal number of equations and unknowns: N−1=44 This system consists of 12 quadratic equations. According to Bézout’s theorem, a maximum of 2 12 = 4096 roots exist. This is an overestimation, and by eliminating some variables we can compute a lower Bézout degree. substitute into, and obtain

Solving for an RR Chain -2 However, it turns out that 16 is also an overestimation to number of roots. So how do we find the real number of roots? We must analyze the monomial structure of the polynomial system. If we were to expand We would find the following list of monomials in each polynomial It is because of this sparse monomial structure that the system does not have 16 roots. So how do we figure out how many roots we have? Say we piece together another dummy system that looks like this:

…another dummy system that looks like this: Counting the Number of Roots where the monomials in red are extra from our original system. Therefore, if we can figure out the number of roots of our dummy system (which is more general than our original system), we can conjecture that our original system will not have more roots than that. Our dummy system has an easy solution. We can simply solve a sequence of linear systems.

Solving the Dummy System The dummy system can be solved by solving a sequence of linear systems: The number of combinations is 4 choose 2 = 6. There can be no more than 6 solutions to our original system!

Solving for RR Chains Now that we know the max number of roots to our system is 6. Let’s solve it! GOAL: Turn this system into a single univariate polynomial in terms of A. We begin solving it by expanding the equations and writing them in this form: where where A is the suppressed variable which is only found inside of the k coefficients Written this way, the system is linear in terms of monomial unknowns

Creating a Resultant Matrix 5 monomial quantities are considered unknowns For the time being, we are going to pretend each monomial is an independent unknown Matrix is rank 4 System is underdetermined Now for the trick: multiply all the equations by C and append them to the system vector must live in the null space must have nullity > 0, therefore the determinant must equal 0 A is the only variable suppressed inside here

Building Four-bars from RR Chains The determinant of the matrix is a degree 4 univariate polynomial f(A) = 0. Which can be solved by standard approaches e.g. the quartic equation or numpy.roots So it ends up that the real number of solutions is even less than our estimate of 6, this is because our dummy system used for counting had a more general monomial structure Our system: Dummy system: Each solution represents an RR chain: DOF Pick 2 RR chains and connect to create a four-bar Total of 4 choose 2 = 6 four-bars

Another Approach: Four-bar as a Constrained RR chain for Path Generation Last time we started with 5 task positions (x 0, y 0, θ 0 ) (x 1, y 1, θ 1 ) (x 2, y 2, θ 2 ) (x 3, y 3, θ 3 ) (x 4, y 4, θ 4 ) Let’s start with a different problem statement (x 0, y 0 ) (x 1, y 1 ) (x 2, y 2 ) (x 3, y 3 ) (x 4, y 4 ) A C D B Specify 5 points You pick an RR chain! Solve for a 2 nd constraining RR chain 2 DOF 1 DOF

Inverse Kinematics of an RR chain Write the loop equations for the known RR chain: In this case we know dimensions: B and D We know the end effector position: P = x j + iy j We want to find joint angle parameters: ψ j and θ j (or equivalently S j =e iψ j and T j =e iθ j ) This is inverse kinematics! The loop equation can be rewritten as and solved for all T j using the quadratic equation.

Solutions for a Constrained RR Chain Now let’s model the unknown side of the four-bar linkage: One of these solutions will be the original RR chain BDP 0. These type of solutions always occur in pairs. This means of the 4 solutions: 1 is BDP 0, 1 is a physical design, 2 are not physical designs 1 is BDP 0, 3 are physical designs