ARM tutorial 1

ARM 170浏览

Arm Tutorial 1

KUKA is firmly committed to PC-based controllers – a standard well-known throughout the world which needs no additional explanation. A decisive advantage, particularly for customers operating at a global level.

Arm Tutorial 1 project build order

  • 1. ArticulatedArm (in abstract services)
    2. Util
    3. SimulatedLBR3Arm
    4. KUKATutorial1MotionPlanning
    5. KUKATutorial1Dashboard
    6. KUKAArmTutorialSimulation

Moving the end of arm (EOA) from point to point

To move a tool from position A to position B using a six axis robot, you have to tell each axis of the robot which positions they should assume so that the end of arm reaches the desired position and orientation.

Position A:

Position B:

Axis specific programming:

One way to tell the robot its destination is to give it a target value for each axis.

To get to the target position the controller needs to calculate the required movements for each axis. Unless specified otherwise by the operator, the arm control takes the current axis values and calculates the shortest distances to the desired axis values
to avoid large and long movements.

Movement of one axis:

To reach the target value, the drive for an axis needs to accelerate to a certain velocity, and to decelerate in time before it reaches the target. In order to plan these times correctly you need to calculate a so called velocity-profile for the axis. The
following picture shows this profile for one axis – the upper curve shows the acceleration input for the drive, the lower picture shows the resulting velocity (LINK See the mathematical background here)


Green area: acceleration phase
Yellow area: constant velocity phase
Red area: deceleration area

The velocity profile is used to send precise axis values at predetermined time intervals to the drive. The time interval must be well adapted to the target drive. In the MSRS simulation environment, since the drives are modeled as springs, we need to find a
good interval to hide the spring nature of the drives at reasonable motion speeds. We found that we come to a nice robotic motion when using 10ms as the interval length.

Movement of multiple axis:

In order to reach the EOA target position, usually multiple axis have to move. A velocity profile has to be calculated for every axis. For the overall motion, those profiles can be coordinated in three different ways:

For the exact mathematical description of the motion calculation, please visit the MATH CORNER

Asynchronous PTP motion:

In an asynchronous PTP motion, each drive moves as fast as possible to reach the desired angle. In this case, some axis will reach their target value before others. In order to reach the final position and orientation, each axis has to have arrived at its
final value. The velocity profiles of two axis could look like the following:



In this picture, the maximum velocities are shown at different levels for the two axis, since in the real world the different drives do have different maximum velocities and acceleration capabilities.


Synchronous PTP motion:

Since the final position of the EOA is not reached before each axis has reached the target angle, one axis will need the most driving time. This axis is called the leading axis. To minimize abrasion of the drives, all drives except the one for the leading
axis should drive on a slower than maximum speed. So the time that is needed to reach the destination position is synchronized. The velocity profiles for the slower moving axis are recalculated, so that the times for arriving at the end positions match:



Full synchronous PTP motion:

Abrasion of drives is even more prevented if not only the time to reach the destination is synchronized, but also the times for acceleration and deceleration are synchronized. This is called a fully synchronized PTP motion.



Coding for Tutorial 1:

In the robotics field, calculating these profiles is called motion planning. Therefore we created a service called ArmTutorial1MotionPlanning. The ‘1’ indicates that we have different versions of the motion planning service throughout the tutorials. This
has been done for clarity reasons, to only include the necessary code for the corresponding tutorial.

The following figure shows the orchestration of the main services in ArmTutorial1:

  • ArmTutorial1Dashboard: User Interface
  • ArmTutorial1MotionPlanning: Calculates and executes the motion
  • SimulatedLBR3: Service for the simulated LBR arm
  • ArticulatedArm: Abstract Base Class for SimulatedLBR3
  • KUKAArmTutorialSimulation: Startproject of the ArmTutorial1 Solution

This tutorial executes through the following steps:

1)     The dashboard accepts target angle values and sends those through a PTP motion command to the motion planning service.

2)     The motion planning service calculates the required times and intermediate positions for all axis and sends those values to the Simulated LBR3


The following passages show how the motion planning service calculates the different PTP types:

Asynchronous movement (method asynchronousPTP)

The waypoint calculations for an axis
have no dependencies to all other axes and base on the given values
, and


Step 1:

First we determine the maximum amplitude for the velocity ramp. We have to check whether the distance
is sufficient to let the velocity grow up to
or not. If not, we run into the velocity triangle situation (Fig. 3) and must limit
down to
[8]. Therefore we evaluate [9]:

Step 2:

Next we compute the acceleration duration , the deceleration start time
and the total motion time
. We get the acceleration length
through equation [1]. Equation [5] returns the total motion time
and the deceleration start time
can be calculated via [2]:

Step 3:

Now we determine the count of waypoints. The acceleration phase length and the entire motion process time
are divided into time slices with a period time

Step 4

Finally we compute all waypoints via [12]:


Synchronous PTP movement (method synchronousPTP)

In general the calculation for the synchronous PTP movement happen to be the same as for the asynchronous PTP movement except that the several velocities
must be chosen in that way that all total motion durations coincide to


Step 1:

First we look for the total motion time . Like in the asynchronous PTP movement we compute the total movement times
of all axes:


The longest total motion time becomes :


Step 2:

Next we calculate the velocities . Each axis must finish its total motion exactly at


We solve the quadratic equation for . From the two possible results the constraint
annuls the larger one:

Step 3:

Since we have already the total travel time we just have to calculate the acceleration duration
and the deceleration start time
. Like in the asynchronous PTP movement we get the
through the equations [1] and [2]:


Step 4:

For the calculation of the time slices and waypoints refer to the asynchronous PTP movement description steps 3 and 4.


Fully synchronous PTP movement (method fullySynchronousPTP)

In addition to the synchronous PTP movement, in the fully synchronous PTP movement we must also synchronize the acceleration time lengths
and the deceleration start times
for all axes.


Step 1:

Like in the synchronous PTP movement description step 1 we compute . In the same way we also compute



Step 2:

The acceleration time lengths , deceleration stop times
and total motion times
must be synchronized:

Therefore the maximum velocity and acceleration are computed individually for each axis:


Step 3:

For the calculation of the time slices and waypoints refer again to the asynchronous PTP movement description steps 3 and 4.


Math Corner

General ramp PTP movement

The point to point (PTP) ramp movement consists of three phases, acceleration, constant velocity and deceleration. The acceleration phase starts at
and ends at
, the constant velocity phase reaches up to
and the deceleration phase ends at.


In the physics the radial acceleration is the derivation of the radial velocity
means that the velocity equals to the area enclosed by the acceleration trajectory and the time axis. Analogous the radial velocity
is the derivation of the radial angle
. Vice versa one can write.

E.g.: Having a constant acceleration the velocitygrows with the time
(assuming zero velocity at


Within the acceleration phase the velocity increases from zero to , remains changeless in the constant velocity phase and declines in the deceleration phase back down
to zero. At as well at
of the total motion process there velocity is zero. Because the absolute value of the velocities' gain rate
is the same as the absolute value of the declining rate
the durations for both acceleration and deceleration conform (Fig. 1).


Fig.1: Relation velocity ramp and acceleration


Presumed a constant acceleration , the velocity reaches its maximum level
at the acceleration phase length


As mentioned the acceleration time length and the deceleration time length are the same, therefore the deceleration phase starts at:


Fig.2: Relation velocity ramp and distance


The proceeded distance equals to the area enclosed by the velocity ramp and the abscissa (Fig. 2, hatched area):


Because of the symmetry we state:


Isolating [4] for the total movement duration results in:


Now we know all parameters to compute the velocity for any point of time:



At last we have to consider the case where the distance isn't sufficient to let the velocity grow up to its target level
. Then the velocity ramp becomes a triangle (Fig. 3). The acceleration phase length is now half of the total motion duration. The side condition
applies now to the distance equation [6] and [4]. Therefore we substitute
in [4]. As a result we get the equation that relates the distance to the velocity peak level:


Fig. 3: Velocity triangle


Substituting into [7] and solving it for
leads to:


The triangle case has to be considered when using [6]; for that reason we have to limit the given velocity
when it exceeds


Time discretization

To enforce that the motion adheres to the velocity ramp trajectory the motion planning service must send continuously command positions to the simulated lbr3 arm service in small time intervals
(sample rate period time). Hence the total PTP movement is divided into
waypoints matching discrete points of time. We get the time discrete distance function
through substituting with
in [6] (Fig. 2):


The counts of discrete time steps ,
multiplied with the period time
must match to


Hence the time discrete waypoints can be calculated as follows:



However, in practice ,
usually won't match exactly an integer multiple of
. To avoid inaccuracies some corrections have to be made for
. After an adjustment of
to satisfy [11] the velocity
and the acceleration
have to be computed again via
and. The implementation of these adjustments is left for the user as an exercise.


General approach to the distance equation:

The radial distance can be calculated through the integration
. Function describes the velocity and
the acceleration trajectory. Let's begin with the acceleration function:


The first integration results into the velocity function:


The constant takes any prior velocity into account. The second integration results into the distance equation, where the constants
take any prior velocity and position into account:


Now we introduce our side conditions. In our application acceleration and deceleration have the same absolute values, therefore we state:


We focus on relative movements starting with zero velocity:


We assume that the velocity zeros again at :


Taking the side condition [16], [17] and [18] in [14] into account we get:


Therefore the velocity equation [14] can be stated as:


Evaluating the velocity function [20] for the time results in:


Side conditions [16] and [17] and equation [19] turn [15] into:


Finally we simplify the distance equation [22] by using [19] and [21]:





: = Acceleration time length

: = Acceleration time length interim value

: = Acceleration time length all axes' maximum value

: = Deceleration start time

: = Deceleration start time interim value

: = All axes' maximum value of the deceleration start time

: = Movement end time

: = Movement end time interim value

: = All axes' maximum value of the total movement time

: = Maximum acceleration

: = Predetermined acceleration maximum

: = Velocity ramp maximum

: = Predetermined velocity ramp maximum

: = Velocity ramp maximum interim value

: = Predetermined distance to move

: = Sample rate period time

: = Count of axes

: = Time discrete step indexer

: = Time discrete position