Next Article in Journal / Special Issue
Design of Multiple Wearable Robotic Extra Fingers for Human Hand Augmentation
Previous Article in Journal / Special Issue
Human–Robot Collaboration in Manufacturing Applications: A Review

Robotics 2019, 8(4), 101; https://doi.org/10.3390/robotics8040101

Article
Trajectory Optimization of a Redundant Serial Robot Using Cartesian via Points and Kinematic Decoupling
by Matteo Bottin * and Giulio Rosati *
Author to whom correspondence should be addressed.
Received: 1 October 2019 / Accepted: 2 December 2019 / Published: 9 December 2019

## Abstract

:
Moving from a given position to another with an industrial robot can be a challenging problem when the task is redundant around the tool axis. In this case, there are infinite ways of choosing both the starting and the ending configurations, so that the movement between the given points is not uniquely defined. In this paper, an algorithm that calculates the suboptimal movement between two positions is proposed, which automatically generates a cloud of safe via points around the workpiece and then by exploiting such points finds the suboptimal safe path between the two positions that minimizes movement time. The proposed method, in which the search of the suboptimal path is based on graph theory and the Dijkstra algorithm, can iteratively evaluate a high number of starting and ending configurations in low computational time, allowing performing a reasonably wide search of the suboptimal path within the infinite possible motions between the given points.
Keywords:
robot motion; redundancy; trajectory optimization; Dijkstra algorithm; graph

## 1. Introduction

To increase the productivity of an industrial robotic workcell, the cycle time has to be reduced. Sometimes, the time needed to perform the tasks is fixed, so it is necessary to reduce the robot movement times between the positions. This can be achieved by defining the best control strategy for the robot’s motors and, if possible, by finding the optimal path that reduces movement time. However, the optimization of motor control is already implemented in the controllers of common industrial robots, so the only available option is to define an optimal path that the robot has to follow.
For example, in robotic deburring, the task time is fixed by the process, so it is not possible to reduce it. However, it is possible to perform the same task with different robot configurations by rotating around the spindle axis. Therefore, the movement time between working points can be modified by changing the spindle angles in such points, and as a result, the cycle time will vary. In such a case, we say the robot is functionally redundant, and this can lead to cycle times that can be very far from the optimal one if wrongly defined by an inexperienced human operator.
In addition, the movement between two working positions has to be completed without colliding with the workcell environment. The workpiece is not the only obstacle inside the workspace since there can be structures, equipment, conveyors, and barriers that must not be touched by the robot. To do so, in a generic movement, the robot can move through several via points between the starting and the ending points. For a given layout of the workcell and a given couple of starting and ending points, via points can be chosen in different ways, and their choice can widely affect cycle time.
The goal of our research is to define a novel path planning algorithm for functionally redundant robots, able to minimize locally the movement time between two given Cartesian working points. In the proposed approach, we generate automatically a set of Cartesian via points around the workpiece, then we seek for the minimum time motion path that: (a) is safe in the sense that no collision occurs between the robot and the surrounding objects along the path; (b) includes the given starting/ending points and a subset of the via points. The search is performed considering multiple tool angles both in the starting and in the ending points, to exploit robot functional redundancy.
The main novelty in our approach lies in the particular way we generate the set of via points, which allows simplifying and decoupling the path planning problem from a kinematic perspective. In fact, the motion path is generated with reference to the wrist center only, whereas wrist rotations at the chosen via points are left totally free. As a result, the rotations of the last three joints of the robot can be planned form the starting point to the ending point in the most convenient way, minimizing their rotations and movement time. In the paper, with reference to the case of a functionally redundant anthropomorphic robot performing a point to point motion, our method is compared to standard probabilistic roadmap path planning in terms of both robot movement time and of computational time.

## 2. Related Work

Trajectory planning is very important in reducing the cycle time of robotic workcells. Many algorithms have been proposed to reduce the overall cycle time . Minimum kinematic parameters can be obtained by focusing on kinematics, dynamics, or minimum kinetic energy factors. However, this optimization is already implemented in the controllers of common industrial robots (even if it could be improved , reducing chattering effects). One of the parameters to be optimized is the path between the working points, avoiding the objects placed in the environment.
In the industrial workcells, the robotic workspace is cluttered with objects. To avoid collisions, the task can be simulated with off-line methods. Some of them were described in [7,20,32]. The objects within the workspace are usually described offline as patches. It is possible to detect the collision between multiple patches , but very wide patch collisions can be heavy to compute . Since the geometry of the objects placed in the environment can be very complex, it is usually more convenient to encapsulate them inside bounding volumes . These volumes can be simple spheres or cubes, Oriented Bounding Boxes (OBBs) , Sphere Swept Volumes (SSVs) , and many more. Usually, the tighter the volume is to the object, the slower is the collision detection algorithm . This is due to the complexity (and the number) of the elements that define the volumes: to define tighter volumes, more components are required (e.g., a tighter Discretely Oriented Polytope (k-DOP) requires several bounding planes ). Rodriguez-Garavito et al.  used bounding boxes to encapsulate the robot and the objects in the environment. Then, the collision detection algorithm had to evaluate the intersection of the bounding rectangles to find out if a collision occurred.
It is important to notice that the slower is the collision detection algorithm, the lower the amount of function evaluations can be performed in real time. This becomes particularly crucial with the algorithms, called sampling-based methods , in which random samples are chosen within the configuration space as via points, and each configuration is then tested to see if the robot collides with the environment. Among these methods, the most known frameworks are Probabilistic Roadmaps (PRM) and Rapidly exploring Random Trees (RRTs) , but many more algorithms have been proposed . These algorithms have been used both with kinematic and kinodynamic approaches  and can be used with robots with a high number of joints . Usually, the Dijkstra algorithm  is used to find the optimal path.
Another possibility for defining a safe path is using collision avoidance algorithms: it is possible to move the robot away from a collision point  and iteratively create a safe path. A similar approach was shown for real-time planning in [12,19]. An interesting approach was proposed by Khatib in , where a collision avoidance method based on potential fields was presented: robots get repelled by the space zones in which the obstacles are placed, acting like repulsive forces. However, sometimes, the robot can get stuck by particular obstacle shapes .
In some particular applications (such as deburring, welding, screwing, or painting), the industrial robot can become functionally redundant. In such scenarios, the number of parameters needed to define the robot configuration is higher than the number of degrees of freedom of the task. Much research activity has been carried out on the topic. Sciavicco and Siciliano  studied the redundancy of a manipulator, considering collision avoidance and limited joint range. In particular, the inverse kinematic problem for constrained manipulators was investigated, using optimization techniques that considered all the aspects listed before. Panames-Garcia et al.  proposed a general formulation for the optimization of the path placement of redundant manipulators considering single or multiple objective optimizations. Redundancy and path planning can be merged also with heuristic searches, such as by using genetic algorithms [1,28,31] and neural networks . However, while heuristics can be very valuable with a high number of degrees of freedom, they need to evaluate an objective function many times to obtain a suboptimal solution . Doan and Lin  were able to optimize the task of a redundant robot while finding the best position of the robot base in relation to the task itself. This is a very interesting approach to task optimization: the design of the workcell is taken into account while improving the final robot behavior.
None of these works on redundant robots merge the collision detection algorithm with a suitable definition of the via points in the Cartesian space, so as to decouple the path planning problem from a kinematic point of view. With our work, we aim to assess if such an approach can provide benefits in terms of shorter movement times and/or of lower computational cost.

## 3. Functional Redundancy

A welding process can be performed with every possible orientation of the welding tool around the normal axis at the working point. The same feature can be found in other manufacturing processes, such as deburring, where the same task can be accomplished by rotating the spindle around its axis. In such examples, the welding axis and the spindle axis can be considered as an additional axis to the robot kinematic chain. This results in an $N + 1$ degrees of freedom (DOF) manipulation, where N is the number of DOF of the robot. For example, a six axis robot like the one considered in the paper, equipped with a one DOF tool, equals a seven axis robot with a total of seven DOF. Therefore, this work applies also to seven axis robots, such as ABB YuMi and KUKA LBR iiwa, performing normal (non-redundant) tasks..
In this scenario, the configurations of the robot at the beginning and at the end of motion are not uniquely defined, so a proper choice of them can reduce the overall cycle time. In fact, since joint speed limits are upper bounded, a movement between very different configurations can be limited by the performances of the motors.
In this work, the redundant joint angle will be called $θ 7$. The redundant axis is normal to the surface of the workpiece and is off-axis with respect to the robot’s sixth joint axis. The method, however, is general and can be applied to other scenarios.

## 4. Proposed Method

Let A and B be two given positions on a workpiece. Such positions are given in the Cartesian space and define the position and orientation of the end effector at the working point. To avoid collisions between the robot and the workpiece or environment, moving from A to B usually requires passing through several via points. Our idea is to create a grid of safe via points in the Cartesian space that the robot can use to move between the given positions, defining a suboptimal safe path between A and B. The final objective is to minimize the movement time between A and B. In our method, the via points describe the position of the wrist center; therefore, their location influences the first three joints of the robot only. In this way, the path planning problem is decoupled from a kinematic point of view, in the sense that the motion of the first three joints is calculated and optimized regardless of the wrist initial and final rotations. As a result:
• The definition of the via points around the workpiece is simplified; in fact, they are 3D points (three variables) instead of robot configurations (N variables);
• The rotations of Joints 4, 5, and 6 are minimized, since such joints are simply moved from the initial to the final values; in fact, they are not involved in the definition of the safe path surrounding the workpiece, so their rotations at each via point can be chosen in the most convenient way;
• The rotations of Joints 1, 2, and 3 may not be minimized, since the via points are at a non-negligible distance from the workpiece.
The main steps of the method (Figure 1), explained for a six DOF manipulator performing a redundant task around the tool axis (with redundant joint angle $θ 7$), are:
• Place the devices in the workcell (the robot, the workpiece, and auxiliary systems) in the desired positions (or by finding the optimal positions );
• Define a safe volume around the workpiece (the Swept Sphere Volume (SSV) shown in green in Figure 2);
• Create a cloud of via points for the wrist center around the safe volume (Section 4.1), whose distance from the safe volume is equal to the distance between the tool tip and wrist center; such points are safe in the sense that, if the wrist center lies in one of the points, the tool cannot collide with the workpiece for any Joint 4, 5, and 6 values;
• Check if the via points are reachable by the robot from a kinematic point of view: if a collision occurs between the robot and the environment at some via points, they are removed from the cloud;
• Connect the via points to the eight closest ones (in the Cartesian space) to form the branches that will be used in the search of the minimum time path;
• Check the connections between the via points: if a collision occurs along the point to point motion between two connected via points, the connection is removed;
• Choose the initial $θ 7$ values for starting and ending positions A and B ($θ 7 , A$ and $θ 7 , B$);
• Find the suboptimal path that connects A and B without a collision using the Dijkstra algorithm to solve the graph whose nodes are the connected via points;
• Change $θ 7 , A$ and $θ 7 , B$ within a fixed grid around the initial values and loop from Point 8 until all possible combinations are evaluated;
• Find the combination $θ 7 , A , o p t$ and $θ 7 , B , o p t$ that yields the minimum time motion between A and B on the chosen grid.
The points from 8 to 10 can be iterated by refining the grid around the final point, until a certain condition is met (e.g., a maximum number of iterations). At the end of the iterations, the final values of redundant joint angles ($θ 7 , A , o p t$ and $θ 7 , B , o p t$) are stored, and the corresponding graph is considered as the optimal path that connects A and B.

#### 4.1. Via Points’ Generation and Selection

A line Swept Sphere Volume (SSV)  is used to encapsulate the workpiece. The shape and orientation of the SSV are chosen in a way that minimizes its volume.
Since the configuration of the tool is unknown a priori, to be sure that the tool does not collide with the workpiece, we chose to place the wrist of the robot at a distance greater than $R t o o l$ from the SSV, where $R t o o l$ is the minimum radius of a sphere centered in the wrist center and containing the tool. By using this criterion, a net of wrist center points equally distributed is placed on a surface at a distance of $R t o o l$ from the SSV (Figure 2).
To create the point could, a section of the SSV, containing the SSV symmetry axis, is considered (Figure 2 on the left). On this plane, $m 1$ points are evenly placed at a distance $R t o o l$ from the border of the SSV. Then, the section is cloned $m 2$ times around the SSV symmetry axis. The first and last points on each section that lie on the symmetry axis are considered once, so the total number of points is:
$N p = m 2 ( m 1 − 2 ) + 2$
The density of the net is a design choice ($m 1$ and $m 2$) and has a direct effect on the performance of the Dijkstra algorithm . Each point of the net is connected to its eight neighbors as shown in Figure 3, similarly to the uniform space sampling method shown in .
The first benefit provided by the proposed definition of via points is that, when the wrist center is in such points, the robot is in a safe position regardless of the orientation of the tool. In this way, if we include one of the via points in a motion between the starting and the ending points, such a via point will be safe for any configuration of the redundant axis in the given points. Thus, by creating a path that includes the given points and a subset of the calculated via points, such a path will be safe in all intermediate points for any choice of the initial and final configurations.
Secondly, since the via points are wrist center points, the inverse kinematic problem can be solved for the first three joints only (which is faster than solving the full problem), and an estimation of the motion time between connected points can be done by considering only such joints (Section 4.2, Equation (2)), thus drastically reducing the computational time. In fact, the estimated motion time on a given path depends only on the points chosen, regardless of the initial, pass-through, and final orientations of the tool. In this way, the time needed to move between different initial and final configurations of the robot can be evaluated without the need for re-calculating the inverse kinematics in the via points every time. To test the reduction of the computational time due to the decoupling of the inverse kinematic problem, a simple test was performed: the same position was used to calculate the entire configuration of the robot and only the first three joint values 100,000 times. The overall computational time for the whole inverse kinematic problem was 1.66 s, whilst the computational time required for the calculation of the first three joints was 1.06 s. As a result, the decoupling led to a reduction of the computational time of the inverse kinematic problem of around 36%.
Via points are checked for collision between the robot and the workpiece and the environment. If a collision is detected, the corresponding via point is deleted from the list. The collision test was performed as described in our previous work : all the links were encapsulated inside SSVs, whilst all other objects were encapsulated inside Oriented Bounding Boxes (OBB ). In this way, it was possible to compute the interaction between the robot and the environment faster than with the usage of SSVs only .

#### 4.2. Graph

The suboptimal path between two positions A and B is created using the Dijkstra algorithm . To solve the algorithm, the branches and the nodes must be defined.
While the via points represent the nodes, the branches are represented by the connections between the via points. Considering the net of reachable via points, only adjacent via points (in Cartesian space) are connected to form branches (Figure 3 on the left), so that the total number of branches is reduced. To avoid unnecessary calculations, collision tests along the motions through all the branches are computed. If a collision is detected, the corresponding branch is removed (Figure 3 on the right).
Branches’ weight equal the robot movement time between the nodes. Movement time between nodes h and k is estimated considering only the first three joints:
$T h k = max j = 1 , 2 , 3 | Δ q j , h k | q ˙ m a x , j c v$
where $Δ q j , h k$ is the total rotation of joint j between the nodes h and k, $q ˙ m a x , j$ is the maximum speed of joint j, and $c v$ is the velocity coefficient of the motion law .
Starting and ending nodes are defined by points A and B; A and B are connected to all the via points to form additional branches. In this way, it is possible to enter (from A ) and exit (towards B) the cloud of via points from any one of the via points. The weights of the additional branches are calculated as the traveling times (as Equation (2)), and the connections are checked to find collisions: the branches that provide collision are removed. The Dijkstra algorithm calculates the graph using A as the first node and B as the last one.
The first $θ 7 , A$ and $θ 7 , B$ values are null to start the optimization algorithm around the position provided by the user. To find the optimal solution, the redundant joint angles $θ 7$ at A and B are changed by fixed steps ($δ θ$), from minimum values ($θ 7 , i , m i n$) to maximum ones ($θ 7 , i , m a x$). In this way, a fixed grid of possible combinations is created; the limits of the grid can be different for A and B (see Table 1 for an example).
To ensure that the calculated paths are feasible, a collision test along each suboptimal path is computed. To do so, the planning of robot motion is performed along the whole path, including wrist rotations. The angles of the first three joints are interpolated from A values to B values considering also the via points included in the path. The angles of the last three joints, on the other hand, are interpolated from A values to B values only, since their values are not assigned at the via points. If a collision is found, the graph is re-calculated. This may occur due to a possible colliding configuration of the robot provided by the values of Joints 4, 5, and 6 along one of the connections; in fact, wrist rotations have not been considered in the previous collision tests, and whilst the via points are safe regardless of wrist orientation, connecting paths (especially from A to the cloud and from the cloud to B) may not.
The final movement time of the path is given by the following expression:
$T f i n a l ( θ 7 , A , θ 7 , B ) = max T D i j k s t r a ( θ 7 , A , θ 7 , B ) , max j = 4 , 5 , 6 | Δ q j , A B ( θ 7 , A , θ 7 , B ) | q ˙ m a x , j c v$
where $T D i j k s t r a ( θ 7 , A , θ 7 , B )$ is the minimum time yielded by the Dijkstra algorithm and $Δ q j , A B ( θ 7 , A , θ 7 , B )$ is the total rotation of joint j between points A and B.
At the end of an iteration step, all the possible combinations of $θ 7 , A$ and $θ 7 , B$ are compared. The best combination of those two values, i.e., the one that minimizes $T f i n a l$, provides $θ 7 , A , o p t$ and $θ 7 , B , o p t$ that are to be used in the next iteration step. To start the next iteration step, the value of $δ θ$ is reduced and the next boundaries of $θ 7 , A$ and $θ 7 , B$ are changed. The lower $δ θ$, the better the precision of the optimal position. In the first iteration, $θ 7 , A , m i n = θ 7 , B , m i n = − 180 ∘$ and $θ 7 , A , m a x = θ 7 , B , m a x = 180 ∘$ to evaluate the entire workspace (Table 2).
At the end of the procedure, the optimal couple of redundant joint angles $θ 7 , A , o p t$ and $θ 7 , B , o p t$ is provided.
The optimal solutions are not to be intended as the globally optimal solutions to the problem. Since this is a nonlinear stochastic problem that has to face many constraints (collision avoidance, movement between the via points, discretization of the values of the redundant joint angle), the purpose of the algorithm is to find a local minima of the problem, which, however, can be good enough to satisfy the majority of the industrial scenarios.

## 5. Validation

A MATLAB® script was created through which an ADEPT VIPER s650 six axis robot was simulated (Figure 2) moving from one working position to another. The PC used for the simulation was powered by an Intel Core i7-2700K, 16 GB of RAM, and 64 bit Windows 10 Pro 1803 version.
The robot was moved from one side of the workpiece to another so that direct movement was impossible (the robot would collide with the workpiece). The collision check along the movement was performed at a frequency of 180 Hz.
The starting position was $P A$ (490, 167.5, 18.4) with the orientation defined by Cardan angles ${ x , y , z } = { 0 , 90 , − 90 }$. The ending position was $P B$ (410, −67.5, 48.4) with the orientation defined by Cardan angles ${ x , y , z } = { 0 , 90 , 90 }$. The robot base frame was coincident with the global reference frame. The parameters of the planes defining the workpiece’s OBB, used by the collision detection algorithm, are shown in Table 3. Moreover, another plane was added to simulate the table where the workpiece was placed. The parameters describing this plane are in the seventh column of Table 3.
The total net of via points was made of 227 points ($m 1 = 11$, $m 2 = 25$), while the number of feasible via points was 56, and the number of via points connected to the graph was 46 (Figure 3 to the right).
In this test, we set the range limits of $θ 7$ angles to $± 3$ times $δ θ$ (first two steps) and $± 4$ times $δ θ$ (for other steps, see Table 1). This ensured a good trade-off between algorithm performance and computational time, since for each iteration, it limited the number of computations of the graph.
At first, the lowest movement time at each iteration step was evaluated. In Figure 4 are shown the results: the lowest movement time decreased from the highest $δ θ$ ($60 ∘$) to the lowest one ($1 ∘$). In this case, the reduction of the movement time from the higher value of $δ θ$ to the lowest one was nearly $23 %$ (Table 4). The computer took 24.88 s to find out $θ 7 , A , o p t$ and $θ 7 , B , o p t$ with eight steps. The best combinations at each step can be seen in Table 1.
Figure 5 shows the calculation times and the number of possible combinations of each $δ θ$ step. The calculation times nearly followed the trend of the number of combinations and was capped to the maximum of 81 starting from the third step. Then, at small $δ θ$ values, the calculation times slightly dropped due to a smaller amount of colliding paths: small variations of $θ 7 , A$ and $θ 7 , B$ around the optimal solution usually did not lead to many path collisions.
Even if a single calculation of 24.88 s reduced the movement time of nearly $23 %$, a similar result can be obtained using a reduced number of steps. We performed another test with the same starting and ending positions, but with only two iteration steps: $δ θ 1 = 30 ∘$ and $δ θ 2 = 5 ∘$. The results (Table 5) showed that with reduced computational times (only $11.41$ s), the lowest movement time was nearly the same as in the previous test.
In Figure 6, the final movement provided by the algorithm with the parameters of Table 5 is shown. The shape of the path depended on the density of the via points defined in the workspace.

#### Comparison with PRM

A comparison of the proposed method with the Probabilistic Roadmap Method (PRM) was performed, to compare the solutions obtained and the computational times. The PRM is a sampling based method that uses the Dijkstra algorithm to connect two points defined in the configuration space by using randomly generated via points defined in the configuration space. The main differences with our method are that: (a) the via points were defined randomly (i.e., without considering workpiece actual encumbrance); (b) wrist rotations were assigned at the via points, and this would force the wrist joints to make wider rotations along the path with respect to our method.
In the comparison, the PRM was set as follows:
• The sampling of the configuration space of the robot was performed by randomly choosing 227 configurations (equal to the number of via points of our point cloud);
• The configuration space was searched within a limited range of Joint 1, 2, and 3 rotations to reduce the dispersion of the randomly generated points (which would result in worse performance of the PRM algorithm); Joint 4, 5, and 6 ranges were not limited, to avoid loosing dexterity;
• Each configuration was connected to the nearest eight configurations (in the configuration space).
With the aim of fitting the PRM to the method described in Section 4, the latter was modified as follows:
• Point b was eliminated;
• Point c was modified since the via points were provided by randomly generated samples in the six-dimensional configuration space;
• Point e was modified since the via points were connected to form branches by finding the eight closest points in the configuration space.
All the other points of the method were kept unchanged.
Since in the PRM the via points were randomly generated and may yield variable results, 400 instances of the PRM were performed (with two $δ θ$ steps as in Table 5). The simulations showed a mean computational time of 21.2 s (standard deviation of 3.38 s) and a mean robot movement time of 0.6915 s (standard deviation of 0.2177 s). An example of the PRM solution is shown in Figure 7, where among 227 random samples, only 133 via points were reachable and connected to the graph. In this particular case, both the computational time and mean movement times were greater than with our method.
This was due to the sparse location of the via points in the PRM, most of which were not useful in the definition of a path with a low movement time. Moreover, the search for the suboptimal path was performed within a six-dimensional space in the PRM (the configuration space), while the decoupling of the inverse kinematic problem in our approach allowed searching a three-dimensional space and then simply interpolating the start and end values of the last three joints, thus reducing the computational effort .
To better understand the difference between our method and the PRM, five different cases were considered, in which the starting/ending positions and/or the workcell layout were changed (Figure 8): Test 1 was the same as in Figure 6; Test 2 and Test 3 were very simple movements (Test 2 was a simple rotation around end effector position; Test 3 was a tool repositioning on the same surface on top of the work piece); Test 4 included a tool repositioning from one side to the top of the workpiece; Test 5 included the same movement of Test 1 with an additional obstacle to constrain the movement.
Figure 9 shows optimal movement times provided by our method and by the PRM in the five tests (for the PRM, which was repeated 10 times for each test, minimum/maximum and mean values are depicted). Except from Test 2 (simple tool repositioning), where the results were comparable, our method outperformed the PRM in terms of the minimization of robot movement time. It may be that the PRM would perform better if we increased the number of the generated via points; however, this would dramatically increase computational time.
Figure 10 shows the total absolute joint displacements along the optimal path provided by our method and by the PRM in the five tests (for the PRM, which was repeated 10 times for each test, minimum/maximum and mean values are depicted). Cumulative displacement of the first three joints, which accounted for wrist center motion, and of the last three joints, which accounted for wrist rotation, are shown as well. This figure provides a possible explanation of the results shown in Figure 9: the PRM tended to produce wider displacements of the last three joints (i.e., wider rotations of the wrist), since it assigned their values in the via points; as a result, the motion time increased with respect to our method, where the displacement of the wrist joints was minimized (it equaled the difference between initial and final rotations in A and B). Even though our method may have sometimes provided wider rotations of the first three joints (i.e., larger motion of the wrist center), this seemed not to be the bottleneck in the tests performed.
Another interesting point is that, since the PRM is a stochastic method (in the sense that it produces a random set of via points), a single execution of it may yield very bad results in terms of robot movement time. On the other hand, our method provided a very good solution in one single shot.

## 6. Conclusions

In this paper, we dealt with the problem of defining a trajectory of an industrial robot from a given position to another, when the task is redundant around the tool axis. We proposed a new optimization technique, which finds the initial and final angles of the redundant axis and a proper sequence of via points that minimizes the movement time between the given positions while avoiding collisions with the obstacles at the same time.
The presented method was based on the automatic generation of a cloud of Cartesian via points around the workpiece for the wrist center, thus decoupling the inverse kinematic problem. The method used the Dijkstra algorithm to find the suboptimal path that connected the start and end positions passing through the via point cloud, and a final check for collision was performed to validate the solution. The algorithm can iteratively evaluate a high number of starting and ending configurations in low computational time, allowing one to perform a reasonably wide search of the suboptimal path within the infinite possible motions between the given points.
The particular choice of the via points in our algorithm allowed not only reducing the computational time, but also and mainly minimizing wrist rotations along the path, which in turn helped to obtain low robot motion times. A direct comparison of our method to the PRM in the case of an anthropomorphic industrial robot showed, in four out of five tested motion tasks, that our method could outperform the PRM in terms of robot optimal motion time, at a lower computational cost. Such results should be validated in a wider number of cases; however, their interpretation provided by the analysis on joint rotations suggested that they may be generalized.

## Author Contributions

Both authors equally contributed to the paper.

## Funding

This research was funded by University of Padua—Program BIRD 2018—Project. no. BIRD187930.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Ali, M.S.A.D.; Babu, N.; Varghese, K. Offline Path Planning of Cooperative Manipulators Using Co-Evolutionary Genetic Algorithm; NIST Special Publication SP: Gaithersburg, MD, USA, 2003; pp. 415–424.
2. Biagiotti, L.; Melchiorri, C. Trajectory Planning for Automatic Machines and Robots; Springer Science & Business Media: Berlin, Germany, 2008. [Google Scholar]
3. Bottin, M.; Boschetti, G.; Rosati, G. A novel collision avoidance method for serial robots. In IFToMM Symposium on Mechanism Design for Robotics; Springer: Berlin/Heidelberg, Germany, 2018; pp. 293–301. [Google Scholar]
4. Chen, D.; Li, S.; Lin, F.-J.; Wu, Q. New super-twisting zeroing neural-dynamics model for tracking control of parallel robots: A finite-time and robust solution. IEEE Trans. Cybern. 2019. [Google Scholar] [CrossRef] [PubMed]
5. Dijkstra, E.W. A note on two problems in connexion with graphs. Numer. Math. 1959, 1, 269–271. [Google Scholar] [CrossRef]
6. Doan, N.C.N.; Lin, W. Optimal robot placement with consideration of redundancy problem for wrist-partitioned 6r articulated robots. Robot. Comput. Integr. Manuf. 2017, 48, 233–242. [Google Scholar] [CrossRef]
7. Elbanhawi, M.; Simic, M. Sampling-based robot motion planning: A review. IEEE Access 2014, 2, 56–77. [Google Scholar] [CrossRef]
8. Ericson, C. Real-Time Collision Detection; CRC Press: Boca Raton, FL, USA, 2004. [Google Scholar]
9. Ferrara, A.; Incremona, G.P. Design of an integral suboptimal second-order sliding mode controller for the robust motion control of robot manipulators. IEEE Trans. Control. Syst. Technol. 2015, 23, 2316–2325. [Google Scholar] [CrossRef]
10. Fredman, M.L.; Tarjan, R.E. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 1987, 34, 596–615. [Google Scholar] [CrossRef]
11. Gottschalk, S.; Lin, M.C.; Manocha, D. Obbtree: A hierarchical structure for rapid interference detection. In Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, New Orleans, LA, USA, 4–9 August 1996; pp. 171–180. [Google Scholar]
12. Han, D.; Nie, H.; Chen, J.; Chen, M. Dynamic obstacle avoidance for manipulators using distance calculation and discrete detection. Robot. Comput. Integr. Manuf. 2018, 49, 98–104. [Google Scholar] [CrossRef]
13. Kavraki, L.E.; Svestka, P.; Latombe, J.-C.; Overmars, M.H. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 1996, 12, 566–580. [Google Scholar] [CrossRef]
14. Khatib, O. Real-time obstacle avoidance for manipulators and mobile robots. In Autonomous Robot Vehicles; Springer: New York, NY, USA, 1986; pp. 396–404. [Google Scholar]
15. Klosowski, J.T.; Held, M.; Mitchell, J.S.B.; Sowizral, H.; Zikan, K. Efficient collision detection using bounding volume hierarchies of k-dops. IEEE Trans. Vis. Comput. Graph. 1998, 4, 21–36. [Google Scholar] [CrossRef]
16. Larsen, E.; Gottschalk, S.; Lin, M.C.; Manocha, D. Fast Proximity Queries with Swept Sphere Volumes; Technical Report, Technical Report TR99-018; Department of Computer Science, University of North Carolina: Chapel Hill, NC, USA, 1999. [Google Scholar]
17. LaValle, S.M. Planning Algorithms; Cambridge University Press: Cambridge, UK, 2006. [Google Scholar]
18. LaValle, S.M.; Kuffner, J.J., Jr. Randomized kinodynamic planning. Int. J. Robot. Res. 2001, 20, 378–400. [Google Scholar] [CrossRef]
19. Lin, H.C.; Liu, C.; Fan, Y.; Tomizuka, M. Real-time collision avoidance algorithm on industrial manipulators. In Proceedings of the 2017 IEEE Conference on Control Technology and Applications (CCTA), Mauna Lani, HI, USA, 27–30 August 2017; pp. 1294–1299. [Google Scholar]
20. Mac, T.T.; Copot, C.; Tran, D.T.; de Keyser, R. Heuristic approaches in robot path planning: A survey. Robot. Auton. Syst. 2016, 86, 13–28. [Google Scholar] [CrossRef]
21. Pamanes-García, J.A.; Cuan-Durón, E.; Zeghloul, S. Single and multi-objective optimization of path placement for redundant robotic manipulators. INGENIERÍA Investigación y Tecnología 2008, 9, 231–257. [Google Scholar] [CrossRef]
22. Plaku, E.; Kavraki, L.E. Quantitative analysis of nearest-neighbors search in high-dimensional sampling-based motion planning. In Algorithmic Foundation of Robotics VII; Springer: Berlin/Heidelberg, Germany, 2008; pp. 3–18. [Google Scholar]
23. Ratiu, M.; Prichici, M.A. Industrial robot trajectory optimization—A review. MATEC Web Conf. 2017, 126, 02005. [Google Scholar] [CrossRef]
24. Redon, S.; Kheddar, A.; Coquillart, S. An algebraic solution to the problem of collision detection for rigid polyhedral objects. In Proceedings of the IEEE International Conference on Robotics and Automation, ICRA’00, San Francisco, CA, USA, 24–28 April 2000; Volume 4, pp. 3733–3738. [Google Scholar]
25. Ribeiro, M.I. Obstacle Avoidance; Instituto de Sistemas e Robótica, Instituto Superio Técnico: Lisbon, Portugal, 2005; p. 1. [Google Scholar]
26. Rodriguez-Garavito, C.H.; Pati no-Forero, A.A.; Camacho-Munoz, G.A. Collision detector for industrial robot manipulators. In Proceedings of the 13th International Conference on Soft Computing Models in Industrial and Environmental Applications, San Sebastian, Spain, 6–8 June 2018; Springer: Cham, Switzerland, 2018; pp. 187–196. [Google Scholar]
27. Sciavicco, L.; Siciliano, B. A solution algorithm to the inverse kinematic problem for redundant manipulators. IEEE J. Robot. Autom. 1988, 4, 403–410. [Google Scholar] [CrossRef]
28. Tian, L.; Collins, C. Motion planning for redundant manipulators using a floating point genetic algorithm. J. Intell. Robot. Syst. 2003, 38, 97–312. [Google Scholar] [CrossRef]
29. Tsardoulias, E.G.; Iliakopoulou, A.; Kargakos, A.; Petrou, L. A review of global path planning methods for occupancy grid maps regardless of obstacle density. J. Intell. Robot. Syst. 2016, 84, 829–858. [Google Scholar] [CrossRef]
30. Weller, R.; Debowski, N.; Zachmann, G. kdet: Parallel constant time collision detection for polygonal objects. In Computer Graphics Forum; Wiley Online Library: Hoboken, NJ, USA, 2017; Volume 36, pp. 131–141. [Google Scholar]
31. Xidias, E.K. Time-optimal trajectory planning for hyper-redundant manipulators in 3d workspaces. Robot. Comput. Integr. Manuf. 2018, 50, 286–298. [Google Scholar] [CrossRef]
32. Yang, L.; Qi, J.; Song, D.; Xiao, J.; Han, J.; Xia, Y. Survey of robot 3d path planning algorithms. J. Control. Sci. Eng. 2016, 2016, 5. [Google Scholar] [CrossRef]
Figure 1. An overview of the proposed algorithm. At first, the operator has to place all the objects in the workspace. Then, the algorithm provides automatically the path between the working positions.
Figure 1. An overview of the proposed algorithm. At first, the operator has to place all the objects in the workspace. Then, the algorithm provides automatically the path between the working positions.
Figure 2. A simple scheme that shows the placement of the via points on a section of the Swept Sphere Volume (SSV) (to the left). Each section is then repeated many times around the symmetry axis of the SSV. All the via points are placed at a distance $R t o o l$ from the surface of the SSV, so regardless the orientation of the wrist, the end effector will not collide with the work piece (to the right).
Figure 2. A simple scheme that shows the placement of the via points on a section of the Swept Sphere Volume (SSV) (to the left). Each section is then repeated many times around the symmetry axis of the SSV. All the via points are placed at a distance $R t o o l$ from the surface of the SSV, so regardless the orientation of the wrist, the end effector will not collide with the work piece (to the right).
Figure 3. All the adjacent via points are connected to form the branches (to the left), and then, the unreachable via points and the branches that provide a collision are removed (to the right).
Figure 3. All the adjacent via points are connected to form the branches (to the left), and then, the unreachable via points and the branches that provide a collision are removed (to the right).
Figure 4. Minimum of moving total time for each step value. The x-axis direction has been reversed to show the iteration process from left to right.
Figure 4. Minimum of moving total time for each step value. The x-axis direction has been reversed to show the iteration process from left to right.
Figure 5. Computational time of the definition of the graph for each step value. The computational time nearly follows the number of possible combinations. The x-axis direction has been reversed to show the iteration process from left to right.
Figure 5. Computational time of the definition of the graph for each step value. The computational time nearly follows the number of possible combinations. The x-axis direction has been reversed to show the iteration process from left to right.
Figure 6. From the top: the final movement provided by the algorithm for Test 1, with the red dots that describe the end effector trajectory and the black dots that describe the wrist center trajectory. To the bottom: corresponding joint angles versus time.
Figure 6. From the top: the final movement provided by the algorithm for Test 1, with the red dots that describe the end effector trajectory and the black dots that describe the wrist center trajectory. To the bottom: corresponding joint angles versus time. Figure 7. The wrist center points provided by Probabilistic Roadmaps (PRM) (to the left) and the corresponding final movement provided for Test 1, with the red dots that describe the end effector trajectory and the black dots that describe the wrist center trajectory (to the right). Blue circles are feasible and connected wrist center points.
Figure 7. The wrist center points provided by Probabilistic Roadmaps (PRM) (to the left) and the corresponding final movement provided for Test 1, with the red dots that describe the end effector trajectory and the black dots that describe the wrist center trajectory (to the right). Blue circles are feasible and connected wrist center points.
Figure 8. Starting (A) and ending (B) robot configurations of Tests 2 to 5; redundant angles are null in all the positions depicted ($θ 7 , A = 0$ and $θ 7 , B = 0$).
Figure 8. Starting (A) and ending (B) robot configurations of Tests 2 to 5; redundant angles are null in all the positions depicted ($θ 7 , A = 0$ and $θ 7 , B = 0$).
Figure 9. Optimized movement times retrieved from our method and from PRM. Since PRM planning was repeated 10 times for each test, the chart shows the minimum, mean, and maximum optimal times from PRM for each test.
Figure 9. Optimized movement times retrieved from our method and from PRM. Since PRM planning was repeated 10 times for each test, the chart shows the minimum, mean, and maximum optimal times from PRM for each test.
Figure 10. Joint displacement for each joint for each test (to the left) and the corresponding sum of joint triplets (to the right). Since PRM planning was repeated 10 times for each test, the chart shows the minimum, mean, and maximum displacements from PRM for each test.
Figure 10. Joint displacement for each joint for each test (to the left) and the corresponding sum of joint triplets (to the right). Since PRM planning was repeated 10 times for each test, the chart shows the minimum, mean, and maximum displacements from PRM for each test.
Table 1. An example of iterations changing $δ θ$ from $60 ∘$ to $1 ∘$. Such values were used to run the algorithm in Test 1.
Table 1. An example of iterations changing $δ θ$ from $60 ∘$ to $1 ∘$. Such values were used to run the algorithm in Test 1.
Step$δ θ$A Bounds ($∘$)B Bounds ($∘$)$θ 7 , A , opt$$θ 7 , B , opt$
($∘$)($θ 7 , A , min$,$θ 7 , A , max$)($θ 7 , B , min$,$θ 7 , A , max$)($∘$)($∘$)
160[−180, 180][−180, 180]060
245[−135, 135][−75, 195]060
330[−120, 120][−60, 180]030
420[−80, 80][−50, 110]010
510[−40, 40][−30, 50]−1020
65[−30, 10][0, 40]−1520
72[−23, −7][12, 28]−1522
81[−19, −11][18, 26]−1423
Table 2. Values of $θ 7 , A$ and $θ 7 , B$ when the first iteration step has $δ θ = 60 ∘$.
Table 2. Values of $θ 7 , A$ and $θ 7 , B$ when the first iteration step has $δ θ = 60 ∘$.
 $δ θ$($∘$) 60 $θ 7 , A$ values ($∘$) [−180, −120, −60, 0, 60, 120, 180] $θ 7 , B$ values ($∘$) [−180, −120, −60, 0, 60, 120, 180] Number of combinations 49
Table 3. Parameters describing the 6 planes that define workpiece Oriented Bounding Box (OBB) (Columns 1–6) and the extra plane describing the table where the workpiece is placed (Column 7). The parameters refer to the point normal form of the equation of a plane: $a x + b y + c z + λ = 0$.
Table 3. Parameters describing the 6 planes that define workpiece Oriented Bounding Box (OBB) (Columns 1–6) and the extra plane describing the table where the workpiece is placed (Column 7). The parameters refer to the point normal form of the equation of a plane: $a x + b y + c z + λ = 0$.
Plane $n ∘$1234567
a1−100000
b001−1000
c00001−1−1
$λ$ (mm)−368532671671.655.41.6
Table 4. Results of the test changing $δ θ$ from $60 ∘$ to $1 ∘$.
Table 4. Results of the test changing $δ θ$ from $60 ∘$ to $1 ∘$.
Step$δ θ$Lowest Movement Time (s)Comparison to Step 1 (%)Total Computational Time (s)
1600.60351001.77
2450.60351003.47
3300.601699.76.54
4200.567294.010.42
5100.489381.114.35
650.469877.817.89
720.468977.721.37
810.465577.124.88
Table 5. Results of the test changing $δ θ$ from $30 ∘$ to $5 ∘$.
Table 5. Results of the test changing $δ θ$ from $30 ∘$ to $5 ∘$.
Step$δ θ$Lowest Movement Time (s)Comparison to Step 1 (%)Total Computational Time (s)
1300.60161005.05
250.469878.111.41