Next Article in Journal
Edge-Computing and Machine-Learning-Based Framework for Software Sensor Development
Next Article in Special Issue
CFHBA-PID Algorithm: Dual-Loop PID Balancing Robot Attitude Control Algorithm Based on Complementary Factor and Honey Badger Algorithm
Previous Article in Journal
A Novel Unified Data Modeling Method for Equipment Lifecycle Integrated Logistics Support
Previous Article in Special Issue
Implementation of Omni-D Tele-Presence Robot Using Kalman Filter and Tricon Ultrasonic Sensors
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Task-Oriented Evaluation of the Feasible Kinematic Directional Capabilities for Robot Machining

Institute of Robotics, Faculty of Electrical Engineering and Computer Science, University of Maribor, 2000 Maribor, Slovenia
*
Author to whom correspondence should be addressed.
Sensors 2022, 22(11), 4267; https://doi.org/10.3390/s22114267
Submission received: 26 April 2022 / Revised: 20 May 2022 / Accepted: 1 June 2022 / Published: 3 June 2022

Abstract

:
Performing the machining of complex surfaces can be a challenging task for a robot, especially in terms of collaborative robotics, where the available motion capabilities are greatly reduced in comparison with conventional industrial robot arms. It is necessary to evaluate these capabilities prior to task execution, for which we need efficient algorithms, especially in the case of flexible robot applications. To provide accurate and physically consistent information about the maximum kinematic capabilities while considering the requirements of the task, an approach called the Decomposed Twist Feasibility (DTF) method is proposed in this study. The evaluation of the maximum feasible end-effector velocity is based on the idea of decomposition into the linear and angular motion capabilities, considering a typical robot machining task with synchronous linear and angular motion. The proposed DTF method is presented by the well-known manipulability polytope concept. Unlike the existing methods that estimate the kinematic performance capabilities in arbitrarily weighted twist space, or separately in the translation and the rotation subspace, our approach offers an accurate and simple solution for the determination of the total kinematic performance capabilities, which is often highly required, especially in the case of robot machining tasks. The numerical results obtained in this study show the effectiveness of the proposed approach. Moreover, the proposed DTF method could represent suitable kinematic performance criteria for the optimal placement of predefined tasks within the robot workspace.

1. Introduction

Collaborative robotic technologies enable humans and robots to work close together in a shared manufacturing environment. Contrary to classical industrial robots, which are primarily programmed to perform deterministic repetitive tasks, a new paradigm of collaborative robots encourages the development of flexible and intelligent robotic systems, especially for the needs of small and medium enterprises with low-volume, high-mix production [1,2]. In order to help these companies to gain a competitive advantage, a rapid integration into the manufacturing process is needed in order for them to achieve improved flexibility, higher autonomy, and safety of a robotic system for the industrial floor. In this context, recent studies on intuitive motion planning algorithms [3,4] and strategies toward safe and efficient human–robot collaboration [5,6] have attracted growing attention. However, in order to further improve flexibility and the easy deployment of collaborative robots, efficient trajectory planning algorithms for complex robot machining tasks are also necessary [7]. To provide autonomous and singularity-free motion planning, a detailed understanding of available motion capabilities within a robot’s workspace is key for the successful execution of complex robot machining tasks [8].
A robot’s workspace is usually defined as the maximum reachable volume whereby the end-effector is capable of reaching each point in at least one orientation. The reachable workspace characteristics can be computed offline and visualized as a discretized map, which is called a reachability or a capability map [9,10]. The manipulability of the robotic mechanism near the singular position can be largely reduced, although the robot can reach each point within a dexterous workspace—which is the subset of the reachable workspace—with any orientation. Consequently, there is still no guarantee for a successful and singularity-free Cartesian movement between two reachable poses in an operational task space. Therefore, kinematic and dynamic constraints such as positional joint limits, joint velocity, acceleration, and torque limits should also be considered when planning a feasible robotic task, for which the required kinematic and dynamic capabilities should be lower than the maximum allowable values of the robot.
A detailed understanding of robot movement capability within its workspace is crucial for the successful planning and execution of more complex surface machining tasks that require the simultaneous tracking of the desired workpiece surface all the time along the path (robotic milling, welding, composite layup, hammer peening, etc.) [11,12,13,14]. The execution of the complex robot task is not necessarily feasible anywhere in the robot workspace, especially in the case of collaborative robots, where the margin between their joint capabilities and task requirements is greatly reduced compared to conventional industrial robots [15]. To determine the optimal placement of a robot task within the robot workspace, it is necessary to propose a suitable objective function for optimization. In order to optimize a robotic machining trajectory, some existing kinematic performance indices are often taken into consideration [16,17,18]. A detailed analysis of these methods has shown that the most of them suffer from physical inconsistency (inhomogeneous Jacobian matrix [19], metric properties of twist [20]), do not take exact task requirements into account (such as task direction, synchronous linear and angular motion), do not include maximum kinematic constraints into consideration, or they are computationally intensive.
If only the kinematic of the robot is considered, a qualitative measure of the ability to move the end-effector toward an arbitrary direction is most often based on analyzing the manipulability ellipsoid that was first defined by Yoshikawa [21]. Yoshikawa’s manipulability index is proportional to the volume of the manipulability ellipsoid and should give information about the proximity to a singular configuration, which can also be estimated by the condition number or minimal singular value [22]. These indices can provide general evaluations of the robot’s capabilities in order to optimize the design of the robot [23] or any other global characteristic of a robot. However, such performance measures are often of limited practical usefulness since they are not reliable enough if the directional kinematic capabilities have to be improved along the predefined robotic task.
A suitable performance metric to determine the maximum directional kinematic capabilities of the robot end-effector was proposed in [24], that being the vector length from the center of the manipulability ellipsoid to the surface intersection point in the desired direction. It is also frequently referred to as the manipulator velocity ratio, first introduced in [25]. An alternative approach has been proposed based on the manipulability polytope [26], which is derived from the exact joint velocity limits. The ellipsoid approach, which involves the Euclidian norm, can provide an estimation of a robot’s capabilities in a task space relative to the effort in a joint space. However, the manipulability polytope appears to be more appropriate for the estimation of the robot’s feasible capabilities in the task space constrained by the joint velocity limits.
Both methods may result in a combination of translational and angular motion capabilities in a single scalar performance measure, which makes them physically inconsistent [27]. Several approaches have been suggested to overcome the drawback of physical inconsistency. One of the most common weights the translation capacity against the rotational [25], or handles them in a separate manner [28]. Different methods exist for the determination of the weights. However, arbitrariness in the choice of the weights is unavoidable [29]. The choice is usually made based on the task specifications [30] or based on the minimal principal axes of the translational and rotational subspace [31]. Some authors attempt to avoid this problem by introducing the new performance indices [32,33]; however, they only include translational directional capacities in their consideration. A new approach based on power manipulability and considered to be fully homogeneous and physically consistent has also been proposed in [34], but a direct relation between available power and specific task requirements could not be established clearly.
The more objective approach seems to be the partition on the translational and rotational motion capabilities. Through the decomposition of the task space into a translational and rotational subspace, the translational and rotational manipulability polytope in a weak and strong sense was derived in [35], similarly to Yoshikawa’s approach [36] in the case of the manipulability ellipsoids. When the translational (rotational) manipulability polytope in a weak sense is taken into consideration, the maximum possible linear (angular) velocity can be evaluated separately from the rotational (translational) subspace, whereby the angular (linear) velocity may not be zero and possibly uncontrolled. That means that the length of the translational (rotational) manipulability polytope represents the maximal feasible linear (angular) velocity in the specified direction, generating a simultaneous movement in the rotational (translational) subspace, which cannot be arbitrarily selected in accordance with the task requirements. Thus, this approach can be useful only for the applications where the angular velocity is irrelevant to the task performance [28,35,37]. However, in the case of robot machining applications, the desired synchronization between both subspaces according to the task requirements must be taken into account. Only pure translational (rotational) motion can be analyzed by the translational (rotational) manipulability polytope in a strong sense [36,38,39], but such applications, especially in the case of the robot surface machining, rarely exist in practical industrial cases. Some more recent approaches have evaluated the maximum directional kinematic capability using optimization-based methods in the case of redundant manipulators [40,41], which are mostly used in the case of redundant robot manipulators. If suitable linear inequality constrains related to the specific task requirements can be defined, the formulation of the optimization problem can also be adopted for robot machining purposes. However, finding the solution in this way is a time-consuming process. Generally, none of the above-mentioned methods seem to be suitable nor optimal, nor do any of them involve an appropriate consideration of the scenario when synchronized translational and rotational motion is required.
For this reason, we propose a method called Decomposed Twist Feasibility (DTF) in order to determine a feasible linear and angular velocity for robot machining purposes. In contrast to the existing methods that estimate maximum directional capabilities, it can precisely determine maximum motion capabilities for translation and rotation while considering the exact joint velocity limits and specific task requirements. Physical consistency can be achieved since the translational and rotational performance capabilities are considered individually. In contrast to the polytope approach, our solution can be computed in a time-efficient manner. The test results based on a generic 3 DOF planar robot manipulator and a collaborative robot UR5e demonstrate the usefulness of the proposed DTF method.
The remainder of this article is organized as follows. The related research based on the manipulability ellipsoid and polytope is described in Section 2. In this section, we also introduce a DTF method to determine the feasible linear and angular velocity in synchronous motion, which is required in applications such as robot surface machining. In Section 3, the numerical test results of the proposed DTF method in the case of a generic 3 DOF planar robot mechanism and a collaborative robot UR5e are shown in the context of the twist manipulability polytope, which proves the effectiveness and usefulness of the proposed DTF method. Finally, a discussion with conclusions is given in Section 4.

2. Materials and Methods

2.1. Manipulability Ellipsoid

The forward velocity kinematics of an n degree-of-freedom serial robotic manipulator, which we consider to be operating in an m-dimensional Euclidian operational space, describes the relation between the end-effector velocities t, called twist, and joint velocities θ ˙ :
t = v ω = J ( θ ) θ ˙ ,
where t is defined as a set of the linear velocity vector v 3 and the angular velocity vector ω 3 ; J ( θ ) m x n is a Jacobian matrix of the manipulator, with components of J i j = f i ( θ ) / θ j , where i = 1…m, j = 1…n, and m = 6 ; θ n is the joint position vector, and θ ˙ n defines the joint velocity vector. We assume rotational joints without a significant loss of generality.
The most widely used kinematic performance measure, which is based on the Jacobian matrix, was introduced in [21]. The velocity manipulability ellipsoid of a given configuration provides an intuitive graphical representation of how efficient the mapping of velocities is from the joint space to the task-space. The set of joint velocities with the unit Euclidian norm associated with a unit sphere in the joint velocity space:
E = θ ˙ n   |   θ ˙ T θ ˙ 1
maps into the velocity manipulability ellipsoid ε in the task space:
ε = t T ( J J T ) 1 t 1 .
Note that θ ˙ T θ ˙ is equal to the square of the Euclidian norm θ ˙ 2 2 of a vector θ ˙ . The volume of ε , however, may be used to define the quantitative measure of manipulability w :
w = det ( J J T ) ,
which is often used, although it suffers from a few limitations related to the physical inconsistency of the Jacobian matrix [19]. Furthermore, despite its popularity, the manipulability measure only gives a rough estimation of the robot’s movement capability and closeness to the singularity, and it is not accurate enough to determine how fast the robot can move in a certain direction. The manipulability ellipsoid principal axes—the direction of which coincides with the eigenvectors of the square matrix J J T , and whose lengths correspond to the singular values of J —represent the best and worst directions for the robot to perform a movement.
A robot’s movement capability in any other direction can be geometrically described as the distance from the center of the ellipsoid to the point where the line along the direction of interest intersects the ellipsoid surface. Let u ^ denote the unit vector in the task velocity direction of interest, and μ 2 be the distance from the ellipsoid center to the intersection point on the ellipsoid surface in the direction along the vector u ^ . Thus, one can write t = μ 2 u ^ , and in combination with (3), the following equation can be derived:
( μ 2 u ^ ) T ( J J T ) 1 ( μ 2 u ^ ) = 1 .
The scalar μ 2 is then the velocity transmission ratio in the direction of u ^ introduced by Chiu [24]:
μ 2 = u ^ T ( J J T ) 1 u ^ 1 / 2 .
The velocity transmission ratio (6), also known as the manipulator velocity ratio [25] or directional manipulability measure [42], can also be derived from the ratio of the task velocity vector norm to the joint velocity vector norm:
μ 2 = t / θ ˙ .
The value of this index defines how effectively the robot’s end-effector can move in the direction u ^ to satisfy condition θ ˙ 2 1 in the joint space. The direction in which the velocity transmission ratio is at its maximum is the optimal task direction for affecting velocity, as the lowest robot overall kinematic effort is needed. However, since a natural norm does not exist in the space used to represent the twist [29], which involves both linear and angular velocities, it leads to the physically non-consistent definition of the performance index with no clear physical meaning [19].

2.2. Manipulability Polytope

The main disadvantage of the manipulability ellipsoid is the fact that it does not transform the exact joint velocity constraints into the task space [43]; however, it rather serves as a conservative approximation of the end-effector velocity capabilities since it relies on the Euclidean norm. In practical cases, the overall kinematic performance of the end-effector in a task space is bounded by each joint velocity limit [26]:
max θ ˙ i 1 ,
where θ ˙ i denotes the joint velocity of the i-th joint if we assume that the maximal joint velocity is limited by the unit value of 1. The bounds on the individual joint velocity form a convex joint velocity polytope Q with 2 n vertices in the n-dimensional joint space, which can be written in the following compact form:
Q = θ ˙ n   |   θ ˙ 1 ,
where . denotes the infinity norm or L norm, which is equal to the maximum absolute value of the vector’s components. The linear mapping of Q from the joint to the task space (1) results in another convex polytope P t w i s t with the same number of vertices, which is called a twist manipulability polytope [15]:
P t w i s t = t m |   t = J ( θ ) θ ˙ ,   θ ˙ 1 .
Since we are interested in quantifying the ability to change the position and orientation of the end-effector along a specified task direction, the maximum feasible magnitude of the end-effector velocity along u ^ under the velocity constraints (8) can be defined as follows [28]:
μ = ( max θ ˙ i * i ) 1 ,
where θ ˙ * = θ ˙ 1 * , θ ˙ 2 * , , θ ˙ n * T is the minimum infinity norm solution of u ^ = J θ ˙ . The end-effector velocity (11) can be derived from the quotient of the weighted task velocity vector Euclidian norm and the joint velocity vector infinity norm [44]:
μ = t / θ ˙ ,
where the joint velocity vector θ ˙ belongs to the input polytope Q (9), which is mapped into the output task space velocity polytope calculated by (1). Geometrically, μ is the distance from the center of the output polytope to the point where the line along the desired direction of u ^ intersects the polytope.
Similar to the manipulability ellipsoid concept, the manipulability polytope concept also suffers from physical inconsistency due to the unwanted mixing of the linear and angular velocity in a single scalar value. Furthermore, it may be subjected to an algorithm seeking a computationally complex and less tractable minimum infinity norm solution [35,45,46].

2.3. Translational and Rotational Manipulability

Due to the physical inconsistency of the twist space manipulability ellipsoids and polytopes, the capabilities of translational and angular velocity should be handled individually. For this purpose, Yoshikawa [36] decomposed the task space into translational and rotational subspaces. He defined the translational (rotational) manipulability ellipsoid in the weak sense as a set of all translational velocities that are realizable under the constraint θ ˙ 2 1 . The translational (rotational) manipulability ellipsoid in the strong sense has an additional constraint, which requires the end-effector orientation to stay constant (angular velocity is zero, ω = 0 ).
Similarly to the Yoshikawa approach, in the case of a manipulability ellipsoid, the translational and rotational velocity capabilities were also handled separately for the polytope approach [28]. Since the polytopes provide a more accurate estimation of the maximum achievable end-effector velocities compared to the ellipsoids, only decomposed manipulability polytopes will be considered in the following. In this case, the weak sense polytope may result in two different types, i.e., with the minimum L norm and with the least L 2 norm solution of joint velocities, respectively.
The translational (rotational) velocity polytope P T ( P R ) in the L weak sense is defined as the set of all linear (angular) velocities that are realizable under the constraints (8) with the minimum infinity norm solution, if the joint velocity polytope is transformed to the task space via J T ( J R ):
P T = v 3 |   v = J T θ ˙ ,   θ ˙ 1
P R = ω 3 |   ω = J R θ ˙ ,   θ ˙ 1
where the Jacobian matrix is partitioned into translational and rotational (3xn) submatrices:
J = J T J R
Note that mapping v = J T θ ˙ in (13) ( ω = J R θ ˙ in (14)) describes the under-determined linear system. The translational polytope P T is illustrated in Figure 1.
In Figure 1b,c, the example of a translational velocity polytope P T in comparison to the twist polytope P t w i s t is presented in two different views in the task space. From Figure 1c, it can easily be seen that the translational velocity polytope P T fits to the orthogonal projection of the twist manipulability polytope P t w i s t in the translational subspace.
When an n-dimensional polytope is mapped to a space of lower dimension (k < n), some of the vertices of the original polytope are mapped into an internal region of the k-dimensional polytope [47]. For this kind of redundancy, part of the joint velocities may produce end-effector velocities with non-zero rotation (translation) components. The maximum feasible linear end-effector velocity (which could be denoted by v ) in a certain translational direction u ^ T 3 , or the maximum feasible angular end-effector velocity (which could be denoted by ω ) in the specific rotational direction u ^ R 3 , can be determined by geometry-based methods [43,45,48] as the vector length from the origin of the translational (rotational) velocity polytope P T ( P R ) to the intersection with its boundary in the specified direction.
One may select one of the subspace manipulability polytopes, depending on the task at hand. If the main concern of the task is maximal linear velocity, then the vector length of the translational velocity polytope will be considered, and vice versa. Since translational subspace is considered separately from rotational subspace, multiple solutions may exist in the joint space, which satisfies constraint (8). The minimum infinity norm solution, illustrated by Q T in Figure 1a, can be found numerically based on the structured linear algebra algorithm [46], which is rather computationally extensive. Alternatively, this problem can be expressed as a linear programming problem, where the optimal solution exists at the intersection of the explicitly given linear inequality constraints.
Besides polytope analysis, performance indices based on the vector expansion method [49] offer a computationally faster solution compared to the polytopes approach, since only the robot’s capabilities are investigated in the direction of interest in the task space. The maximum achievable linear (angular) end-effector velocity in the u ^ T   ( u ^ R ) direction, based on the vector expansion method, can be estimated by the following:
v 2 = J T u ^ T 1
ω 2 = J R u ^ R 1
The value v 2 ( ω 2 ) matches the vector length of a manipulability polytope P 2 T ( P 2 R ) in the L 2 weak sense, with the least Euclidian norm solution of joint velocities in the direction defined by u ^ T ( u ^ R ). The polytope P 2 T ( P 2 R ) is inscribed in the translational (rotational) manipulability polytope P T ( P R ) in the L 2 weak sense, defined as follows:
P 2 T = v 3 |   v = J T θ ˙ ,   θ ˙ 1 ,   θ ˙ = J T v
P 2 R = ω 3 |   ω = J R θ ˙ ,   θ ˙ 1 ,   θ ˙ = J R ω
which determines a set of joint velocities defined by the intersection Q R o w ( J T ) ( Q R o w ( J R ) ) in the joint space, where R o w ( J T )   ( R o w ( J R ) ) is the row space of the translational (rotational) Jacobian matrix.
The polytope P 2 T is depicted in Figure 2. In Figure 2b,c, the polytope P 2 T in relation to the polytopes P t w i s t and P T is shown in two different views in the task space, where it can be seen that P 2 T is inscribed in the P T . Unlike the polytope P T , which defines the minimum L norm solution of the joint velocities, the polytope P 2 T represents the maximal linear velocities with the least L 2 norm solution of the joint velocities under the constraint (8), i.e., θ ˙ 1 , illustrated by Q 2 T in Figure 2a.
The polytope P 2 T is depicted by Figure 2. In Figure 2b,c, the polytope P 2 T in relation to the polytopes P t w i s t and P T is shown in two different views in the task space, where it can be seen that P 2 T is inscribed in the P T . Unlike the polytope P T , which defines the minimum L norm solution of the joint velocities, the polytope P 2 T represents the maximal linear velocities with the least L 2 norm solution of the joint velocities under the constraint (8), i.e., θ ˙ 1 , illustrated by Q 2 T in Figure 2a.
In terms of trajectory planning optimization, an analysis of the translational manipulability polytope in the L 2 or L weak sense can offer a trajectory planning that reaches the goal pose faster [28] or with lower kinematic effort, assuming that the orientation of the end-effector is not important. However, how can translational capabilities be managed separately from the rotational and also keep control over a rotational subspace?
If we add another constraint that requires joint velocities to be projected onto the null space of J R ( J T ), the translational (rotational) manipulability polytope in the strong sense can be obtained, which enables the analysis of purely translational (rotational) motions. In order to graphically represent the translational (rotational) manipulability polytope in the strong sense, it is necessary to find the intersection between the joint velocity polytope Q and the null space N ( J R ) ( N ( J T ) ) , i.e., Q N ( J T )   ( Q N ( J R ) ) . The mapping of such joint velocities to the task space forms a translational (rotational) manipulability polytope in the strong sense P s t r o n g T ( P s t r o n g R ) , with the shape depending on the dimension of the considered null space:
P s t r o n g T = v 3 |   v = J T θ ˙ ,   θ ˙ 1 ,   J R θ ˙ = 0
P s t r o n g R = ω 3 |   ω = J R θ ˙ ,   θ ˙ 1 ,   J T θ ˙ = 0
The translational manipulability polytope P s t r o n g T is depicted in Figure 3. A comparison with the polytopes P t w i s t , P T , and P 2 T is shown in Figure 3b,c. The polytope P s t r o n g T is quite reduced in comparison to the polytopes P T and P 2 T . The joint velocity solution under the constraint J R θ ˙ = 0 and (8), i.e., θ ˙ 1 , is illustrated by Q s t r o n g T in Figure 3a.
The translational (rotational) manipulability polytope in the strong sense P s t r o n g T   ( P s t r o n g R ) allows for a complete separation of the translational and rotational capability analyses since only pure translational (rotational) movement is being considered at a time. What if a robot task requires a simultaneous motion with synchronized translational and rotational end-effector velocities, as in the case of robot surface machining? For this purpose, a solution will be derived in the following.

2.4. Proposed Method

The estimation of the maximum feasible linear and angular velocity for simultaneous linear and angular motion using the proposed DTF method will be explained in this section. The problem can be formulated as follows: We seek a maximum linear (angular) velocity in the desired direction, in a rotational (translational) motion synchronized with the specified direction, under joint velocity constraints (8). In the following, we assume an n degree-of-freedom, non-redundant, robotic serial-link manipulator in a non-singular configuration.
Unlike the majority of existing methods that take the translational (rotational) Jacobian submatrix J T ( J R ) into consideration, the derivation of the proposed DTF method is based on the Jacobian submatrices, which fulfils the additional restrictions with the null space projection [36,38]. Let J ˜ T denote a 3xn translational Jacobian submatrix:
J ˜ T = J T ( I J R J R ) ,
where I is the identity matrix, and ( I J R J R ) is the projector to the rotational null subspace, with the operator ( . ) that stands for the Moore–Penrose pseudoinverse of a matrix. Similarly, the rotational Jacobian submatrix J ˜ R can be obtained. If we assume a square Jacobian matrix, then it can be shown that the inverse of the Jacobian (15) can be represented by two parts, which can be derived from the pseudoinverse of J ˜ T and J ˜ R [35,36]:
J 1 = J ˜ T J ˜ R ,
such that the joint velocity vector can be decomposed correspondingly as:
θ ˙ = J 1 t = θ ˙ T + θ ˙ R ,
where θ ˙ T N ( J R ) and θ ˙ R N ( J T ) . Note that in the latter equation, we assume that the joint velocity vector can be described in a form consisting of two parts related to translation and rotation. This can be rewritten as follows:
θ ˙ = J ˜ T v + J ˜ R ω ,
where the first part of (25) are the joint velocities θ ˙ T N ( J R ) required solely by the translational end-effector displacement (i.e., with zero contribution to the rotational motion), while the second part are joint velocities θ ˙ R N ( J T ) responsible solely for rotational end-effector displacement (i.e., with zero contribution to the translational motion). To find the maximal velocity capabilities in the task space, we need to analyze how well the task’s requirements fit the robot’s joint velocity constraints (8). A robot surface machining path consists of waypoints located along a curved surface. During the process, the robot needs to follow the prescribed path with a constant linear velocity while maintaining the end-effector orientation normal to the curved surface. Synchronization between the desired linear and angular velocity vectors within two neighboring waypoints can be determined by the curved surface geometry.
In contrast to the existing methods, where the desired motion synchronization cannot be controlled (the maximum kinematic capabilities can be evaluated only based on the desired linear/angular velocity direction), the proposed method also takes the desired motion synchronization into consideration. The ratio of these magnitudes denoted by h defines the relative importance of the synchronized translational and rotational motion independently of the velocity profile scaling:
h = V / Ω ,
where V = v 2 is the magnitude of the linear velocity, and Ω = ω 2 is the magnitude of the angular velocity. The parameter h is a task-dependent velocity ratio factor that reflects the synchronization of translational and rotational motion.
The linear velocity vector and the angular velocity vector can be represented by:
v = V u ^ T ,
ω = Ω u ^ R ,
where u ^ T 3 and u ^ R 3 are the unit vectors in the desired direction of the linear and the angular velocities in the task space, respectively. When the end-effector maintains a constant orientation, there is no rotational motion required ( ω = 0 ), thus the ratio h approaches infinity and the motion is purely linear. The maximum directional kinematic capabilities can be obtained by the translational manipulability polytope P s t r o n g T in the strong sense. If the velocity ratio factor h is zero, the motion is pure rotation. The maximum directional kinematic capabilities can be determined by the rotational manipulability polytope P s t r o n g R in the strong sense. Combining the task requirements and the robot’s velocity capabilities leads to the following:
J ˜ T V u ^ T + J ˜ R Ω u ^ R 1 .
The maximum linear and angular velocity can be found by scaling under the constraints (8), considering (26). This yields the following equations:
V max = J ˜ T u ^ T + h 1 J ˜ R u ^ R 1 ,
Ω max = h J ˜ T u ^ T + J ˜ R u ^ R 1 ,
where we consider that the linear velocity is synchronized with the angular velocity, thus Ω max = h 1 V max and V max = h Ω max . In contrast to the existing methods, the proposed DTF method gives us the physically meaningful and accurate information about how fast the robot can move when a simultaneous translational and rotational motion is needed in directions u ^ T and u ^ R , respectively. The maximum linear (angular) velocity vector, considering the desired angular (linear) motion constraint, can be obtained as follows:
v max = V max u ^ T ,
ω max = Ω max u ^ R ,
which can be combined further into the maximum feasible twist vector t max T = v max T ω max T for the given base task parameters ( u ^ T , u ^ R , h ) and under the constraints (8).
To provide an intuitive understanding of the proposed DTF method, the maximum linear and angular velocity vectors ( v max and ω max ) are shown graphically by the twist manipulability polytope in Figure 4. In the case of the 3 DOF planar robotic mechanism, the twist manipulability polytope lies in the 3-dimensional space, which consists of the 2-dimensional translational subspace (the v x v y plane) and the 1-dimensional rotational subspace ( ω -axis). The maximum linear velocity capability is illustrated as a vector v max in red, with the direction u ^ T and the magnitude V max , which lie in the v x v y plane, and it can be interpreted as the orthogonal projection of the twist vector onto the translational subspace. The maximum angular velocity capability is shown as a vector ω max in blue in the ω -axis, with the direction u ^ R and the magnitude Ω max . The tip of the resultant twist vector t max in purple is touching the surface of the twist manipulability polytope.
Unlike the existing methods [32,49] that separately evaluate maximal end-effector capabilities based on the desired velocity direction for the translational and the rotational subspaces, the proposed DTF method, although based on twist decomposition, links both individual subspace constraints by the inclusion of the specific robot task requirements with the velocity ratio factor h. In terms of the robot machining of the workpiece with complex surface geometric properties, the task requirements depend on the variation in the surface curvature and the defined tool path, which is then reflected in the velocity ratio factor h. Thus, for a given translational direction u ^ T , rotational direction u ^ R , and velocity ratio factor h, we seek the maximum linear V max and rotational velocity Ω max that could be achieved. To provide an illustrative and intuitive demonstration of the proposed DTF method with respect to different task requirements, the maximal linear and angular end-effector velocities are illustrated graphically by the task-space twist polytope in Figure 5.
In the middle of Figure 5, we show the twist polytope with the curves on its surface, described by the tips of the resultant twist velocity vectors at different values of the velocity ratio factor h, while the translational direction vector interpolates as u ^ T = cos ( α ) sin ( α ) , α = 0 2 π . Note that the different values of the velocity ratio factor h are related to different task requirements, which, in our case, are chosen as: (i) Concave path segment with h = 0.21, (ii) Convex path segment with h = 0.42, (iii) Flat path segment with h = 1000, (iv) Flat convex path segment with h=1.25. Each of the polytope iso-curves is related to the evaluation of the twist vector tips with the same task requirements at the specific value of the synchronization parameter h (also see the colorbar for the selected value). It can be noted that each iso-curve lies entirely on the surface of the manipulability polytope, thus satisfying the constraint given by (8). If the reverse direction of angular velocity is considered, the set of resultant tips are mirrored to the opposite side of the twist manipulability polytope.
The maximum linear and angular velocity vectors of each example (i)–(iv) is additionally shown in detail by two different projection views, i.e., the v x ω plane and the v x v y plane, respectively. In the v x v y plane, the maximum feasible linear velocity vectors (plotted in red) can be obtained if the unit direction vector u ^ T is interpolated as described above. Note that this projection view also depicts the translational polytopes P T , P 2 T , and P s t r o n g T in reddish, greenish, and yellowish colors, respectively. The corresponding angular velocity vectors are plotted in blue in the v x ω plane for the directions u ^ R = + 1 or u ^ R = 1 . The maximum feasible magnitude of the linear and angular velocity vectors for the same combination of u ^ T and u ^ R obviously depends on the value of the synchronization parameter h .
The example (i) represents the case where the curvature of the path is high, and the change in the end-effector orientation is much bigger than the change in position (the highest value of h 1 ). Since the example path curve is of a concave function shape, the direction of angular velocity is u ^ R = + 1 , and the tips of the resultant vectors are located on the upper part of the twist manipulability polytope P t w i s t (see Figure 5a)). The set of maximum feasible linear velocity vectors form a circle; thus, the maximum directional kinematic capabilities are the same in all directions (see Figure 5b). Since almost only angular motion is needed in this case, the maximum feasible linear velocities based on the proposed DTF method ( v max ) are quite low. Note that in the case of the translational manipulability polytope P T (reddish) or P 2 T (yellowish), the maximum linear velocity vector would end on the surface of each polytope (see Figure 5b) since the analysis of linear velocity capabilities are evaluated separately from the rotational subspace in this case.
An example of the path segment with a convex function shape ( u ^ R = 1 ) is demonstrated in the case (ii). The tips of the resultant vectors are located at the bottom of the manipulability polytope (see Figure 5c) in this case. The desired combination of linear and angular motion can be performed faster in the + y direction than in the y direction if the same direction of angular velocity is considered (see Figure 5d). The magnitude of the maximum feasible linear velocity based on the manipulability polytope P T (reddish) is the same as in Figure 5b; an even more flattened path segment is considered in this case, and different synchronization between the linear and angular velocities is needed (more linear motion).
In the example (iii), almost only translational motion is considered. The magnitudes of the linear velocity vectors are equal to the vector lengths of the translational manipulability polytope in the strong sense P s t r o n g T (see Figure 5e). The resultant vectors lie in the v x v y plane since there is no rotational motion (see Figure 5f). Although the results based on the manipulability polytope P s t r o n g T (greenish) can give the same solution as the proposed method, the analysis of this polytope is not suitable for other cases, where synchronization between the linear and angular motion is needed.
In contrast to (iii), example (iv) represents a more flattened path segment. The magnitudes of the feasible linear velocity vectors are larger than the magnitudes of the angular velocity vectors. Especially in Figure 5g,h, it can clearly be seen that the maximal directional kinematic capabilities are strongly dependent on the direction of the linear velocity vector u ^ T , considering that the velocity ratio factor h and the direction of angular velocity u ^ R for all directions are the same. As it can be seen from Figure 5g, the geometry obtained by the proposed DTF method touches the translational manipulability polytope P T (reddish) only in two directions, which means that only for those directions, the same solution can be obtained based on the translational manipulability polytope in the weak sense. For all other directions, the linear velocity evaluated by P T can be feasible only if suitable synchronization to rotational motion is considered, as can be seen in Figure 5h. The angular velocity vector should not exceed the dimension of the twist manipulability polytope.
Note that Figure 5b,d,e,g beside the weak and the strong translational polytopes show regions of feasible linear velocities under the constraint of the task-dependent velocity ratio factor h, which are introduced as subregions within the L weak polytopes.

3. Results

To demonstrate the effectiveness and potential usefulness of the proposed DTF method, we present two case studies in which the maximal end-effector capabilities were evaluated, i.e., for a generic 3DOF planar robot manipulator and for the 6DOF collaborative robot UR5e. To ensure the physical consistency of such evaluation in the case of a robot machining task, where the simultaneous control of synchronous translational and rotational motion is required, the maximal linear and angular velocity of the end-effector will be given individually for a predefined path segment. We will show that the maximal end-effector capabilities do not only depend on the configuration and direction of the desired linear and angular motion, but they are also strongly dependent on the specific task requirements. Additionally, in the case of the collaborative robot UR5e, it will be shown that this criterion could be useful in the case of a task-oriented workspace analysis and an optimal task placement.

3.1. Basic Case Study Formulation

We consider the robot machining trajectory along a complex curved surface that is divided into N equally spaced curve segments defined by M = N + 1 waypoints. For this evaluation, the maximum end-effector kinematic capabilities will be analyzed to move the robot end-effector from an initial point to a target point in each segment, while aiming not to exceed the joint velocity limits. In addition, the end-effector tip should follow the desired surface along the path all the time, moving with constant linear velocity and synchronizing the angular velocity to maintain the tool orientation normal to the surface. Our goal was to calculate the maximum feasible linear velocity for each segment of the desired path. In this study, three different parts of the geometrically curved surface will be analyzed and used to demonstrate the proposed DTF method graphically and numerically.

3.2. Generic 3 DOF Planar Manipulator

Path Segment Feasiblity

The proposed DTF method was firstly applied to a generic 3 DOF planar manipulator, which enables an easier graphical representation of the manipulability polytope in a twist space. The 2D curve shown in Figure 6 represents the path that the manipulator end-effector followed. A set of waypoints was placed along the path, with the orientation normal to the curve. The end-effector was to simultaneously reach each of them at the desired position and orientation. In this experiment, the proposed DTF method was used to determine the maximum feasible linear velocity at three different parts of the curved path, as shown in Figure 6. Example (i) represents a slightly curved path segment, whereas a strongly curved path segment was considered in example (ii), and a flat path segment was analyzed in example (iii). We assume that the maximum kinematic capabilities of the robot are limited by the joint velocity θ ˙ max = 1   ( rad / s ) for all joints.
At each of the path segments under consideration, the direction of linear and angular velocity was determined along the path. Since simultaneous synchronous linear and angular motion was required along the path, the relative importance of each motion type plays a crucial role in the accurate determination of the maximal end-effector capabilities. In the case of following the curved path, the ratio between the translations and the rotations depends on its curvature. During the motion along the strongly curved path segment, as in case (ii), a significant change in the end-effector orientation was required, while a relatively small change in position was performed; therefore, the ratio between the magnitudes of the linear and angular velocities, denoted by the synchronization parameter h, converged to 0. For the flat path segment (iii), the synchronization parameter h value was the highest since the linear motion dominated over the angular. The values for the considered TCP position, the direction of the linear velocity vector u ^ T , the direction of the angular velocity vector u ^ R , and the velocity ratio factor h of each path segment are summarized in Table 1.
Based on the proposed DTF method, the maximum feasible directional kinematic capabilities ( V max denotes the maximal magnitude of linear velocity evaluated by (30), whereas Ω max denotes the maximal magnitude of angular velocity evaluated by (31)) was calculated for each path segment. The required joint velocities were also computed to confirm that condition (8) was satisfied. From Table 2, it can be noted that the computed combination of the maximal linear and angular velocity reaches the joint velocity limit in at least one joint in all cases. Although the velocity limit was achieved in all path segments, at least at a single joint, the maximum linear velocity varied, depending on the considered robot configuration, the linear and angular velocity directions, and the specific task requirements linked to the curvature of the path that determines the velocity ratio factor h.
The highest maximum feasible linear velocity was achieved in the case of segment (i), where the required change in position was approximately the same in relation to the change in the orientation ( h 1 ). The lowest maximum feasible linear velocity was obtained for segment (ii), where almost only the angular motion was needed. For a better understanding of the computed results, the graphical representation of the proposed DTF method is presented in Figure 7 in relation to the manipulability polytopes defined above.
For each of the considered examples (i), (ii), and (iii), the twist polytope P t w i s t and the translational manipulability polytopes P T , P 2 T , and P s t r o n g T are illustrated in Figure 7 in three different views, i.e., the 3D projection view, the 2D view in the v x ω plane, and the 2D view in the v x v y plane, respectively. The figure also depicts the maximum feasible linear and angular velocities, as determined by the proposed DTF method given by (30), (31).
It can easily be verified that the translational manipulability polytope P T fits to the orthogonal projection of the twist manipulability polytope P t w i s t onto the translational subspace, shown by the v x v y plane in this case (Figure 7c,f,j). For the synchronous linear and angular motion, considering the desired task requirements given by the synchronization parameter v max  h, the maximal linear velocity vector v max (see (32)) based on the proposed DTF method was calculated and shown as a vector in red. For the desired motion considered for the segment (i), the magnitude of the maximum linear velocity vector v max was smaller than the vector length of the manipulability polytope P T . When almost only angular motion was needed, as in the case of segment (ii), the maximum linear velocity v max was near zero. In the case of segment (iii), where the linear motion dominates the angular motion, the value of V max was equal to the vector length of the translational manipulability polytope P s t r o n g T in the strong sense, which was also the highest feasible linear velocity for this combination of u ^ T and u ^ R .
The v x ω plane view (Figure 7b,c,e) shows the maximum feasible angular velocity capabilities of each path segment. The maximum feasible angular velocity for the specific task requirements of each considered segment is shown as a vector ω max in blue. The maximum feasible angular velocity can be achieved for segment (ii), where the angular motion dominates the linear motion. A relatively high angular velocity can also be performed for the synchronous movement considered for segment (ii), while the lowest angular velocity can be performed in the case of segment (iii) since almost only linear motion was needed.

3.3. Collaborative Robot UR5e

3.3.1. Path Segment Feasiblity

The proposed DTF method was also demonstrated and verified on the collaborative robot UR5e, which is of 6DOF, thus enabling robot operation in a 3D space. In this case, the 3D curve on the workpiece surface was determined as the path that the robot tool had to follow. A set of waypoints was placed along the path, with the orientation normal to the surface. The robot end-effector was to simultaneously reach each of them with the desired position and orientation. In this experiment, the proposed DTF method will be used to determine the maximum feasible linear velocity at three different parts of the curved path, as shown in Figure 8, if we assume that the maximum kinematic capabilities of the robot are limited by the joint velocity θ ˙ max = 3.14   rad / s for all joints. Similar to the 3 DOF planar case, example (i) represents a flat path segment of the surface, a strongly curved path segment was considered in example (ii), and a slightly curved path segment of the surface was analyzed in example (iii).
At each of the segments under consideration, the directions of the linear and angular velocities were determined along the path. During the motion along path segment (ii), a significant change in the end-effector orientation was required, while a relatively small change in position was performed; therefore, the ratio between the magnitudes of the linear and angular velocities, denoted by h , converged to 0. On the relatively flat path segment (i), the velocity ratio factor h was the highest since the linear motion dominated the angular motion. The direction of the linear velocity vector u ^ T , the direction of the angular velocity vector u ^ R , and the velocity ratio factor h of each segment are shown in Table 3.
The maximum linear velocity V max and maximum angular velocity Ω max based on the DTF method are shown in Table 4, together with the required joint velocities θ ˙ .
For each of the considered examples (i), (ii), and (iii), the 3D translational manipulability polytope P T in the L weak sense (magenta), the 3D translational manipulability polytope P s t r o n g T in the strong sense (green), the 3D rotational manipulability polytope P R in the L weak sense (blue), and the 3D rotational manipulability polytope P s t r o n g R in the strong sense (red) are all illustrated in Figure 9. The maximum feasible linear velocity vector v max (red arrow) and the maximum feasible angular velocity vector ω max (blue arrow) by the proposed DTF method are also illustrated. Note that the twist space in this case is of 6D, and thus inconvenient for a graphical presentation of the 6D twist polytope P t w i s t .
If the main concern was the linear velocity (the value of the synchronization parameter h was high), as in case (i), the maximal linear velocity vector v max in the direction u ^ T practically coincides with the vector length of the translational manipulability polytope P s t r o n g T in the strong sense in the same direction. The maximal angular velocity Ω max was near zero since the flattest part of the surface was considered. On the other hand, the lowest value of the synchronization parameter h was when a greater change in orientation was required as compared to the change in position, as it was in case (ii). As a result, the maximal angular velocity Ω max was, in this case, equal to the vector length of the rotational manipulability polytope P s t r o n g R in the strong sense, and the maximal feasible linear velocity V max was the lowest among all three cases. When the synchronized linear and angular motion was taken into account, as in case (iii), the maximum linear and angular velocities were higher, and its vectors exceeded the bounds of the translational (rotational) manipulability polytope P s t r o n g T ( P s t r o n g R ) in the strong sense. Generally, however, they can never exceed the bounds of the translational (rotational) manipulability polytope P T ( P R ) in the weak sense.

3.3.2. Workspace Analysis

An important issue in robot task design is to place the robot tool path in such a location in the robot’s workspace where the robot will be capable of performing a desired movement utilizing the lowest possible joint velocities, or, in other words, performing a desired movement with maximum feasible tool velocity. In order to demonstrate that we can apply the proposed DTF method, we generated a colored task-oriented kinematic capability map, which represents the maximum directional kinematic capabilities for the desired movement. The kinematic capabilities were computed for equidistantly distributed sets of points in the UR5e’s horizontal x-y plane (z = 0) of the base robot frame {B}, as shown in Figure 10, where n = 0.05 m denotes the discretization step for both directions, and R = 1 m and r = 0.2 m represent the inner and the outer workspace boundaries, respectively. The maximum linear velocity was calculated at each discretized point along a specified task direction (i), (ii), and (iii) (see Figure 8), which required synchronous translational–rotational motion. The robot configuration was chosen, as shown in Figure 10, for all discretized points.
At each point, the inverse kinematic solution was firstly computed for the considered robot configuration. Only those points for which the inverse kinematic solution exists were included in further workspace analysis; the others were disregarded. The maximum linear velocity V max based on the proposed DTF method (30) was calculated for those with a valid inverse kinematic solution; then each of them was assigned to a different color, ranging from magenta to green (see the colorbar in Figure 11 for the selected value), which formed a so-called task-oriented kinematic capability map, illustrated in Figure 11 for each path segment. The magenta-colored areas represent the placement with the lowest feasible linear velocity (the worst robot kinematic capabilities for the desired task), and the green-colored areas represent locations with the maximum value of the feasible linear velocity (the best robot kinematic capabilities for the desired task). Since V max is related to Ω max by Ω max = h 1 V max , the distribution of the colormap would be the same for Ω max , only scaled by h 1 . The randomly chosen initial placements of each considered segment (see Figure 8) are denoted by the white point on the generated task-oriented kinematic capability maps, while the locations with the highest maximum linear velocity V max are represented by the black point.
As shown in Figure 11, the distribution of the maximum linear velocity V max based on the proposed DTF method varied greatly according to the task requirements. Although the considered direction of the linear velocity vector u ^ T was pointing in almost the same direction in the case of path segments (i) and (iii) (see Table 3 and Figure 9), the best locations to perform a required movement were not located in the same place in the robot workspace since the requirements for rotational movement were quite different. An even greater difference in the distribution of the maximum linear velocity can be seen for path segment (ii), where the angular motion dominated the linear.
The feasible directional kinematic capabilities for the best placement of each path segment are presented in Table 5. In comparison to the maximum kinematic capabilities from Table 4, much higher linear velocity can be achieved under the same joint velocity constraints (8).
By the optimal placement of the workpiece with the considered machining path, a great improvement in the linear velocity amplitude can be achieved, while keeping the same desired base task parameters ( u ^ T , u ^ R , h ). The improvement of the maximum linear velocity for all three path segments are shown in percentages in Table 6.
Similar to Figure 9, the maximum linear and angular velocity vectors based on the proposed DTF method are shown with respect to the translational and rotational manipulability polytope in both the weak and the strong senses, respectively, in Figure 12. The shape of each polytope and the amplitude of each vector were quite different in comparison to the initial placement of the task segments, and even if the considered task requirements ( u ^ T , u ^ R , h ) were the same.

4. Discussion and Conclusions

When planning a feasible robotic task, the required joint capabilities should be lower than the maximum capabilities available. To evaluate the feasible kinematic directional capabilities for robot machining, an approach called the Decomposed Twist Feasibility (DTF) method has been proposed in this paper. The basic idea behind the proposed DTF method is to find the maximal feasible directional kinematic capabilities in an operational space, individually for translational and rotational performances, under the robot joint velocity constraints. The method was algebraically derived and described by the manipulability polytopes as well. In contrast to the conventional manipulability methods, the proposed DTF method can provide accurate and dimensionally homogeneous information on how fast the robot end-effector can move under the constraint of joint velocities while maintaining the base task requirements. It can give us reliable information about the maximum linear and angular velocities when synchronized translational/rotational motion is required. A graphical representation of the proposed DTF method was presented by the twist manipulability polytope in the case of a generic 3DOF planar mechanism. Although we gave individual consideration to the translational and rotational capabilities in the proposed DTF method, the presented results show that the tip of the resulting maximum feasible twist velocity vector obtained by (30)–(33) always ends on the surface of the well-known twist manipulability polytope at the given joint velocity constraint (8), which verifies the method. In comparison to the conventional analysis of the twist manipulability polytope—which requires a computation of its vertices, the construction of the corresponding convex hull, and a further computation analysis of the convex hull in order to determine the intersection point with the polytope surface in the desired direction—the computational complexity can be reduced significantly by the DTF method, and the accuracy of the resulting information is maintained as well. The usefulness was demonstrated, especially in the case of the robot machining task purpose on a generic 3DOF planar mechanism and the collaborative robot UR5e. The maximum feasible linear velocity, considering the desired rotational motion, was determined in order to follow a specific path segment on the workpiece surface. The regions with the highest and lowest maximum feasible linear velocities were determined and then illustrated by the colormap, which forms the so-called task-oriented kinematic capability map.
In conclusion it should be noted that the proposed DTF method addresses a purely kinematic performance measure. To provide feasible and optimal workpiece placement, the dynamic performances regarding the given task parameters should also be considered. In order to find an optimal workpiece placement for the entire tool path, the maximum linear velocity should be calculated for each path segment, or at least for the most critical ones. Thus, the proposed DTF method could be used as a suitable optimization criterion for optimal task-oriented workpiece placement within the robot’s workspace.

Author Contributions

The presented work was carried out in collaboration and with significant contributions from both authors. S.S.: conceptualization, derivation of the proposed method, software, validation, analysis, writing—original draft preparation; A.H.: methodology, derivation of the proposed method, formal analysis, writing—review and editing, supervision. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Slovenian Research Agency (ARRS) under a grant for the research program P2–0028, and in part by the project of the Republic of Slovenia and the European Union from the European Regional Development Fund, ROBOTOOL-1, grant number OP20.03540.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Costa, G.D.M.; Petry, M.R.; Moreira, A.P. Augmented Reality for Human–Robot Collaboration and Cooperation in Industrial Applications: A Systematic Literature Review. Sensors 2022, 22, 2725. [Google Scholar] [CrossRef] [PubMed]
  2. Gajšek, B.; Stradovnik, S.; Hace, A. Sustainable Move towards Flexible, Robotic, Human-Involving Workplace. Sustainability 2020, 12, 6590. [Google Scholar] [CrossRef]
  3. Hwang, P.-J.; Hsu, C.-C.; Chou, P.-Y.; Wang, W.-Y.; Lin, C.-H. Vision-Based Learning from Demonstration System for Robot Arms. Sensors 2022, 22, 2678. [Google Scholar] [CrossRef] [PubMed]
  4. Khawaja, F.I.; Kanazawa, A.; Kinugawa, J.; Kosuge, K. A Human-Following Motion Planning and Control Scheme for Collaborative Robots Based on Human Motion Prediction. Sensors 2021, 21, 8229. [Google Scholar] [CrossRef] [PubMed]
  5. Engemann, H.; Du, S.; Kallweit, S.; Cönen, P.; Dawar, H. OMNIVIL—An Autonomous Mobile Manipulator for Flexible Production. Sensors 2020, 20, 7249. [Google Scholar] [CrossRef]
  6. Himmelsbach, U.B.; Wendt, T.M.; Hangst, N.; Gawron, P.; Stiglmeier, L. Human–Machine Differentiation in Speed and Separation Monitoring for Improved Efficiency in Human–Robot Collaboration. Sensors 2021, 21, 7144. [Google Scholar] [CrossRef]
  7. Malhan, R.K.; Shembekar, A.V.; Kabir, A.M.; Bhatt, P.M.; Shah, B.; Zanio, S.; Nutt, S.; Gupta, S.K. Automated planning for robotic layup of composite prepreg. Robot. Comput. Manuf. 2020, 67, 102020. [Google Scholar] [CrossRef]
  8. Kim, J.H.; Choi, K.; Jang, I.G. Model-Predictive-Control-Based Time-Optimal Trajectory Planning of the Distributed Actuation Mechanism Augmented by the Maximum Performance Evaluation. Appl. Sci. 2021, 11, 7513. [Google Scholar] [CrossRef]
  9. Makhal, A.; Goins, A. Reuleaux: Robot Base Placement by Reachability Analysis. In Proceedings of the 2018 Second IEEE International Conference on Robotic Computing (IRC), Laguna Hills, CA, USA, 31 January–2 February 2018; pp. 137–142. [Google Scholar]
  10. Zacharias, F.; Borst, C.; Wolf, S.; Hirzinger, G. The capability map: A tool to analyze robot arm workspaces. Int. J. Hum. Robot. 2013, 10, 1350031. [Google Scholar] [CrossRef]
  11. Ye, C.; Yang, J.; Zhao, H.; Ding, H. Task-dependent workpiece placement optimization for minimizing contour errors induced by the low posture-dependent stiffness of robotic milling. Int. J. Mech. Sci. 2021, 205, 106601. [Google Scholar] [CrossRef]
  12. Vosniakos, G.-C.; Matsas, E. Improving feasibility of robotic milling through robot placement optimisation. Robot. Comput. Manuf. 2010, 26, 517–525. [Google Scholar] [CrossRef]
  13. Henao, J.C.R.; Garzón, J.A.J.; Muñoz, L.D. Manipulability index study on the KUKA robot KR5 ARC HW. In Proceedings of the 2012 XVII Symposium of Image, Signal Processing, and Artificial Vision (STSIVA), Medellin, Colombia, 12–14 September 2012; pp. 72–77. [Google Scholar]
  14. Malhan, R.K.; Kabir, A.M.; Shah, B.; Gupta, S.K. Identifying Feasible Workpiece Placement with Respect to Redundant Manipulator for Complex Manufacturing Tasks. In Proceedings of the 2019 International Conference on Robotics and Automation (ICRA), Montreal, QC, Canada, 20–24 May 2019; pp. 5585–5591. [Google Scholar] [CrossRef]
  15. Skuric, A.; Padois, V.; Daney, D. On-line force capability evaluation based on efficient polytope vertex search. In Proceedings of the 2019 International Conference on Robotics and Automation (ICRA), Montreal, QC, Canada, 20–24 May 2021; pp. 1700–1706. [Google Scholar] [CrossRef]
  16. Wang, G.; Li, W.; Jiang, C.; Zhu, D.; Li, Z.; Xu, W.; Zhao, H.; Ding, H. Trajectory Planning and Optimization for Robotic Machining Based On Measured Point Cloud. IEEE Trans. Robot. 2021, 1–17. [Google Scholar] [CrossRef]
  17. Stravopodis, N.; Valsamos, C.; Moulianitis, V.C. Experimental Verification of Optimized Anatomies on a Serial Metamorphic Manipulator. Sensors 2022, 22, 918. [Google Scholar] [CrossRef] [PubMed]
  18. Malhan, R.; Kabir, A.; Shah, B.; Centea, T.; Gupta, S. Determining Feasible Robot Placements in Robotic Cells for Composite Prepreg Sheet Layup. In Proceedings of the 14th International Manufacturing Science and Engineering Conference, Erie, PA, USA, 10–14 June 2019. [Google Scholar]
  19. Schwartz, E.; Manseur, R.; Doty, K. Noncommensurate systems in robotics. Int. J. Robot. Automat. 2002, 17, 86–92. [Google Scholar]
  20. Bruyninckx, H. Robot Kinematics and Dynamics; Katholieke Universiteit Leuven, Department of Mechanical Engineering: Leuven, Belgium, 2021. [Google Scholar]
  21. Yoshikawa, T. Manipulability of Robotic Mechanisms. Int. J. Robot. Res. 1985, 4, 3–9. [Google Scholar] [CrossRef]
  22. Zhang, L.; Guo, S.; Huang, Y.; Xiong, X. Kinematic Singularity Analysis and Simulation for 7DOF Anthropomorphic Manipulator. Int. J. Mechatron. Appl. Mech. 2019, 6, 157–164. [Google Scholar]
  23. Feng, Y.; Fang, L.; Bu, W.; Kang, J. Multi-objective Optimization for Design of Redundant Serial Robots. In Proceedings of the 2020 Chinese Automation Congress (CAC), Shanghai, China, 6–8 November 2020. [Google Scholar]
  24. Chiu, S.L. Task Compatibility of Manipulator Postures. Int. J. Robot. Res. 1988, 7, 13–21. [Google Scholar] [CrossRef]
  25. Dubey, R.; Luh, J.Y.S. Redundant robot control using task based performance measures. J. Robot. Syst. 1988, 5, 409–432. [Google Scholar] [CrossRef]
  26. Kokkinis, T.; Paden, B. Kinetostatic performance limits of cooperating robot manipulators using force-velocity polytopes. In Proceedings of the ASME Winter Annual Meeting-Robotics Research, Monterey, CA, USA, 8–9 November 1999; Volume 14. [Google Scholar]
  27. Choi, H.; Ryu, J. Convex hull-based power manipulability analysis of robot manipulators. In Proceedings of the 2012 IEEE International Conference on Robotics and Automation, Saint Paul, MN, USA, 14–18 May 2012; pp. 2972–2977. [Google Scholar]
  28. Jihong, L.; Won, K.T. Inverse kinematic solution based on decomposed manipulability. In Proceedings of the Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C), Detroit, MI, USA, 10–15 May 1999; Volume 1512, pp. 1514–1519. [Google Scholar]
  29. Staffetti, E.; Bruyninckx, H.; De Schutter, J. On the Invariance of Manipulability Indices. In Advances in Robot Kinematics; Springer: Cham, The Netherland, 2002; pp. 57–66. [Google Scholar] [CrossRef] [Green Version]
  30. Bicchi, A.; Prattichizzo, D. Manipulability of cooperating robots with unactuated joints and closed-chain mechanisms. IEEE Trans. Robot. Autom. 2000, 16, 336–345. [Google Scholar] [CrossRef] [Green Version]
  31. Wang, Y.; Wang, L. Reactive task-oriented redundancy resolution using constraint-based programming. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Daejeon, Korea, 9–14 October 2016; pp. 5689–5694. [Google Scholar]
  32. Boschetti, G. A Novel Kinematic Directional Index for Industrial Serial Manipulators. Appl. Sci. 2020, 10, 5953. [Google Scholar] [CrossRef]
  33. Boschetti, G.; Rosa, R.; Trevisani, A. Parallel Robot Translational Performance Evaluation through Direction-Selective Index (DSI). J. Robot. 2011, 2011, 1–14. [Google Scholar] [CrossRef]
  34. Mansouri, I.; Ouali, M. The power manipulability – A new homogeneous performance index of robot manipulators. Robot. Comput. Manuf. 2011, 27, 434–449. [Google Scholar] [CrossRef]
  35. Finotello, R.; Grasso, T.; Rossi, G.; Terribile, A. Computation of kinetostatic performances of robot manipulators with polytopes. In Proceedings of the IEEE International Conference on Robotics and Automation (Cat. No.98CH36146), Leuven, Belgium, 20 May 1998; Volume 3244, pp. 3241–3246. [Google Scholar]
  36. Yoshikawa, T. Translational and rotational manipulability of robotic manipulators. In Proceedings of the IECON ‘91: 1991 International Conference on Industrial Electronics, Control and Instrumentation, Kobe, Japan, 28 October-1 November 1991; Volume 1172, pp. 1170–1175. [Google Scholar]
  37. Long, P.; Padir, T.; Padır, T. Constrained Manipulability for Humanoid Robots Using Velocity Polytopes. Int. J. Hum. Robot. 2019, 17, 1950037. [Google Scholar] [CrossRef]
  38. Moulianitis, V.; Katrantzis, E.; Stravopodis, N.; Aspragathos, N. A Comparative Study of Three Manipulator Performance Measures. In Proceedings of the 27th International Conference on Robotics in Alpe-Adria Danube Region (RAAD 2018), Patras, Greece, 6–8 June 2018; Springer: Cham, Switzerland, 2018; pp. 19–27. [Google Scholar]
  39. Mansfeld, N.; Keppler, M.; Haddadin, S. Speed Gain in Elastic Joint Robots: An Energy Conversion-Based Approach. IEEE Robot. Autom. Lett. 2021, 6, 4600–4607. [Google Scholar] [CrossRef]
  40. Kim, J.H.; Shin, Y.J.; Jang, I.G. Evaluating the Maximum Directional Kinematic Capability of a Redundant Manipulator Based on Allowable Velocity and Force. IEEE Access 2021, 9, 88085–88097. [Google Scholar] [CrossRef]
  41. Marais, W.J.; Williams, S.B.; Pizarro, O. Anisotropic Disturbance Rejection for Kinematically Redundant Systems With Applications on an UVMS. IEEE Robot. Autom. Lett. 2021, 6, 7017–7024. [Google Scholar] [CrossRef]
  42. Hernansanz, A.; Amat, J.; Casals, A. Optimization criterion for safety task transfer in cooperative robotics. In Proceedings of the 2009 International Conference on Advanced Robotics, Munich, Germany, 22–26 June 2009; pp. 1–6. [Google Scholar]
  43. Jihong, L. A study on the manipulability measures for robot manipulators. In Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems, Innovative Robotics for Real-World Applications, IROS ‘97, Genova, Italy, 11 September 1997; Volume 1453, pp. 1458–1465. [Google Scholar]
  44. Bicchi, A.; Melchiorri, C.; Balluchi, D. On the mobility and manipulability of general multiple limb robots. IEEE Trans. Robot. Autom. 1995, 11, 215–228. [Google Scholar] [CrossRef]
  45. Choi, H.-B.; Ryu, J. Convex hull-based velocity transmission capability of parallel manipulators. Int. J. Adv. Manuf. Technol. 2012, 65, 695–704. [Google Scholar] [CrossRef]
  46. Lee, J. A structured algorithm for minimum l∞-norm solutions and its application to a robot velocity workspace analysis. Robotica 2001, 19, 343–352. [Google Scholar] [CrossRef]
  47. Lee, J. Velocity workspace analysis for multiple arm robot systems. Robotica 2001, 19, 581–591. [Google Scholar] [CrossRef]
  48. Cyrus, M.; Beck, J. Generalized two- and three-dimensional clipping. Comput. Graph. 1978, 3, 23–28. [Google Scholar] [CrossRef]
  49. Pholsiri, C.; Kapoor, C.; Tesar, D. Real-Time Robot Capability Analysis. In Proceedings of the ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Long Beach, CA, USA, 24–28 September 2005; pp. 973–982. [Google Scholar]
Figure 1. Example of a manipulability polytope representation based on the 3DOF planar manipulator: (a) Joint velocity polytope Q and the minimum L norm solution of joint velocities represented by Q T ; the task space polytopes P t w i s t and P T in the isometric view (b), and in the top view (c).
Figure 1. Example of a manipulability polytope representation based on the 3DOF planar manipulator: (a) Joint velocity polytope Q and the minimum L norm solution of joint velocities represented by Q T ; the task space polytopes P t w i s t and P T in the isometric view (b), and in the top view (c).
Sensors 22 04267 g001
Figure 2. Example of a manipulability polytope representation based on the 3DOF planar manipulator: (a) Joint velocity polytope Q , the minimum L norm solution of joint velocities represented by Q T , and the least L 2 norm solution of joint velocities represented by Q 2 T ; the task space polytopes P t w i s t , P T , P T , and P 2 T in the isometric view (b), and in the top view (c).
Figure 2. Example of a manipulability polytope representation based on the 3DOF planar manipulator: (a) Joint velocity polytope Q , the minimum L norm solution of joint velocities represented by Q T , and the least L 2 norm solution of joint velocities represented by Q 2 T ; the task space polytopes P t w i s t , P T , P T , and P 2 T in the isometric view (b), and in the top view (c).
Sensors 22 04267 g002
Figure 3. Example of a manipulability polytope representation based on the 3DOF planar manipulator: (a) Joint velocity polytope Q, the minimum L norm solution of the joint velocities represented by Q T , the least L 2 norm solution of the joint velocities represented by Q 2 T , and the intersection between the joint velocity polytope Q and the null space N ( J R ) represented by Q s t r o n g T ; the task space polytopes P t w i s t , P T , P 2 T , and P s t r o n g T in the isometric view (b) and in the top view (c).
Figure 3. Example of a manipulability polytope representation based on the 3DOF planar manipulator: (a) Joint velocity polytope Q, the minimum L norm solution of the joint velocities represented by Q T , the least L 2 norm solution of the joint velocities represented by Q 2 T , and the intersection between the joint velocity polytope Q and the null space N ( J R ) represented by Q s t r o n g T ; the task space polytopes P t w i s t , P T , P 2 T , and P s t r o n g T in the isometric view (b) and in the top view (c).
Sensors 22 04267 g003
Figure 4. Graphical representation of the proposed DTF method with the twist manipulability polytope P t w i s t (left), and in a detailed view (right).
Figure 4. Graphical representation of the proposed DTF method with the twist manipulability polytope P t w i s t (left), and in a detailed view (right).
Sensors 22 04267 g004
Figure 5. Twist polytope P t w i s t with the iso-curves of the same task requirements (h = const.); (a,c,f,h) a polytope-based representation of the feasible angular velocity ( ω max —blue) for (i) a concave path segment, (ii) a convex path segment, (iii) a flat path segment, and (iv) a flat convex path segment, respectively; (b,d,e,g) a polytope-based representation of the feasible linear velocity ( v max —red) for (i) a concave path segment, (ii) a convex path segment, (iii) a flat path segment, and (iv) a flat convex path segment, respectively.
Figure 5. Twist polytope P t w i s t with the iso-curves of the same task requirements (h = const.); (a,c,f,h) a polytope-based representation of the feasible angular velocity ( ω max —blue) for (i) a concave path segment, (ii) a convex path segment, (iii) a flat path segment, and (iv) a flat convex path segment, respectively; (b,d,e,g) a polytope-based representation of the feasible linear velocity ( v max —red) for (i) a concave path segment, (ii) a convex path segment, (iii) a flat path segment, and (iv) a flat convex path segment, respectively.
Sensors 22 04267 g005
Figure 6. Three different parts of the curved path: (i) Slightly curved path segment; (ii) Strongly curved path segment; (iii) Flat path segment.
Figure 6. Three different parts of the curved path: (i) Slightly curved path segment; (ii) Strongly curved path segment; (iii) Flat path segment.
Sensors 22 04267 g006
Figure 7. Graphical representation of vmax and ω max by the DTF method for a generic 3DOF planar robot manipulator in relation to its manipulability polytopes P t w i s t , P T , and P s t r o n g T , respectively, for segment (i): (a) the 3D projection view; (b) the v x ω plane view; (c) the v x v y plane view; segment (ii): (d) the 3D projection view; (e) the v x ω plane view; (f) the v x v y plane view; segment (iii): (g) the 3D projection view; (h) the v x ω plane view; (j) the v x v y plane view.
Figure 7. Graphical representation of vmax and ω max by the DTF method for a generic 3DOF planar robot manipulator in relation to its manipulability polytopes P t w i s t , P T , and P s t r o n g T , respectively, for segment (i): (a) the 3D projection view; (b) the v x ω plane view; (c) the v x v y plane view; segment (ii): (d) the 3D projection view; (e) the v x ω plane view; (f) the v x v y plane view; segment (iii): (g) the 3D projection view; (h) the v x ω plane view; (j) the v x v y plane view.
Sensors 22 04267 g007
Figure 8. Collaborative robot UR5e with three different parts of the curved surface: (i) a flat path segment; (ii) a strongly curved path segment; (iii) a slightly curved path segment.
Figure 8. Collaborative robot UR5e with three different parts of the curved surface: (i) a flat path segment; (ii) a strongly curved path segment; (iii) a slightly curved path segment.
Sensors 22 04267 g008
Figure 9. Graphical representation of vmax and ω max and determined by the DTF method for the 6DOF UR5e robot manipulator in relation to its manipulability polytopes within the translational subspace P T , P s t r o n g T , and the rotational subspace P R and P s t r o n g R , respectively, for segment (i): (a) v max and (b) ω max ; for segment (ii): (c) v max and (d) ω max ; and for segment (iii): (e) v max and (f) ω max .
Figure 9. Graphical representation of vmax and ω max and determined by the DTF method for the 6DOF UR5e robot manipulator in relation to its manipulability polytopes within the translational subspace P T , P s t r o n g T , and the rotational subspace P R and P s t r o n g R , respectively, for segment (i): (a) v max and (b) ω max ; for segment (ii): (c) v max and (d) ω max ; and for segment (iii): (e) v max and (f) ω max .
Sensors 22 04267 g009
Figure 10. Discretization of the robot workspace.
Figure 10. Discretization of the robot workspace.
Sensors 22 04267 g010
Figure 11. The task-oriented kinematic capability map based on the DTF method for: (a) Segment (i); (b) Segment (ii); (c) Segment (iii).
Figure 11. The task-oriented kinematic capability map based on the DTF method for: (a) Segment (i); (b) Segment (ii); (c) Segment (iii).
Sensors 22 04267 g011
Figure 12. Graphical representation of v max and ω max for the best path segment placement, determined by the DTF method for the 6DOF UR5e robot manipulator in relation to its manipulability polytopes within the translational subspaces P T , P s t r o n g T , and rotational subspaces P R and P s t r o n g R , respectively, for segment (i): (a) v max and (b) ω max ; for segment (ii): (c) v max and (d) ω max ; and for segment (iii): (e) v max and (f) ω max .
Figure 12. Graphical representation of v max and ω max for the best path segment placement, determined by the DTF method for the 6DOF UR5e robot manipulator in relation to its manipulability polytopes within the translational subspaces P T , P s t r o n g T , and rotational subspaces P R and P s t r o n g R , respectively, for segment (i): (a) v max and (b) ω max ; for segment (ii): (c) v max and (d) ω max ; and for segment (iii): (e) v max and (f) ω max .
Sensors 22 04267 g012
Table 1. Task requirements for three different path segments (3 DOF manipulator).
Table 1. Task requirements for three different path segments (3 DOF manipulator).
Path SegmentPosition u ^ T u ^ R h
(i)X: 0.7720, Y: 0.3882 0 . 7720 0 . 3882 + 1 1.3231
(ii)X: 1.0340, Y: 0.2374 1 . 0340 0 . 2374 + 1 0.0493
(iii)X: 1.1640, Y: 0.3877 1 . 1640 0 . 3877 1 62.4704
Table 2. Feasible directional kinematic capabilities for three different path segments (3 DOF manipulator).
Table 2. Feasible directional kinematic capabilities for three different path segments (3 DOF manipulator).
Path Segment V max ( m / s ) Ω max ( rad / s ) θ ˙ ( rad / s )
(i)1.14390.8646 0 . 7471 0 . 6117 1 . 0000
(ii)0.04890.9935 0 . 4469 0 . 4534 1 . 0000
(iii)0.94710.0152 0 . 1118 1 . 0000 0 . 9034
Table 3. Task requirements for three different path segments (UR5e).
Table 3. Task requirements for three different path segments (UR5e).
Path Segment u ^ T u ^ R h
(i) 0 . 9999 0 0 . 0117 T 0 . 6209 0 . 7625 0 . 1820 T 4.4632
(ii) 0 . 9893 0 0 . 1459 T 0 . 0865 0 . 9761 0 . 1994 T 0.0360
(iii) 0 . 9992 0 0 . 0411 T 0 . 9997 0 . 0249 0 . 0011 T 0.7454
Table 4. Feasible directional kinematic capabilities for three different path segments (UR5e).
Table 4. Feasible directional kinematic capabilities for three different path segments (UR5e).
Path Segment V max ( m / s ) Ω max ( rad / s ) θ ˙ ( rad / s )
(i)1.15520.2588 0 . 9854 ,   1 . 7508 ,   3 . 1416 ,   1 . 2716 ,   0 . 1298 ,   0 . 9807 T
(ii)0.06991.9391 0 . 3208 , 1 . 2202 ,   2 . 4198 ,   3 . 1416 ,   0 . 7500 ,   0 . 8459 T
(iii)2.43653.2688 3 . 1063 ,   1 . 6537 ,   2 . 7480 ,   1 . 4495 ,   2 . 2663 ,   3 . 1416 T
Table 5. Feasible directional kinematic capabilities for three different path segments—best placement.
Table 5. Feasible directional kinematic capabilities for three different path segments—best placement.
Path Segment V max ( m / s ) Ω max ( rad / s ) θ ˙ ( rad / s )
(i)2.73510.6128 3 . 1416 , 1 . 6230 ,   3 . 1328 ,   1 . 5284 ,   1 . 2614 ,   3 . 0600 T
(ii)0.16564.5959 3 . 0173 , 2 . 9210 ,   2 . 8698 ,   2 . 7092 ,   2 . 9541 ,   3 . 1416 T
(iii)2.66053.5693 3 . 1416 , 2 . 0760 ,   2.9403 ,   1.6904 , 2.3072 ,   3.1057 T
Table 6. Comparison between the maximum linear velocity for the initial and best placements.
Table 6. Comparison between the maximum linear velocity for the initial and best placements.
Path Segment V max ( m / s ) Initial   Placement Ω max ( rad / s ) Best   Placement %
(i)1.15522.7351136.77
(ii)0.06990.1656136.91
(iii)2.43652.66059.19
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Stradovnik, S.; Hace, A. Task-Oriented Evaluation of the Feasible Kinematic Directional Capabilities for Robot Machining. Sensors 2022, 22, 4267. https://doi.org/10.3390/s22114267

AMA Style

Stradovnik S, Hace A. Task-Oriented Evaluation of the Feasible Kinematic Directional Capabilities for Robot Machining. Sensors. 2022; 22(11):4267. https://doi.org/10.3390/s22114267

Chicago/Turabian Style

Stradovnik, Saša, and Aleš Hace. 2022. "Task-Oriented Evaluation of the Feasible Kinematic Directional Capabilities for Robot Machining" Sensors 22, no. 11: 4267. https://doi.org/10.3390/s22114267

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop