### Klamp't Tutorial: Inverse Kinematics

In this tutorial you will learn how to set up and solve inverse kinematics (IK) problems in software. (Klamp't apps automatically support IK constraints while interacting with the robot poser, so using them should be relatively transparent.)

Klamp't natively supports numerical IK only, which uses numerical root-finding techniques to iteratively move an initial configuration toward solving the IK constraints. Another approach is analytic IK, which analytically inverts an IK problem by solving a system of symbolic equations. Numerical IK is more versatile in that any robot, any number of objectives, and any degrees of freedom can be solved simultaneously in a unified framework, and difficulties handling zero or multiple solutions are avoided. However, it is slower than analytic IK (milliseconds rather than microseconds) and requires appropriately chosen initial configurations to avoid local minima. Nevertheless, we prefer it due to its generality and versatility in handling complex contact formations, its convenient use in planning and optimization, and its comparatively simple API.

Difficulty: intermediate

Time: 15-30 minutes

This tutorial assumes you have already completed the C++ simulation tutorial and know how to compile a new project that includes Klamp't.

An IK problem is specified as an array of IKGoal structures, which define a constraint for the robot in Cartesian space. Given a problem, you will then run a solver to hopefully find a constraint-solving configuration. This functionality is in the IK.h and IKFunctions.h files in the KrisLibrary/robotics package, and it would be helpful to keep them open for reference during this tutorial.

### Fixed point constraints

We'll start our example with a simple fixed-base robot and an end-effector point constraint.

#include <robotics/IK.h> #include <robotics/IKFunctions.h> #include <Modeling/World.h> int main(int argc,char** argv) { //load a robot (you may want to edit this path as needed) Robot robot; if(!robot.Load("Klampt/data/robots/tx90ball.rob")) { printf("Error loading robot file\n"); return 1; } //some parameters of the inverse kinematics problem int endEffectorLink = robot.links.size()-1; Vector3 localPosition(0,0,0); Vector3 endPosition(1.1,0,0.7); //set up the IK problem corresponding to the parameters IKGoal goal; goal.link = endEffectorLink; goal.localPosition = localPosition; goal.SetFixedPosition(endPosition); //print the error of the robot's initial configuration Vector3 wp; robot.GetWorldPosition(localPosition,endEffectorLink,wp); printf("Initial position: %g %g %g\n",wp.x,wp.y,wp.z); printf("Initial error: %g\n",RobotIKError(robot,goal)); //we'll put more lines here later return 0; }

Compile and run the program, and after some setup code you should get a printout like:

The error value gives the maximum absolute error of the initial end effector position and the desired end effector position. The IK solver will try to drive this to zero.

Now let's add the following lines to the program:

Real tolerance = 1e-3; int iters = 100; int verbose = 1; vector<IKGoal> problem; problem.push_back(goal); bool res = SolveIK(robot,problem,tolerance,iters,verbose); if(!res) { printf("Failed solving IK problem\n"); } else { printf("Success solving IK problem, %d iterations used\n",iters); } cout<<"Final configuration: "<<robot.q<<endl; robot.GetWorldPosition(localPosition,endEffectorLink,wp); printf("Final position: %g %g %g\n",wp.x,wp.y,wp.z); printf("Final error: %g\n",RobotIKError(robot,goal));

If you compile again, you'll get some printouts giving the progress of the solver and the Newton-Raphson root finder.

The Final configuration item gives you the robot's configuration that meets the constraints. If you copy this line, starting with the 7, to a file with the .config extension, say "ik.config" it can be loaded into the RobotPose app to visually examine the result:

Let's now return to your program source code. You can play with the parameters tolerance, iters, and verbose, which control the behavior of the solver. The tolerance parameter defines how closely the constraint must be met before termination, and you can try setting this to a smaller value, say 1e-6. The iterations parameter defines the maximum number of iterations used before the solver quits with failure, and you can try setting this to something like 5. You can also try setting verbose=0 so that no output is generated inside the solver.

### Fixed rotation constraints

Another common constraint is a fixed rotation. To specify these constraints you must provide a desired orientation of the link as a 3x3 matrix. Specifically, you must provide an object of the Matrix3 class that specifies the rotation that brings the link's local coordinate system to the desired orientation.

We'll start with a simple example that tries to keep the end effector link in the identity orientation. Replace the IKGoal setup lines with the following lines:

//some parameters of the inverse kinematics problem int endEffectorLink = robot.links.size()-1; Vector3 localPosition(0,0,0); Vector3 endPosition(1.1,0,0.7); Matrix3 endRotation; endRotation.setIdentity(); //set up the IK problem corresponding to the parameters IKGoal goal; goal.link = endEffectorLink; goal.localPosition = localPosition; goal.SetFixedPosition(endPosition); goal.SetFixedRotation(endRotation);

If you recompile and run, you'll see output like the following:

It looks like the robot is unable to satisfy the constraint! If we inspect the configuration using RobotPose:

we see that the ball at the end of the robot's arm is upright, which is what the orientation constraint is trying to achieve. However, it looks like the target position is just a tad out of the robot's reach.

Now if we change the endPosition variable to be (1.0,0,0.7) and re-run the program, you'll see that the IK solver is successful. We'll talk a bit about this in the next section

*Aside:*If you do not express orientation constraints in 3x3 matrix form, then you'll be happy to know that Klamp't has robust routines for converting all major rotation representations to and from 3x3 matrices. The file KrisLibrary/math3d/rotation.h contains definitions for Euler angle, quaternions, axis-angle, and moment (a.k.a. exponential map) representations. Each of these classes can be converted quickly to and from 3x3 matrices using the getMatrix and setMatrix methods.

### Failures and global optimization

Let's discuss a few possible outcomes for the IK solver. We've already seen the best outcome, which is *success*. We've also seen the possibility of *correct failure*, which occurs if the robot cannot reach the desired IK constraint. The final possibility is *incorrect failure*, which is caused mostly by local minima in the configuration space, and occasionally by allocating too few iterations to achieve the desired tolerance. In this latter case, you will see the constraint violation error reach a low -- but perhaps not-low-enough -- value. But distinguishing between true failure and local minima is fairly challenging.

If you have reason to believe that the solver is encountering local minima, the most effective approach is to try to restart from another configuration. This is known as a *random restart* technique, which tends to be fairly effective because the basin of attraction of the IK constraint (in other words, the set of start points that converge successfully) is usually ``reasonably'' large, so that the probability of sampling at random a start configuration in it is non-negligible. The pseudocode will look like this:

robot.q = start configuration IKSolve(robot,problem) iters = 0 while (IKError(robot,problem) > threshold and iters < maxIterations) robot.q = random configuration IKSolve(robot,problem) iters = iters+1

The drawback of such a technique is that it will need to call the IK solver maxIterations times for true failure cases, which could be computationally expensive.

### Setting up IK constraints using point sets

Another convenient way to set up IK constraints, particularly for robots with contact, is to use the IKGoal.SetFromPoints method. Rather than explicitly specifying the type of constraint, you specify a list of points on the robot link that you want to constrain to a list of points in the world. This will automatically detect whether you want a point-to-point, edge-to-edge, or face-to-face constraint.

Try replacing the goal setup lines with the following:

goal.link = endEffectorLink; vector<Vector3> localpts(2),worldpts(2); localpts[0] = localPosition; localpts[1] = localPosition + Vector3(0.1,0,0); worldpts[0] = endPosition; worldpts[1] = endPosition + Vector3(0,0,-0.1); goal.SetFromPoints(localpts,worldpts);

This will be similar to the original point constraint, except that it will try to match a vector (0.1,0,0) sticking out of the local x-axis of the link to be oriented downward in the world frame (0,0,-0.1).

An important note is that the order of points matters, because localpos[0] will be matched to worldpos[0], localpos[1] will be matched to worldpos[1], etc.

### More...

This just scratches the surface of what you can do with IK constraints. You can constrain a link to another link using the "target" index, set up sliding constraints, and axial rotation constraints. You can also constrain the robot's center of mass to lie at or above a certain point. For help with these items please consult the API documentation for IKGoal and RobotIKFunction.

For the Python tutorial, we will start from Exercise 2 in Klampt/Python/exercises/ik. Open up ik.pdf in this folder, and read the instructions. Then run

to observe the target point animating in a circle. In this tutorial we'll implement the few lines it takes to implement the IK solver.

The end effector link index, local position, and target position in the world are given to you in this function. Your job is to simply consult the documentation to set up the structures needed to call the IK solver. Look through ex2.py to find the place where your code needs to go.

obj = model.ik.objective(robotlink,local=localpos,world=worldpos)

Now we need to 1) set up the solver with the robot and objectives, 2) set the initial configuration to 0 by calling robot.setConfig, and then 3) calling the solver:

s = model.ik.solver(obj) robotlink.robot().setConfig([0]*robotlink.robot().numLinks()) s.setMaxIters(100) s.setTolerance(1e-3) res = s.solve() numIter = s.lastSolveIters() if not res: print "IK failure!"

If res=True, then the robot's configuration is now set to the IK solution. If res=False, then the robot's configuration is set to the best found configuration

Alternatively, we could have used a convenience function in klampt.model.ik:

res = model.ik.solve(obj) if not res: print "IK failure!"

However, note that this will only give you the solution to the IK problem. It will not allow you to later interact directly with the solver. For example, this would mean that you would be unable to access the number of iterations used to obtain an IKSolution. Either way, though, it's pretty simple! Now replace the current return statement with:

return robot.getConfig()

Then run ex2.py and observe the results. You can also play around with the parameters and the start configuration. For example, commenting out the setConfig line uses the robot's previous configuration as the starting point of the optimization. When does this improve the results? When does this harm them?

The klampt.model.ik module makes it similarly easy to set up fixed position and orientation constraints (klampt.model.ik.objective(robotlink,R=link_orientation,t=link_translation) and fixed point lists (klampt.model.ik.objective(robotlink,local=[p1,p2],world=[q1,q2]). See the API documentation for more details.

*Note: The Python API is slightly less powerful than the C++ API because it does not currently support sliding constraints without fixed positions. Support for those items is planned for the near future.*

### Why isn't IK working?

A common cause of IK failures is local minima. Klamp't uses a numerical IK solver that iteratively minimizes the error between the current link transform and the goal. It also enforces joint limits. But this iteration can get stuck, most likely due to the joint limits interfering with progress toward the objective. The easiest partial solution for this is to just perform random restarts on the start configuration:

s = model.ik.solver(obj) numRestarts = 100 solved = False for i in xrange(numRestarts): s.sampleInitial() s.setMaxIters(100) s.setTolerance(1e-3) res = s.solve() if res: solved=True break if not solved: print "IK failure!"

Additionally, Klamp't has a convenience routine klampt.model.ik.solve_global that implements this same functionality in a single line.

if not model.ik.solve_global(obj,iters = 100,tol=1e-3,numRestarts=100): print "IK failure!"

For feasible objectives, this is likely to come up with a solution in just a few iterations, and not be much more expensive than a single IK solve. But, the increased robustness comes at a price: in the case of infeasible objective, this can take much longer than the standard solver to fail (correctly). By tuning the numRestarts parameter you can trade off between robustness and running time in the case of infeasible objective.

The second likely cause of failures is an incorrectly defined IK objective. The easiest way to debug this is to check the final configuration produced by the IK module. The IK solver does the best it can to satisfy your goal. If it doesn't appear to be doing what you want, then this is probably an error in defining the objective. Another way is to examine the residual vector, which gives the numerical errors on each of the constrained IK dimensions. To do so, call ik.residual(obj). At a solution, these entries should all be near zero.

Klamp't also has visualization functionality to display IK objectives. Simply call visualization.add(name,objective) (you will also want to add the world) and your constraint will be drawn on screen.