IKFast: The Robot Kinematics Compiler¶

IKFast analytically solves robot inverse kinematics equations and generates optimized C++ files.

The inverse kinematics equations arise from attemping to place the robot end effector coordinate system in the world while maintaining joint and user-specified constraints. User-specified constraints make up many different IK Types, each of them having advantages depending on the task.

IKFast will work with any number of joints arranged in a chain; this is defined by the Robot.Manipulator. For chains containing more degrees of freedom (DOF) than the IK type requires, the user can set arbitrary values of a subset of the joints until the number of unknown joints matches the degrees of freedom of the IK type.

It is not trivial to create hand-optimized inverse kinematics solutions for arms that can capture all degenerate cases, having closed-form IK speeds up many tasks including planning algorithms, so it really is a must for most robotics researchers.

Closed-form solutions are necessary for motion planning due to two reasons:

• Numerical inverse kinematics solvers will always be much slower than closed form solutions. Planners require being able to process thousands of configurations per second. The closed-form code generated by ikfast can produce solutions on the order of ~4 microseconds! As a comparison, most numerical solutions are on the order of 10 milliseconds (assuming good convergence).
• The null space of the solution set can be explored because all solutions are computed.

IK Types¶

The following inverse kinematics types are supported:

• Transform6D - end effector reaches desired 6D transformation
• Rotation3D - end effector reaches desired 3D rotation
• Translation3D - end effector origin reaches desired 3D translation
• Direction3D - direction on end effector coordinate system reaches desired direction
• Ray4D - ray on end effector coordinate system reaches desired global ray
• Lookat3D - direction on end effector coordinate system points to desired 3D position
• TranslationDirection5D - end effector origin and direction reaches desired 3D translation and direction. Can be thought of as Ray IK where the origin of the ray must coincide.
• TranslationXY2D - end effector origin reaches desired XY translation position, Z is ignored. The coordinate system with relative to the base link.
• TranslationLocalGlobal6D - local point on end effector origin reaches desired 3D global point. Because both local point and global point can be specified, there are 6 values.
• TranslationXAxisAngle4D, TranslationYAxisAngle4D, TranslationZAxisAngle4D - end effector origin reaches desired 3D translation, manipulator direction makes a specific angle with x/y/z-axis (defined in the manipulator base link’s coordinate system)

The possible solve methods are defined by ikfast.IKFastSolver.GetSolvers()

Usage¶

The main file ikfast.py can be used both as a library and as an executable program. For advanced users, it is also possible to use run ikfast.py as a stand-alone program, which makes it mostly independent of the OpenRAVE run-time.

However, the recommended way of using IKFast is through the OpenRAVE databases.inversekinematics database generator which directly loads the IK into OpenRAVE as an interface.

python `openrave-config --python-dir`/openravepy/_openravepy_/ikfast.py --help

python `openrave-config --python-dir`/openravepy/_openravepy_/ikfast.py --robot=robots/barrettwam.robot.xml --baselink=0 --eelink=7 --savefile=ik.cpp --freeindex=2

kinbody = env.ReadRobotXMLFile('robots/barrettwam.robot.xml')
env.Add(kinbody)
solver = ikfast.IKFastSolver(kinbody=kinbody)
chaintree = solver.generateIkSolver(baselink=0,eelink=7,freeindices=[2],solvefn=ikfast.IKFastSolver.solveFullIK_6D)
code = solver.writeIkSolver(chaintree)
open('ik.cpp','w').write(code)

gcc -lstdc++ -o ik ik.cpp

Details¶

Terminology:

• solve joints - the joints to solve for using inverse kinematics
• free joints - the joints that are specified before the IK is run, these values are known at runtime, but not known at IK generation time.

The top level class is ikfast.IKFastSolver and generates an Abstract Syntax Tree (AST) using definitions from ikfast.AST. The AST is then passed to the language-specific generators defined in ikfast.CodeGenerators.

Internal symbolic math uses sympy. Infinite precision fractions are used in order to keep track of linearly independent equations and when they evaluate to 0. The infinite precision fractions are converted to decimals in the generators.

Open Issues¶

1. currently ikfast does not handle big decimal numbers well. for example defining the axes or anchors as 1.032513241 will produce very big fractions and make things slow.
2. there are cases when axes align and there are infinite solutions. although ikfast can detect such cases, we need a lot more work in this area.
3. for 6D ik, there are still mechanisms it cannot solve, please send the kinematics model if such a situation is encountered.
4. there are 10 different types of IK, currently ray4d IK needs a lot of work.

FAQ¶

17. ikfast has been running for more than an hour, will it ever finish?

1. Most likely not, usually an iksolver finishes within 10 minutes.

class openravepy.ikfast.AST[source]¶

Abstarct Syntax Tree class definitions specific for evaluating complex math equations.

class SolverBranchConds(jointbranches)[source]¶

end(generator)[source]¶

generate(generator)[source]¶

jointbranches = None¶

thresh = 9.9999999999999995e-07¶

class AST.SolverBreak[source]¶

Terminates this scope

checkValidSolution()[source]¶

end(generator)[source]¶

generate(generator)[source]¶

class AST.SolverCheckZeros(jointname, jointcheckeqs, zerobranch, nonzerobranch, thresh=9.9999999999999995e-07, anycondition=True)[source]¶

anycondition = None¶

checkValidSolution()[source]¶

dictequations = None¶

end(generator)[source]¶

equationsused = None¶

generate(generator)[source]¶

getEquationsUsed()[source]¶

getPresetCheckForZeros()[source]¶

jointcheckeqs = None¶

jointname = None¶

nonzerobranch = None¶

numsolutions()[source]¶

subs(solsubs)[source]¶

thresh = None¶

zerobranch = None¶

class AST.SolverCoeffFunction(jointnames, jointeval=None, exportvar=None, exportcoeffeqs=None, exportfnname=None, isHinges=None, rootmaxdim=16, jointevalcos=None, jointevalsin=None)[source]¶

Evaluate a set of coefficients and pass them to a custom function which will then return all possible values of the specified variables in jointnames.

FeasibleIsZeros = False¶

checkValidSolution()[source]¶

checkforzeros = None¶

dictequations = None¶

end(generator)[source]¶

equationsused = None¶

exportcoeffeqs = None¶

exportfnname = None¶

exportvar = None¶

generate(generator)[source]¶

getEquationsUsed()[source]¶

getPresetCheckForZeros()[source]¶

isHinges = True¶

jointeval = None¶

jointevalcos = None¶

jointevalsin = None¶

jointnames = None¶

numsolutions()[source]¶

presetcheckforzeros = None¶

rootmaxdim = None¶

score = None¶

subs(solsubs)[source]¶

class AST.SolverConditionedSolution(solversolutions)[source]¶

dictequations = None¶

end(generator)[source]¶

generate(generator)[source]¶

solversolutions = None¶

subs(solsubs)[source]¶

thresh = 9.9999999999999995e-07¶

class AST.SolverFreeParameter(jointname, jointtree)[source]¶

end(generator)[source]¶

generate(generator)[source]¶

jointname = None¶

jointtree = None¶

class AST.SolverIKChainAxisAngle(solvejointvars, freejointvars, Pee, angleee, jointtree, Pfk=None, anglefk=None, iktype=None)[source]¶

Pee = None¶

Pfk = None¶

angleee = None¶

anglefk = None¶

dictequations = None¶

end(generator)[source]¶

freejointvars = None¶

generate(generator)[source]¶

iktype = None¶

jointtree = None¶

leftmultiply(Tleft, Tleftinv)[source]¶

solvejointvars = None¶

class AST.SolverIKChainDirection3D(solvejointvars, freejointvars, Dee, jointtree, Dfk=None)[source]¶

Dee = None¶

Dfk = None¶

dictequations = None¶

end(generator)[source]¶

freejointvars = None¶

generate(generator)[source]¶

jointtree = None¶

leftmultiply(Tleft, Tleftinv)[source]¶

solvejointvars = None¶

class AST.SolverIKChainLookat3D(solvejointvars, freejointvars, Pee, jointtree, Pfk=None, Dfk=None)[source]¶

Dfk = None¶

Pee = None¶

Pfk = None¶

dictequations = None¶

end(generator)[source]¶

freejointvars = None¶

generate(generator)[source]¶

jointtree = None¶

leftmultiply(Tleft, Tleftinv)[source]¶

solvejointvars = None¶

class AST.SolverIKChainRay(solvejointvars, freejointvars, Pee, Dee, jointtree, Pfk=None, Dfk=None, is5dray=False)[source]¶

Dee = None¶

Dfk = None¶

Pee = None¶

Pfk = None¶

dictequations = None¶

end(generator)[source]¶

freejointvars = None¶

generate(generator)[source]¶

is5dray = False¶

jointtree = None¶

leftmultiply(Tleft, Tleftinv)[source]¶

solvejointvars = None¶

class AST.SolverIKChainRotation3D(solvejointvars, freejointvars, Ree, jointtree, Rfk=None)[source]¶

Ree = None¶

Rfk = None¶

dictequations = None¶

end(generator)[source]¶

freejointvars = None¶

generate(generator)[source]¶

jointtree = None¶

leftmultiply(Tleft, Tleftinv)[source]¶

solvejointvars = None¶

class AST.SolverIKChainTransform6D(solvejointvars, freejointvars, Tee, jointtree, Tfk=None)[source]¶

Tee = None¶

Tfk = None¶

dictequations = None¶

end(generator)[source]¶

freejointvars = None¶

generate(generator)[source]¶

jointtree = None¶

leftmultiply(Tleft, Tleftinv)[source]¶

solvejointvars = None¶

class AST.SolverIKChainTranslation3D(solvejointvars, freejointvars, Pee, jointtree, Pfk=None)[source]¶

Pee = None¶

Pfk = None¶

dictequations = None¶

end(generator)[source]¶

freejointvars = None¶

generate(generator)[source]¶

jointtree = None¶

leftmultiply(Tleft, Tleftinv)[source]¶

solvejointvars = None¶

uselocaltrans = False¶

class AST.SolverIKChainTranslationXY2D(solvejointvars, freejointvars, Pee, jointtree, Pfk=None)[source]¶

Pee = None¶

Pfk = None¶

dictequations = None¶

end(generator)[source]¶

freejointvars = None¶

generate(generator)[source]¶

jointtree = None¶

leftmultiply(Tleft, Tleftinv)[source]¶

solvejointvars = None¶

class AST.SolverMatrixInverse(A, Asymbols)[source]¶

Take the inverse of a large matirx and set the coefficients of the inverse to the symbols in Asymbols.

A = None¶

Asymbols = None¶

checkValidSolution()[source]¶

checkforzeros = None¶

end(generator)[source]¶

generate(generator)[source]¶

getsubs(psubs)[source]¶

subs(solsubs)[source]¶

class AST.SolverPolynomialRoots(jointname, poly=None, jointeval=None, isHinge=True)[source]¶

find all roots of the polynomial and plug it into jointeval. poly should be Poly

AddHalfTanValue = False¶

FeasibleIsZeros = False¶

checkValidSolution()[source]¶

checkforzeros = None¶

dictequations = None¶

end(generator)[source]¶

equationsused = None¶

generate(generator)[source]¶

getEquationsUsed()[source]¶

getPresetCheckForZeros()[source]¶

isHinge = True¶

jointeval = None¶

jointevalcos = None¶

jointevalsin = None¶

jointname = None¶

numsolutions()[source]¶

poly = None¶

postcheckfornonzeros = None¶

postcheckforrange = None¶

postcheckforzeros = None¶

score = None¶

subs(solsubs)[source]¶

thresh = 9.9999999999999995e-08¶

class AST.SolverRotation(T, jointtree)[source]¶

T = None¶

end(generator)[source]¶

functionid = 0¶

generate(generator)[source]¶

jointtree = None¶

class AST.SolverSequence(jointtrees)[source]¶

end(generator)[source]¶

generate(generator)[source]¶

jointtrees = None¶

class AST.SolverSolution(jointname, jointeval=None, jointevalcos=None, jointevalsin=None, AddPiIfNegativeEq=None, isHinge=True, thresh=9.9999999999999995e-07)[source]¶

Contains equations for evaluating one unknown variable. The variable can have multiple solutions, and the solution is only valid if every equation in checkforzeros is non-zero

AddHalfTanValue = False¶

AddPiIfNegativeEq = None¶

FeasibleIsZeros = False¶

checkValidSolution()[source]¶

checkforzeros = None¶

dictequations = None¶

end(generator)[source]¶

equationsused = None¶

Meaning of FeasibleIsZeros: If set to false, then solution is feasible only if all of these equations evalute to non-zero. If set to true, solution is feasible only if all these equations evaluate to zero.

generate(generator)[source]¶

getEquationsUsed()[source]¶

getPresetCheckForZeros()[source]¶

isHinge = True¶

jointeval = None¶

jointevalcos = None¶

jointevalsin = None¶

jointname = None¶

numsolutions()[source]¶

presetcheckforzeros = None¶

score = None¶

subs(solsubs)[source]¶

thresh = None¶

class AST.SolverStoreSolution(alljointvars, checkgreaterzero=None, isHinge=None)[source]¶

Called when all the unknowns have been solved to add a solution.

alljointvars = None¶

checkgreaterzero = None¶

end(generator)[source]¶

generate(generator)[source]¶

isHinge = None¶

offsetvalues = None¶

thresh = 0¶

class openravepy.ikfast.IKFastSolver(kinbody=None, kinematicshash='', precision=None)[source]¶

Bases: openravepy.metaclass.AutoReloader

Solves the analytical inverse kinematics equations. The symbol naming conventions are as follows:

cjX - cos joint angle constX - temporary constant used to simplify computations dummyX - dummy intermediate variables to solve for gconstX - global constant that is also used during ik generation phase htjX - half tan of joint angle jX - joint angle pX - end effector position information rX - end effector rotation information sjX - sin joint angle tconstX - second-level temporary constant tjX - tan of joint angle

exception CannotSolveError(value)[source]¶

Bases: exceptions.Exception

thrown when ikfast fails to solve a particular set of equations with the given knowns and unknowns

class IKFastSolver.DegenerateCases[source]¶

addcases(currentcases)[source]¶

addcasesconds(newconds, currentcases)[source]¶

clone()[source]¶

gethandledconds(currentcases)[source]¶

hascases(currentcases)[source]¶

static IKFastSolver.GetSolvers()[source]¶

Returns a dictionary of all the supported solvers and their official identifier names

exception IKFastSolver.IKFeasibilityError(equations, checkvars)[source]¶

Bases: exceptions.Exception

thrown when it is not possible to solve the IK due to robot not having enough degrees of freedom. For example, a robot with 5 joints does not have 6D IK

class IKFastSolver.JointAxis[source]¶

IKFastSolver.MatchSimilarFraction(num, numbersubs, matchlimit=40)[source]¶

returns None if no appropriate match found

IKFastSolver.RoundEquationTerms(eq, epsilon=None)[source]¶

IKFastSolver.RoundPolynomialTerms(peq, epsilon)[source]¶

IKFastSolver.TestIntersectingAxes(solvejointvars, Links, LinksInv, endbranchtree)[source]¶

class IKFastSolver.Variable(var)[source]¶

getsubs(value)[source]¶

IKFastSolver.addSolution(solutions, AllEquations, curvars, othersolvedvars, solsubs, endbranchtree, currentcases=None)[source]¶

Take the least complex solution of a set of solutions and resume solving

static IKFastSolver.affineInverse(affinematrix)[source]¶

static IKFastSolver.affineSimplify(T)[source]¶

IKFastSolver.buildEquationsFromPositions(T1links, T1linksinv, transvars, othersolvedvars, uselength=True, removesmallnumbers=True)[source]¶

IKFastSolver.buildEquationsFromRotation(T0links, Ree, rotvars, othersolvedvars)[source]¶

Ree is a 3x3 matrix

IKFastSolver.buildEquationsFromTwoSides(leftside, rightside, usedvars, uselength=True)[source]¶

IKFastSolver.buildRaghavanRothEquations(p0, p1, l0, l1, solvejointvars)[source]¶

IKFastSolver.buildRaghavanRothEquationsFromMatrix(T0, T1, solvejointvars)[source]¶

Builds the 14 equations using only 5 unknowns. Method explained in [Raghavan1993]. Basically take the position and one column/row so that the least number of variables are used.

[Raghavan1993]

M Raghavan and B Roth, “Inverse Kinematics of the General 6R Manipulator and related Linkages”, Journal of Mechanical Design, Volume 115, Issue 3, 1993.

IKFastSolver.checkFinalEquation(pfinal, subs=None)[source]¶

check an equation in one variable for validity

IKFastSolver.checkForDivideByZero(eq)[source]¶

returns the equations to check for zero

IKFastSolver.checkSolvability(AllEquations, checkvars, othervars)[source]¶

IKFastSolver.checkSolvabilityReal(AllEquations, checkvars, othervars)[source]¶

returns true if there are enough equations to solve for checkvars

IKFastSolver.chop(expr, precision=None)[source]¶

IKFastSolver.codeComplexity(expr)[source]¶

IKFastSolver.computeConsistentValues(jointvars, T, numsolutions=1, subs=None)[source]¶

IKFastSolver.convertRealToRational(x, precision=None)[source]¶

IKFastSolver.countVariables(expr, var)[source]¶

Counts number of terms variable appears in

static IKFastSolver.det_bareis(M, *vars, **kwargs)[source]¶

Function from sympy with a couple of improvements. Compute matrix determinant using Bareis’ fraction-free algorithm which is an extension of the well known Gaussian elimination method. This approach is best suited for dense symbolic matrices and will result in a determinant with minimal number of fractions. It means that less term rewriting is needed on resulting formulae.

TODO: Implement algorithm for sparse matrices (SFF).

Function from sympy/matrices/matrices.py

static IKFastSolver.equal(eq0, eq1)[source]¶

IKFastSolver.forwardKinematicsChain(chainlinks, chainjoints)[source]¶

The first and last matrices returned are always non-symbolic

static IKFastSolver.frontnumbers(eq)[source]¶

IKFastSolver.generateIkSolver(baselink, eelink, freeindices=None, solvefn=None)[source]¶

IKFastSolver.getCommonExpression(exprs, expr)[source]¶

static IKFastSolver.groupTerms(expr, vars, symbolgen=None)[source]¶

Separates all terms that do have var in them

static IKFastSolver.has(eqs, *sym)[source]¶

IKFastSolver.isExpressionUnique(exprs, expr)[source]¶

IKFastSolver.isHinge(axisname)[source]¶

static IKFastSolver.isValidPowers(expr)[source]¶

static IKFastSolver.isValidSolution(expr)[source]¶

return true if solution does not contain any nan or inf terms

IKFastSolver.iterateThreeIntersectingAxes(solvejointvars, Links, LinksInv)[source]¶

Search for 3 consectuive intersecting axes. If a robot has this condition, it makes a lot of IK computations simpler.

IKFastSolver.iterateThreeNonIntersectingAxes(solvejointvars, Links, LinksInv)[source]¶

check for three consecutive non-intersecting axes. if several points exist, so have to choose one that is least complex?

static IKFastSolver.matrixFromQuat(quat)[source]¶

static IKFastSolver.multiplyMatrix(Ts)[source]¶

IKFastSolver.normalizeRotation(M)[source]¶

error from openrave can be on the order of 1e-6 (especially if they are defined diagonal to some axis)

IKFastSolver.numpyMatrixToSympy(T)[source]¶

IKFastSolver.numpyVectorToSympy(v, precision=None)[source]¶

static IKFastSolver.recursiveFraction(expr)[source]¶

IKFastSolver.reduceBothSides(polyeqs)[source]¶

Reduces a set of equations in 5 unknowns to a set of equations with 3 unknowns by solving for one side with respect to another. The input is usually the output of buildRaghavanRothEquations.

IKFastSolver.reduceBothSidesInverseMatrix(leftsideeqs, rightsideeqs)[source]¶

solve a linear system inside the program since the matrix cannot be reduced so easily

IKFastSolver.reduceBothSidesSymbolically(*args, **kwargs)[source]¶

IKFastSolver.reduceBothSidesSymbolicallyDelayed(leftsideeqs, rightsideeqs, maxsymbols=10, usesymbols=True)[source]¶

the left and right side of the equations need to have different variables

static IKFastSolver.removecommonexprs(eq, returncommon=False, onlygcd=False, onlynumbers=True)[source]¶

removes common expressions from a sum. Assumes all the coefficients are rationals. For example: a*c_0 + a*c_1 + a*c_2 = 0 will return in c_0 + c_1 + c_2 = 0

static IKFastSolver.replaceNumbers(expr, symbolgen=None)[source]¶

Replaces all numbers with symbols, this is to make gcd faster when fractions get too big

static IKFastSolver.rodrigues(axis, angle)[source]¶

static IKFastSolver.rodrigues2(axis, cosangle, sinangle)[source]¶

static IKFastSolver.rotateDirection(sourcedir, targetdir)[source]¶

IKFastSolver.simplifyTransform(eq, othervars=None)[source]¶

Attemps to simplify an equation given that variables from a rotation matrix have been used. There are 12 constraints that are tested: - lengths of rows and colums are 1 - dot products of combinations of rows/columns are 0 - cross products of combinations of rows/columns yield the left over row/column

IKFastSolver.simplifyTransformPoly(peq)[source]¶

simplifies the coefficients of the polynomial with simplifyTransform and returns the new polynomial

IKFastSolver.solutionComplexity(sol, solvedvars, unsolvedvars)[source]¶

IKFastSolver.solve5DIntersectingAxes(T0links, basepos, D, solvejointvars, endbranchtree)[source]¶

IKFastSolver.solve6DIntersectingAxes(T0links, T1links, transvars, rotvars, solveRotationFirst, endbranchtree)[source]¶

Solve 6D equations using fact that 3 axes are intersecting. The 3 intersecting axes are all part of T0links and will be used to compute the rotation of the robot. The other 3 axes are part of T1links and will be used to first compute the position.

IKFastSolver.solveAllEquations(AllEquations, curvars, othersolvedvars, solsubs, endbranchtree, currentcases=None, unknownvars=None)[source]¶

IKFastSolver.solveDialytically(newreducedeqs, ileftvar, returnmatrix=False, getsubs=None)[source]¶

Return the coefficients to solve equations dialytically (Salmon 1885) leaving out variable index ileftvar.

Extract the coefficients of 1, leftvar**1, leftvar**2, ... of every equation every len(newreducedeqs)*len(monoms) coefficients specify one degree of all the equations (order of monoms is specified in exportmonomorder there should be len(newreducedeqs)*len(monoms)*maxdegree coefficients

Method also checks if the equations are linearly dependent

IKFastSolver.solveFullIK_6D(LinksRaw, jointvars, isolvejointvars, Tgripperraw=[1, 0, 0, 0]

[0, 1, 0, 0]

[0, 0, 1, 0]

[0, 0, 0, 1])

Solves the full 6D translatio + rotation IK

IKFastSolver.solveFullIK_6DGeneral(T0links, T1links, solvejointvars, endbranchtree)[source]¶

Solve 6D equations of a general kinematics structure. This method only works if there exists 3 consecutive joints in that do not always intersect!

IKFastSolver.solveFullIK_Direction3D(LinksRaw, jointvars, isolvejointvars, rawbasedir=[0]

[0]

[1])

basedir needs to be filled with a 3elemtn vector of the initial direction to control

IKFastSolver.solveFullIK_Lookat3D(LinksRaw, jointvars, isolvejointvars, rawbasedir=[0]

[0]

[1], rawbasepos=[0]

[0]

[0])

basedir,basepos needs to be filled with a direction and position of the ray to control the lookat

IKFastSolver.solveFullIK_Ray4D(LinksRaw, jointvars, isolvejointvars, rawbasedir=[0]

[0]

[1], rawbasepos=[0]

[0]

[0])

basedir,basepos needs to be filled with a direction and position of the ray to control

IKFastSolver.solveFullIK_Rotation3D(LinksRaw, jointvars, isolvejointvars, Rbaseraw=[1, 0, 0]

[0, 1, 0]

[0, 0, 1])

IKFastSolver.solveFullIK_Translation3D(LinksRaw, jointvars, isolvejointvars, rawbasepos=[0]

[0]

[0])

IKFastSolver.solveFullIK_TranslationAxisAngle4D(LinksRaw, jointvars, isolvejointvars, rawbasedir=[1]

[0]

[0], rawbasepos=[0]

[0]

[0], rawglobaldir=[0]

[0]

[1], rawnormaldir=None)

Solves 3D translation + Angle with respect to X-axis

IKFastSolver.solveFullIK_TranslationDirection5D(LinksRaw, jointvars, isolvejointvars, rawbasedir=[0]

[0]

[1], rawbasepos=[0]

[0]

[0])

Solves 3D translation + 3D direction

IKFastSolver.solveFullIK_TranslationLocalGlobal6D(LinksRaw, jointvars, isolvejointvars, Tgripperraw=[1, 0, 0, 0]

[0, 1, 0, 0]

[0, 0, 1, 0]

[0, 0, 0, 1])

IKFastSolver.solveFullIK_TranslationXY2D(LinksRaw, jointvars, isolvejointvars, rawbasepos=[0]

[0])

IKFastSolver.solveFullIK_TranslationXYOrientation3D(LinksRaw, jointvars, isolvejointvars, rawbasepos=[0]

[0], rawangle=0)

IKFastSolver.solveHighDegreeEquationsHalfAngle(lineareqs, varsym, subs=None)[source]¶

solve a set of equations in one variable with half-angle substitution

IKFastSolver.solveKohliOsvatic(rawpolyeqs, solvejointvars, endbranchtree)[source]¶

Find a 16x16 matrix where the entries are linear with respect to the tan half-angle of one of the variables [Kohli1993]. Takes in the 14 raghavan/roth equations.

[Kohli1993]

Dilip Kohli and M. Osvatic, “Inverse Kinematics of General 6R and 5R,P Serial Manipulators”, Journal of Mechanical Design, Volume 115, Issue 4, Dec 1993.

IKFastSolver.solveLiWoernleHiller(rawpolyeqs, solvejointvars, endbranchtree)[source]¶

Li-Woernle-Hiller procedure covered in Jorge Angeles, “Fundamentals of Robotics Mechanical Systems”, Springer, 2007.

IKFastSolver.solveManochaCanny(rawpolyeqs, solvejointvars, endbranchtree)[source]¶

Solves the IK equations using eigenvalues/eigenvectors of a 12x12 quadratic eigenvalue problem. Method explained in

Dinesh Manocha and J.F. Canny. “Efficient inverse kinematics for general 6R manipulators”, IEEE Transactions on Robotics and Automation, Volume 10, Issue 5, Oct 1994.

IKFastSolver.solvePairVariables(raweqns, var0, var1, othersolvedvars, maxcomplexity=50, unknownvars=None)[source]¶

IKFastSolver.solvePairVariablesHalfAngle(raweqns, var0, var1, othersolvedvars, subs=None)[source]¶

solves equations of two variables in sin and cos

IKFastSolver.solveSingleVariable(raweqns, var, othersolvedvars, maxsolutions=4, maxdegree=2, subs=None, unknownvars=None)[source]¶

IKFastSolver.solveSingleVariableLinearly(raweqns, solvevar, othervars, maxnumeqs=2, douniquecheck=True)[source]¶

tries to linearly solve for one variable treating everything else as constant.

need at least 3 equations

IKFastSolver.solveVariablesLinearly(polyeqs, othersolvedvars, maxsolvabledegree=4)[source]¶

IKFastSolver.sortComplexity(exprs)[source]¶

static IKFastSolver.tolatex(e)[source]¶

IKFastSolver.trigsimp(eq, trigvars)[source]¶

IKFastSolver.verifyAllEquations(AllEquations, unsolvedvars, solsubs, tree=None)[source]¶

IKFastSolver.writeIkSolver(chaintree, lang=None)[source]¶

write the ast into a specific langauge, prioritize c++

openravepy.ikfast.Pow_eval_subs(self, old, new)[source]¶

class openravepy.ikfast.atan2check[source]¶

Bases: sympy.functions.elementary.trigonometric.atan2

defines floating-point mod

default_assumptions = {'real': True, 'imaginary': False, 'complex': True, 'commutative': True}¶

is_Function = True¶

is_commutative = True¶

is_complex = True¶

is_imaginary = False¶

is_real = True¶

nargs = 2¶

openravepy.ikfast.axisAngleFromRotationMatrix((planningutils)rotation) → object :¶

RaveVector < T > axisAngleFromMatrix(const RaveTransformMatrix < T > & rotation)

Converts the rotation of a matrix into axis-angle representation.

Parameters

rotation -

3x3 rotation matrix

class openravepy.ikfast.fmod[source]¶

Bases: sympy.core.function.Function

defines floating-point mod

default_assumptions = {'real': True, 'imaginary': False, 'complex': True, 'commutative': True}¶

is_Function = True¶

is_commutative = True¶

is_complex = True¶

is_imaginary = False¶

is_real = True¶

nargs = 2¶