# Plan and Execute Collision-Free Trajectories using KINOVA Gen3 Manipulator

This example shows how to plan closed-loop collision-free robot trajectories from an initial to a desired end-effector pose using nonlinear model predictive control. The resulting trajectories are executed using a low-fidelity robot simulation model and computed torque control. Obstacles can be static or dynamic, and can be either set as primitives (spheres, cylinders, boxes) or as custom meshes.

### Robot Description and Poses

Load the KINOVA Gen3 rigid body tree (RBT) model.

Get the number of joints.

numJoints = numel(homeConfiguration(robot));

Specify the robot frame where the end-effector is attached.

Specify initial and desired end-effector poses. Use inverse kinematics to solve for the initial robot configuration given a desired pose.

% Initial end-effector pose
taskInit = trvec2tform([[0.4 0 0.2]])*axang2tform([0 1 0 pi]);

% Compute current robot joint configuration using inverse kinematics
ik = inverseKinematics('RigidBodyTree', robot);
ik.SolverParameters.AllowRandomRestart = false;
weights = [1 1 1 1 1 1];
currentRobotJConfig = ik(endEffector, taskInit, weights, robot.homeConfiguration);
currentRobotJConfig = wrapToPi(currentRobotJConfig);

% Final (desired) end-effector pose
taskFinal = trvec2tform([0.35 0.55 0.35])*axang2tform([0 1 0 pi]);
poseFinal = [taskFinal(1:3,4);anglesFinal']; % 6x1 vector for final pose: [x, y, z, phi, theta, psi]

### Collision Meshes and Obstacles

Initialize a helper function that uses checkCollision to check for collisions between the robot bodies and the collision world. Setting the ExhaustiveChecking property to true enables collision checking for all bodies.

collisionHelper = helperManipCollsionsKINOVA(robot);
collisionHelper.ExhaustiveChecking = true;

To check for and avoid collisions during control, you must setup a collision world as a set of collision objects. This example uses collisionSphere objects as obstacles to avoid. Change the following boolean to plan using static instead of moving obstacles.

isMovingObst = true;

The obstacle sizes and locations are initialized in the following helper function. To add more static obstacles, add collision objects in the world array.

helperCreateObstaclesKINOVA;

Visualize the robot at the initial configuration. You should see the obstacles in the environment as well.

x0 = [currentRobotJConfig', zeros(1,numJoints)];
helperInitialVisualizerKINOVA;

Specify a safety distance away from the obstacles. This value is used in the inequality constraint function of the nonlinear MPC controller.

safetyDistance = 0.01;

### Design Nonlinear Model Predictive Controller

You can design the nonlinear model predictive controller using the following helper file, which creates an nlmpc controller object. To views the file, type edit helperDesignNLMPCobjKINOVA.

helperDesignNLMPCobjKINOVA;

The controller is designed based on the following analysis. The maximum number of iterations for the optimization solver is set to 5. The lower and upper bounds for the joint position and velocities (states), and accelerations (control inputs) are set explicitly.

• The robot joints model is described by double integrators. The states of the model are $x=\left[q,\underset{}{\overset{˙}{q}}\right]$, where the 7 joint positions are denoted by $\mathit{q}$ and their velocities are denoted by $\underset{}{\overset{˙}{q}}$. The inputs of the model are the joint accelerations $u=\underset{}{\overset{¨}{q}}$. The dynamics of the model are given by

$\stackrel{˙}{\mathit{x}}=\left[\begin{array}{cc}0& {\mathit{I}}_{7}\\ 0& 0\end{array}\right]\mathit{x}+\left[\begin{array}{c}0\\ {\mathit{I}}_{7}\end{array}\right]\mathit{u}$

where ${\mathit{I}}_{7}$ denotes the $7×7$ identity matrix. The output of the model is defined as

$\mathit{y}=\left[\begin{array}{cc}{\mathit{I}}_{7}& 0\end{array}\right]\mathit{x}$.

Therefore, the nonlinear model predictive controller (nlobj) has 14 states, 7 outputs, and 7 inputs.

• The cost function for nlobj is a custom nonlinear cost function, which is defined in a manner similar to a quadratic tracking cost plus a terminal cost.

$\mathit{J}={\int }_{0}^{\mathit{T}}{\left({\mathit{p}}_{\mathrm{ref}}-\mathit{p}\left(\mathit{q}\left(\mathit{t}\right)\right)\right)}^{\prime }{\mathit{Q}}_{\mathit{r}}\left({\mathit{p}}_{\mathrm{ref}}-\mathit{p}\left(\mathit{q}\left(\mathit{t}\right)\right)\right)+{\mathit{u}}^{\prime }\left(\mathit{t}\right){\mathit{Q}}_{\mathit{u}}\mathit{u}\left(\mathit{t}\right)\text{\hspace{0.17em}}\mathrm{dt}+{\left({\mathit{p}}_{\mathrm{ref}}-\mathit{p}\left(\mathit{q}\left(\mathit{T}\right)\right)\right)}^{\prime }{\mathit{Q}}_{\mathit{t}}\left({\mathit{p}}_{\mathrm{ref}}-\mathit{p}\left(\mathit{q}\left(\mathit{T}\right)\right)\right)+{\stackrel{˙}{\mathit{q}}}^{\prime }\left(\mathit{T}\right){\mathit{Q}}_{\mathit{v}}\stackrel{˙}{\mathit{q}}\left(\mathit{T}\right)$

Here, $\mathit{p}\left(\mathit{q}\left(\mathit{t}\right)\right)$ transforms the joint positions $\mathit{q}\left(\mathit{t}\right)$ to the frame of end effector using forward kinematics and getTransform, and ${\mathit{p}}_{\mathrm{ref}}$ denotes the desired end-effector pose.

The matrices ${\mathit{Q}}_{\mathit{r}}$, ${\mathit{Q}}_{\mathit{u}}$, ${\mathit{Q}}_{\mathit{t}}$, and ${\mathit{Q}}_{\mathit{v}}$ are constant weight matrices.

• To avoid collisions, the controller has to satisfy the following inequality constraints.

${\mathit{d}}_{\mathit{i},\mathit{j}}\ge {\mathit{d}}_{\mathrm{safe}}$

Here, ${\mathit{d}}_{\mathit{i},\mathit{j}}$ denotes the distance from the $\mathit{i}$-th robot body to the $\mathit{j}$-th obstacle, computed using checkCollision.

In this example, $\mathit{i}$ belongs to $\left\{1,2,3,4,5,6\right\}$ (the base and end-effector robot bodies are excluded), and $\mathit{j}$ belongs to $\left\{1,2\right\}$ (2 obstacles are used).

The Jacobians of the state function, output function, cost function, and inequality constraints are all provided for the prediction model to improve the simulation efficiency. To calculate the inequality constraint Jacobian, use the geometricJacobian function and the Jacobian approximation in [1].

### Closed-Loop Trajectory Planning

Simulate the robot for a maximum of 50 steps with correct initial conditions.

maxIters = 50;
u0 = zeros(1,numJoints);
mv = u0;
time = 0;
goalReached = false;

Initialize the data array for control.

positions = zeros(numJoints,maxIters);
positions(:,1) = x0(1:numJoints)';

velocities = zeros(numJoints,maxIters);
velocities(:,1) = x0(numJoints+1:end)';

accelerations = zeros(numJoints,maxIters);
accelerations(:,1) = u0';

timestamp = zeros(1,maxIters);
timestamp(:,1) = time;

Use the nlmpcmove function for closed-loop trajectory generation. Specify the trajectory generation options using an nlmpcmoveopt object. Each iteration calculates the position, velocity, and acceleration of the joints to avoid obstacles as they move towards the goal. The helperCheckGoalReachedKINOVA script checks if the robot has reached the goal. The helperUpdateMovingObstacles script moves the obstacle locations based on the time step.

options = nlmpcmoveopt;
for timestep=1:maxIters
disp(['Calculating control at timestep ', num2str(timestep)]);
% Optimize next trajectory point
[mv,options,info] = nlmpcmove(nlobj,x0,mv,[],[], options);
if info.ExitFlag < 0
disp('Failed to compute a feasible trajectory. Aborting...')
break;
end
% Update states and time for next iteration
x0 = info.Xopt(2,:);
time = time + nlobj.Ts;
% Store trajectory points
positions(:,timestep+1) = x0(1:numJoints)';
velocities(:,timestep+1) = x0(numJoints+1:end)';
accelerations(:,timestep+1) = info.MVopt(2,:)';
timestamp(timestep+1) = time;
% Check if goal is achieved
helperCheckGoalReachedKINOVA;
if goalReached
break;
end
% Update obstacle pose if it is moving
if isMovingObst
helperUpdateMovingObstaclesKINOVA;
end
end
Calculating control at timestep 1
Slack variable unused or zero-weighted in your custom cost function. All constraints will be hard.
Calculating control at timestep 2
Slack variable unused or zero-weighted in your custom cost function. All constraints will be hard.
Calculating control at timestep 3
Slack variable unused or zero-weighted in your custom cost function. All constraints will be hard.
Calculating control at timestep 4
Slack variable unused or zero-weighted in your custom cost function. All constraints will be hard.
Calculating control at timestep 5
Slack variable unused or zero-weighted in your custom cost function. All constraints will be hard.
Calculating control at timestep 6
Slack variable unused or zero-weighted in your custom cost function. All constraints will be hard.
Calculating control at timestep 7
Slack variable unused or zero-weighted in your custom cost function. All constraints will be hard.
Calculating control at timestep 8
Slack variable unused or zero-weighted in your custom cost function. All constraints will be hard.
Target configuration reached.

### Execute Planned Trajectory using Low-Fidelity Robot Control and Simulation

Trim the trajectory vectors based on the time steps calculated from the plan.

tFinal = timestep+1;
positions = positions(:,1:tFinal);
velocities = velocities(:,1:tFinal);
accelerations = accelerations(:,1:tFinal);
timestamp = timestamp(:,1:tFinal);

visTimeStep = 0.2;

Use a jointSpaceMotionModel to track the trajectory with computed-torque control. The helperTimeBasedStateInputsKINOVA function generates the derivative inputs for the ode15s function for modelling the computed robot trajectory.

motionModel = jointSpaceMotionModel('RigidBodyTree', robot);

% Control robot to target trajectory points in simulation using low-fidelity model
initState = [positions(:,1);velocities(:,1)];
targetStates = [positions;velocities;accelerations]';
[t,robotStates] = ode15s(@(t,state) helperTimeBasedStateInputsKINOVA(motionModel, timestamp, targetStates, t, state), [timestamp(1):visTimeStep:timestamp(end)], initState);

Visualize the robot motion.

helperFinalVisualizerKINOVA;

[1] Schulman, J., et al. "Motion planning with sequential convex optimization and convex collision checking." The International Journal of Robotics Research 33.9 (2014): 1251-1270.