Cable Path Optimization by Fixing Multiple Guides
Cable Path Optimization by Fixing Multiple Guides
Research Article
Keywords: industrial robot arm, cable path optimization, cable geometry simulation, Hermite interpolation,
rotation minimizing frame
DOI: https://doi.org/10.21203/rs.3.rs-2906743/v1
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Read Full License
Cable Path Optimization by Fixing Multiple Guides on One Link for
Industrial Robot Arms
1
Software Development Dept., Controller Div., Product Business Division H.Q.,
Industrial Automation Company, Omron Corporation, Shimogyo-ku, Kyoto 600-8530,
Japan
2
Graduate School of Science and Engineering, Yamaguchi University, Ube, Yamaguchi
755-8611, Japan
3
Department of Mechanical Engineering and Science, Kyoto University, Kyodai-
katsura, Nishikyo-ku, Kyoto 615-8540, Japan
4
Department of Electronics and Information Systems Engineering, Osaka Institute of
Technology, 5-16-1 Omiya, Asahi-ku, Osaka, 535-8585, Japan
1. Introduction
Robot arms are an essential part of the production equipment in the industrial sector: ~3.0
million units are reported to be in use worldwide in 2021, with ~380,000 new units
shipped [1]. The robot arm is outfitted with external cables for the purpose of mediating
actuators, video and sensor control, power supply, pneumatics, and so on. Cable path
design is carried out with the objective of not interfering with the motion, i.e., avoiding
damage to the cable caused by motion. The engineer repeats the cable path design and
implementation testing while observing the robot motion. While these series of trial-and-
error processes are mentally and physically demanding, they are also time-constrained in
the sense that work delays can delay the start of the production line.
In cable path optimization, it is necessary to physically simulate the geometric
deformation of the cable due to the joint angle transition of the robot arm. Cosserat theory
[2] is a fundamental theory of micropolar elastic bodies for describing cables, defining
independent degrees of freedom of translation, and rotation for each element of the cable.
Spillmann and Teschner [3] established a model that divides the cable into one-
dimensional (1D) discrete elements along the centerline. They defined the position and
orientation of each cable element and calculated the continuous deformation energy of
each element using the finite element method. Hergenröther and Dähne [4] divided the
cable into rigid cylindrical elements and connected them with ball joints. Meanwhile,
Grégoire and Schömer [5] represented bending and torsional energy separately and
employed a generalized mass-spring model. Loock and Schömer [6] presented cable
torsion using torsion springs. Lv et al. [7] performed physical simulations of cable
harnesses, using linear springs for stretch, bending springs for bending, and torsion
springs for geometric and material torsion. The position-based dynamics (PBD)
framework has been proposed to increase simulation speed and stabilize rigid-body
collision detection [8]. It has been implemented in physics engines such as Bullet [9],
Havok [10], and PhysX [11]. In this study, the PhysX spring model is employed for cable
geometry simulation.
Kressin [12] and Carlson et al. [13] applied the cable dress pack geometry
simulation to the robot path optimization problem to estimate the path with less stress on
the cable dress pack. A dress pack is a flexible tubular part attached to the robot arm to
protect the cable. Hermansson et al. [14] optimized motions with respect to quasi-static
motion and deformation by introducing inertia into the system. These approaches
optimize the robot trajectory by fixing the configuration of the dress pack, i.e., the cable
path. However, they do not discuss the optimization of the cable path itself.
Iwamura et al. [15] proposed a cable path optimization method for given Pick-
and-Place motions. The entire cable was decomposed into cable segments separated by
guide positions. A candidate set of parameter vectors (PVs) consisting of the cable
segment lengths and the configurations of the guides at both ends was prepared. Cable
stress was quantified by physically simulating the cable segment geometry during motion
for each PV. However, this tracking was considerably burdensome. Therefore, Iwamura
et al. [16] defined several static robot poses that are prone to cable stress during motion
as critical poses. The cable stresses for these critical poses were quantified with the
significantly reduced burden.
This paper discusses the design of the optimal cable path for a given robot motion.
Here, the motions of the robot arm are roughly classified into two types. The first is a
simple motion in which the end link accesses the object from above only, as in Pick-and-
Place operations. The other is a complex motion in which the end link accesses the object
from multiple directions, as in assembly or inspection operations. Compared to simple
motions, complex motions tend to make cable path design more difficult because of the
variety of robot arm working poses. Several attempts to observe or imitate the procedures
of experts to solve engineering problems have been reported [17, 18]. Therefore, we
observed the procedures of cable path design experts and found the following. In the
design of experts for simple motions, basically, one guide is attached to one link.
Meanwhile, for complex motions, multiple guides are often attached to one link. This can
be interpreted as an attempt to limit the movement of the cable by increasing the guides
for a given motion to avoid interference with the peripheral objects and lessen bending
cable fatigue at the connection to sensor devices and other equipment.
This study proposes a cable path optimization method that handles complex
motions by fixing multiple guides on one link. As the number of guides increases, the
computational burden increases due to the expansion of the solution search space. As a
result of profiling the computational burden of each process in the previous method [16],
the computation of connected geometry turned out to have a relatively heavy burden. The
connected geometry is the geometry of the cable segment that connects the guides at both
ends and is used as an initial geometry in the physical simulation considering gravity to
determine the convergent geometry of the cable segment. Fig. 1 shows the iterative
deformation of the cable segment in the previous method [16]. The simulation of the cable
segment geometry starts with the linear geometry, which connects one end to one guide
(Fig. 1(a)) and moves the other end to match the other guide kinematically (Fig. 1(b)–
(d)). However, the process of transforming the linear geometry into a cable segment
geometry connecting the guides, i.e., the connected geometry (Fig. 1(d)), was
computationally demanding. Therefore, in addition to the above-mentioned proposal, fast
connected geometry computation using Hermite interpolation [19] and rotation
minimizing frame (RMF) [20] is proposed.
(a)1st step (b) 33rd step (c) 66th step (d) 100th step
Fig. 1 Deformation of a cable segment from the linear geometry (1st step) to the
connected geometry (100th step) in the previous study
The reason for employing a Hermite interpolation is that the geometry can be
computed simply by giving the positions and tangent vectors of the two ends. For an nth-
order spline interpolation [21], n+1 control points through which the cable segment passes
are required. For an nth-order Bezier curve [22], n+1 control points are required between
the start and end points. However, no control points other than the start and end points
are passed through. Spline and Bezier curves are unsuitable for computing cable geometry
between guides because these control points are not given. The Frenet–Serret formula is
widely used to calculate interpolating coordinate systems. However, continuity between
adjacent coordinate systems is not guaranteed [23]. Therefore, RMF is employed to solve
this problem.
The rest of this paper is organized as follows. Section 2 presents the modeling and
problem setting. Section 3 describes the proposed method. Section 4 discusses the
reduction of computational burden for connected geometry of cable segments. Sections 5
and 6 present the simulation and experimental results, respectively. Finally, Section 7
provides the conclusion.
2. Modeling and problem setting
2.2.Problem setting
As in the previous works [15, 16], the objective of this study is to design a cable path with
the shortest cable length that satisfies three stress constraints for a given robot motion.
The cable path is represented by (𝑆1 , … , 𝑆𝑀 , 𝑃1 , … , 𝑃𝑀+1 ), which includes the length of
the cable segment 𝑆𝑚 and the configuration 𝑃𝑚 of the guides supporting both ends of the
cable segment. This parameter vector is called the entire cable parameter vector (ECPV).
Then the cable path design can be formulated as an optimization problem with respect to
the ECPV, which is shown in the following equation.
𝑠ubject to
for 0 ≤ 𝑡 ≤ 𝑇, 𝑚 = 1,2, … , 𝑀,
In this study, we propose a cable path optimization method for a complex motion as an
extension of the previous methods [15, 16]. As described in Section 1, the previous
1)
method [16] performs static cable geometry simulation for critical poses in the
attachment test to reduce the number of PV candidates and then applies dynamic cable
geometry simulation for robot motions in the motion test to find the ECPV with the
shortest cable length that satisfies the stress and robustness constraints. Note that the
previous method, which assumes only simple motion, fixed up to one guide to one link
so that the attachment test dealt with only the inter-link segments. On the other hand, the
proposed method fixes more than two guides to one link so that the attachment test deals
with both the inter-link and intra-link cables. This allows us to realize the cable path
optimization for the complex motion.
1)
Critical poses [16] are robot poses that are prone to applying stress to the cable with impulse,
stretching, bending, and other movements. Various critical poses are extracted for each cable segment
based on the robot motion. A critical pose is defined as a set of joint angles with a global extreme
value. In critical poses, satisfying the stress constraints in Eq. (1) is difficult. Herein, it is assumed that
if a cable path can satisfy the stress constraints in all critical poses, the cable path can also satisfy the
stress constraints in other motion poses.
(b) Inter-link Attachment test module
𝐷1,𝑚 The PV candidate set satisfying stress constraints in the attachment test
𝐷2,𝑚 The PV candidate set satisfying stress constraints and a robustness constraint
on the cable length in the attachment test
𝐷′0,𝑚 The PV candidate set satisfying the adjacency condition between 𝐷0,𝑚 and
𝐷2,𝑚−1 of 𝐶𝑚−1 in the attachment test
𝐷3 The ECPV set satisfying the adjacency condition between all cable segments
𝑑̂ The ECPV candidate with the shortest entire cable length in 𝐷3 in the motion test
𝑑∗ The optimal ECPV satisfying the stress and robustness constraints and the
adjacency condition with the shortest entire cable length
Hermite interpolation and RMF are employed to reduce the computation burden for
generating the connected geometry of the cable sub-segments. At first, Hermite
interpolation is used to calculate the positions of the sub-segments. However, due to the
nature of Hermite interpolation [19], the interpolated points are not uniformly spaced.
Therefore, sampling and linear interpolation are used to calculate uniformly spaced sub-
segment positions. The orientations of the sub-segment positions are then obtained using
RMF [20] based on the sub-segment positions and the orientation of the start guide. Next,
the error of the torsion angle between the orientations of the end sub-segment and the end
guide is obtained. Finally, the orientation of each sub-segment is proportionally modified
based on the obtained error so that the end sub-segment and the end guide have the same
orientation and all the sub-segments have continuous orientations.
The connected geometry of a cable segment is given by the sub-segment positions
{𝑝𝑠 |1 ≤ s ≤ 𝑆} and orientations {𝑞𝑠 |1 ≤ s ≤ 𝑆}, where 𝑆 = 𝑆𝑚 + 1 since the geometry
is represented with 𝑆𝑚 sub-segments of 𝐶𝑚 and the first sub-segment of 𝐶𝑚+1 as
described in Fig. 3. Let us describe how to calculate {𝑝𝑠 } and {𝑞𝑠 } using the Hermite
interpolation and RMF.
Given the positions of the endpoints (𝑃̂0 and 𝑃̂1 ) and tangent vectors (𝑉̂0 and 𝑉̂1 )
associated with 𝑃̂0 and 𝑃̂1 , the cubic Hermite interpolated points 𝑝(𝑡) are obtained by
where t is a parameter with a [0:1] variant. 𝑃̂0 and 𝑃̂1 are the guide positions obtained
from guide configurations 𝑃𝑚 and 𝑃𝑚+1 , respectively. 𝑉̂0 and 𝑉̂1 are expressed using the
length parameter α and unit vectors 𝑣0 and 𝑣1 of the cable tangential direction obtained
from the guide configuration 𝑃𝑚 and 𝑃𝑚+1 , respectively.
where a larger α increases the total length of the Hermite curve and vice versa. The
interpolated points {𝑝′ 𝑠 |1 ≤ 𝑠 ≤ 𝑆 ′ , 𝑆 ≪ S′ } are given by using Eq. (2) with an interval
of 𝑡 as shown in Fig. 5(a). The Newton-Raphson method [25] is used to obtain the
appropriate value of α corresponding to the desired curve length, that is, the cable segment
length 𝑙𝑐𝑚 . The total length of the Hermite curve is obtained as the sum of the distances
′
between the adjacent interpolated points, ∑𝑆1 −1‖𝑝′ 𝑠+1 − 𝑝′ 𝑠 ‖ . Sampling and linear
2
′
interpolation are then performed on {𝑝 𝑠 } to generate uniformly spaced sub-segment
positions {𝑝𝑠 |1 ≤ 𝑠 ≤ 𝑆} so that the adjacency distances are equal to the sub-segment
fixed-length 𝑙𝑠𝑠 as shown in Fig. 5(b).
4.2 RMF
The continuous orientations {𝑞′𝑠 |1 ≤ s ≤ 𝑆} at the sub-segment positions, as
shown in Fig. 6(a), are obtained by applying RMF to {𝑝𝑠 } and the orientation of the start
guide’s configuration 𝑃𝑚 . The orientation 𝑞1 at the first sub-segment of 𝐶𝑚 is equivalent
to the orientation of 𝑃𝑚 due to the characteristics of RMF, but the orientation 𝑞𝑠 at the
last sub-segment is not necessarily equivalent to that of 𝑃𝑚+1 . Therefore, the error ∆𝜓 of
the torsion angles between the orientation 𝑞′𝑆 at the 𝑆-th sub-segment and orientation of
the end guide’s configuration 𝑃𝑚+1 is obtained. Finally, by adding the proportionally-
allocated torsion angle modification ∆𝜓(𝑠 − 1)/(𝑆 − 1) to the continuous orientation at
each sub-segment, {𝑞′𝑠 }, the sub-segment orientations {𝑞𝑠 |1 ≤ 𝑠 ≤ 𝑆} are determined as
shown in Fig. 6(b).
5. Simulation
This study investigates the effectiveness of fast connected geometry computation using
Hermite interpolation and RMF, as well as the cable path design using intra-link
segments. In this section, a comparative study of the previous method and two proposed
methods shown below will be conducted.
Previous method: This is the method proposed in [16]. The connected geometry
of cable segments is generated by deforming a linear geometry using a physical
simulation. All cable segments are assumed to be inter-link segments, i.e., the maximum
number of guides per link is 1.
Proposed Method 1: The fast connected geometry computation is employed to
reduce the computational burden of the cable segment connected geometry in the previous
method. Al l cable segments are assumed to be inter-link segments.
Proposed Method 2: In addition to the fast connected geometry computation, both
the previous inter-link and proposed intra-link segments are employed to design the cable
path for complex motion, i.e., the maximum number of guides per link is assumed to be
two.
For clarity, the employments of fast connected geometry computation and intra-
link segments for each method are summarized in Table 2.
The specifications of the computer used are as follows: the OS was Windows 10
Professional. The CPU was an Intel Core i9-7980XE 2.6GHz. The RAM was 16GB. The
GPU was an NVIDIA GeForce RTX 2080.
The parameterization of guides and cables is described in Section 5.1. Next,
comparison experiments will be conducted in Section 5.2. on the cable geometry and
computational time obtained by the fast connected geometry computation with those
obtained by the previous connected geometry computation [16]. Then, the cable path
solution and computational time of the three methods when applied to a simple motion,
namely pick-and-place motion, are described in Section 5.3. Finally, the cable path
solution and computational time when the three methods are applied to a complex motion,
namely inspection motion, are described in Section 5.4.
Previous method - -
A 6-axis articulated robot (Omron Viper 850 [26]) was used in the simulation. In the pick-
and-place motion, a motorized gripper (SMC LEHF32EK2-32 [27]) was attached to the
end link. A cable (SMC LE-CP-3 [28]; diameter 8 mm; weight 260 g/m; hereinafter SMC
cable) was used to transmit power and control signals to a motorized gripper. A camera
(BASLER acA1300-30gc [29]) was attached to the termination link in the inspection
motion. A cable (GEV-C6HF-L05-ACE [30]; diameter 6 mm; weight 662 g/m; hereafter,
GEV cable) was used to transmit the camera power and imaging signals. These cables are
the subjects of the cable geometry simulation in respective motions.
For the physical simulation of the cable geometry, the mass-spring model of
PhysX SDK 4.0 [11] was employed with the rigid body segments connected by virtual
joints with six degrees of freedom. Here, the bending spring constant, torsion spring
constant, and damping coefficient are as shown in Table 3, based on the measurement
method described in a previous study [15].
The parameters included in the stress constraint for the cable geometry are
described. To avoid a collision with surrounding objects, 𝐼𝑚𝑝𝑢𝑙𝑠𝑒𝑡ℎ was set to 0.
𝑆𝑡𝑟𝑒𝑡𝑐ℎ𝑡ℎ was set at 102% to deal with the solution oscillations, although the natural
limit in terms of physical stress is 100%. 𝐶𝑢𝑟𝑣𝑎𝑡𝑢𝑟𝑒𝑡ℎ for SMC and GEV cables were
48 mm and 60 mm according to the respective specifications.
SMC cable 5.1 × 10−2 Nm/rad 1.5 Nm/rad 1.0 × 102 Ns/m
GEV cable 6.7 × 10−2 Nm/rad 2.1 Nm/rad 1.0 × 102 Ns/m
(a) Without intra-link segments (b) With intra-link segments
Fig. 7(a) and (b) show the labels of the links, guides, and cables as well as the
absolute coordinate system for the cases without (previous method and proposed method
1) and with (proposed method 2) intra-link segments, respectively. The robot arm consists
of 𝐿0 to 𝐿6 . As mentioned earlier, the origin of the absolute coordinate system Σ𝐿0 is fixed
at the base of 𝐿0 . The origin of Σ𝐿n is fixed at the origin of rotation of 𝐿𝑛 (1 ≤ 𝑛 ≤ 6).
Guide 𝐺1 is attached to 𝐿3 . Guides 𝐺2 and 𝐺3 are attached to 𝐿4 . Guide 𝐺4 is attached to
𝐿6 . Guide 𝐺5 coincides with the connector of the gripper or camera installed on 𝐿6 in each
of the pick-and-place and inspection motions.
Fig. 7 shows the case without intra-link cables (previous and proposed method 1).
It corresponds to the case where 𝐺2 and 𝐺3 , as well as 𝐺4 and 𝐺5 , are identical, i.e., the
number of sub-segments 𝑆2 and 𝑆4 in 𝐶2 and 𝐶4 are 0.
Candidate sub-segment numbers 𝑆m of 𝐶m for pick-and-place and inspection
motions are shown in Table 4. In the previous method and proposed method 1, the
candidate for 𝑆m in 𝐶2 and 𝐶3 is only 0. Meanwhile, in the proposed method 2, they are
the sum set of 0 and arithmetic series. On the right side of the table, the number of 𝑆m
candidates is indicated. The unit sub-segment length 𝑙𝑠𝑠 was set to 10 mm. The unit sub-
segment consists of a cylinder that is 5 mm long and 8 mm in diameter with a 5 mm void
(virtual joint). The tolerance ∆𝑆 for the arithmetic series of cable segment lengths was 1.
𝑙𝑅 20mm
The range parameter R for robustness is 2(= = ). Thus, the variation 𝑙𝑅 (=
∆𝑆×𝑙𝑠𝑠 1×10mm
20 mm) with respect to the length of the cable segment can be allowed.
𝑃4 (𝑥, 𝑦, 𝑧, 𝜑, 𝜃, 𝜓) ∈ {(150,70,40,0,0,0), 4
𝑃5 75 30 −200 0 0 0 1
(b) inspection motion
𝑃5 −65 0 120 0 0 0 1
The cable geometries and computational times obtained by the previous and fast
connected geometry computations are compared in this section. Here, the connected
geometries of cable segments 𝐶3 with two lengths are computed. Fig. 9(a) and (b) show
the attachment of previous methods based on the deformation from linear geometry for
cable segments of 250 and 500 mm, respectively. In the initial state shown on the left side
of these figures, the cable segments were arranged as a linear geometry towards the x
direction. Then, as shown in the middle, connected geometries were obtained when the
physical simulation connected the ends of the cable segments to their respective guides.
By continuing the physical simulation up to the steady state, the convergent geometries
shown on the right side were obtained. Note that, in the previous connected geometry
computation, physical simulation was used for obtaining both the connected and
convergence geometries. For a cable segment of 250 mm (Fig. 9(a)), the connected
geometry smoothly connected the guides. The convergence geometry was approximately
identical to the connected geometry. Meanwhile, for a cable segment length of 500 mm
(Fig. 9(b)), the connected geometry was wiggly. However, the convergence geometry
was smooth.
Linear geometry Connected geometry Convergent geometry
Fig. 9 Cable segment geometries by the previous method using deformation from linear
geometry
Connected geometry Convergent geometry
Fig. 10 Cable segment geometries by the proposed method using Hermite interpolation
and RMF
Fig. 10(a) and (b) show the attachment of 250 and 500 mm cable segments, respectively,
using fast connected geometry computation. The Hermite interpolation and RMF were
used to obtain the connected geometries where both end-cable segments were connected
to the respective guides, followed by the physical simulation to obtain the convergence
geometries.
Table 6 Computation time comparison for connected and convergent geometries of
cable segments
method
method
Next, Table 6 shows the time required to obtain the connected and convergence
geometries for the previous and proposed methods and sum of these times by the previous
and proposed methods. In terms of the computational time for the connected geometry,
the proposed method is approximately 80 and 120 times faster than the previous method
for the cable segment lengths of 250 and 500 mm, respectively. Meanwhile, there is no
significant difference between the two methods in terms of the computational time for
convergent geometries. In terms of the total time, the proposed method is approximately
8 and 4 times faster than the previous method for cable segment lengths of 250 and 500
mm, respectively. The results described here indicated that the proposed method gives
convergent geometries comparable to those of the previous methods. It requires less total
computational time to obtain convergent geometries.
Cable path optimization for a pick-and-place motion as an example of simple motion was
studied. The initial pose of the robot arm is shown in Fig. 11(a). First, the robot arm picks
an object in the front (Fig. 11(b)). Next, the robot arm places the object on the right side
(Fig. 11(c)). The joint angle time series Θ(t) was generated based on a script describing
the way points and velocities, and so on, using a robot programming environment, the
Omron Sysmac Studio [31].
𝜃4 [deg]
𝜃5 [deg]
𝜃6 [deg]
Fig. 12 Joint angle time series Θ(t) with the critical poses for the simple motion; the
large black dots represent the global extrema of the joint angles; the small black dots
represent the extrema of the joint angles during the period in which the other joint angle
has the global extremum
The relationship between the critical poses extracted from the simple motion and
Θ(t) is shown in Fig. 12 [16]. The horizontal axis represents the elapsed time in simple
motion. The vertical axis represents the three joint angles. Since the inter-link segment
𝐶1 traversed only the fourth joint, the two critical poses of 𝐶1 were determined based on
the global extrema of 𝜃4 . Since the inter-link segment 𝐶3 traversed the fifth and sixth
joints, the four critical poses of 𝐶3 were determined based on the combination of the
extreme values of 𝜃5 and 𝜃6 .
Table 7 Number of solutions in the attachment test and the acquisition of the optimal
solution in motion test for simple motion
Proposed - 25 - 21 Solved
method 1
Table 7 shows the number of solutions obtained in the attachment test and whether
the optimal solution was acquired in the motion test by "Solved" or “Unsolved.” The
previous and two proposed methods are used for the cable path optimization. The number
of solutions and solution sets obtained by the previous method and proposed method 1
were identical. Since the previous method and the proposed method 1 don’t use the 𝐶4
and 𝐶2 intra-link segments, numbers of their solutions are described as “-.” For the
proposed method 2, more solutions were obtained than the others in the attachment test.
The reason is that more PVs in 𝐷0,3 of 𝐶3 satisfy the adjacency condition for the
preceding 𝐶4 intra-link segment due to the increased configurations of 𝐺4 in 𝐷2,4 . The
same remark can be applied to the influence of the 𝐶2 intra-link segment on 𝐶1 . The
optimal solution is obtained in the motion test by all the three methods. The visual
representation of the optimal solution, i.e., ECPV d∗ , will be presented in Section 6.
Table 8 Computation times in the attachment and motion tests for simple motion
Table 8 shows the computational time required for the attachment and motion
tests for simple motion. In the attachment test, the total computational time for the inter-
link segments 𝐶3 and 𝐶1 is reduced by a factor of 10 for the proposed method 1. This
occurs due to the effect of the fast connected geometry computation as opposed to the
previous method. Meanwhile, the computational time for the proposed method 2, which
introduces the intra-link segments 𝐶4 and 𝐶2 , is approximately one-half. Note that
compared to the proposed method 1, although the increase in computational time for the
intra-link segment of the proposed method 2 is negligible, the computation time for the
inter-link segment is significantly increased. The is because more PVs in 𝐷0,3 of 𝐶3
satisfy the adjacency condition for the preceding 𝐶4 intra-link segment, as already
mentioned. Note that the computational times for the motion test with all the methods
were equal. The reason is that the ECPV d̂'s, which give the shortest entire cable length
and were obtained from the attachment tests by these methods, were consistent. This d̂
was adopted as d∗ through the motion test. The obtained results show that the fast
connected geometry computation is meaningful for load reduction. Applying intra-link
segments for simple motions is not recommended in terms of the computational burden.
The cable path optimization for an inspection motion as an example of complex motion
was studied. The initial pose of the robot arm is shown in Fig. 13(a). The camera at the
tip of the robot arm captures the left, top-left, top-right, and right sides in turn (Fig. 13(b)–
(c)).
(c) Top-left inspection pose (d) Top-right inspection pose (e) Right inspection pose
Fig. 14 Joint angle time series Θ(t) with the critical poses for the complex motion
The relationship between the critical poses extracted from the complex motion
and Θ(t) is shown in Fig. 14 [16]. Note that the variation ranges of 𝜃4 , 𝜃5 , and 𝜃6 in the
simple motion shown in Fig. 12 were less than approximately 50º, while those in the
complex motion were approximately 150º or more. Two and four critical poses were
extracted for 𝐶1 and 𝐶3 , respectively.
Table 9 Number of solutions in the attachment test and the acquisition of the optimal
solution in motion test for complex motion
Proposed - 0 - 0 None
method 1
Table 10 Computation times in the attachment and motion tests for complex motion
Table 10 shows the computational time required for the attachment and motion
test for the complex motion. The attachment test for 𝐶3 took approximately 15 and 4
minutes of computational time for the previous and proposed method 1, respectively.
However, further computations were suspended for the reasons already mentioned. The
proposed method took 27.5 and 1.7 min for the attachment and motion tests, respectively,
resulting in a total of 29.2 min.
As mentioned in Section 3, the geometries of the intra-link segments 𝐶𝑚 are
motion independent. It implies that 𝐷1,𝑚 and 𝐷2,𝑚 can be dictionaried through a prior
processing without assuming any given motion. According to Table 8, the total
computational time of the proposed method 2 for the simple motion was 22.6 min. It can
be reduced to 19.8 min (88%) using this dictionary. Meanwhile, according to Table 10,
the total computational time for complex motions was 29.2 min, which can be reduced to
26.2 min (90%).
6. Experiment
The cable path was implemented on the actual robot based on the optimal solution d* for
simple motion obtained in Section 5.3. The implementation of the optimal cable path on
the initial, pick, and place poses in the simulation and real environments are shown in
Fig. 15(a)–(c) and Fig. 15(d)–(f), respectively.
The cable path was implemented on the actual robot based on the optimal solution
d* for the complex motion obtained in Section 5.4. The implementation of the optimal
cable path on the initial and inspection poses in the simulation and real environments are
shown in Fig. 16(a)–(c) and Fig. 16(d)–(f), respectively. As seen in Supplemental Videos
1 and 2, the robot is operated at approximately half the maximum speed from the
viewpoint of stability of the cable simulation and visual inspection of the implemented
cable geometry during the operation.
The simulated and experimental cable geometries are similar for both simple and
complex motions. It was also visually confirmed that the stress constraint on the cable
curvature radius were satisfied. There were no collisions between the cable and robot arm.
Although the possibility of cable collisions cannot be negligible when operating at
extremely high speeds, it is considered that the obtained optimal solution can be used as
a preliminary reference for practical cable path design.
(a) Simulation: initial (b) Simulation: pick pose (c) Simulation: place
pose pose
(d) Experiment: initial (e) Experiment: pick pose (f) Experiment: place
pose pose
Fig. 15 Simulated and experimental results for simple motion (supplementary video 1),
where d∗ = (S1 , S2 , S3 , S4 , P1 , P2 , P3 , P4 , P5 ) = (20,0,0,47, (0,40,25,0,0, −90),
(0,60,25,0,0,45), (0,60,25,0,0,45), (75,30, −200,0,0,0), (75,30, −200,0,0,0))
(a) Simulation: (b) Simulation: (c) (d) (e) Simulation:
initial pose left pose Simulation: Simulation: right pose
top left pose top right
pose
7. Conclusion
This paper discussed a method for optimizing the cable path for a given robot motion.
Here, inspired by the observation of experts' cable path design works, we proposed the
installation of multiple guides on one link to avoid cable collisions with peripheral
devices and reduce bending cable fatigue. In addition, the fast connected geometry
computation using the Hermite interpolation and RMF to reduce the burden and
dictionary of the optimal PVs for intra-link cables were discussed.
The simulations compared the previous and fast connected geometry
computations and showed that the latter is superior from the viewpoint of computational
burden. In addition, pick-and-place motion and inspection motion were referred to as
examples of simple and complex motion, respectively. The optimal solutions and
computational times of the previous and proposed methods for these motions were
compared. The obtained results show that the proposed method can derive solutions not
only for simple motions with a smaller computational burden but also for complex
motions for which no solution can be derived by previous methods. Experiments
confirmed that the cable paths obtained in the simulation could be applied to the actual
robot while satisfying stress constraints. In the case of complex motions for which an
optimal solution cannot be obtained, it is necessary to optimize the robot motion and the
cable path simultaneously, but this is an issue for the future.
Appendix
A. PV candidate set 𝑫𝟎,𝒎
𝑓𝑜𝑟 ∀𝜃 ∈ Θ′𝑚 },
where 𝐼𝑚𝑝𝑢𝑙𝑠𝑒(𝑆𝑚,𝑖𝑚 ,𝑃𝑚,𝑗𝑚 ,𝑃𝑚 + 1,𝑗𝑚 + 1 ) (𝜃) represents the maximum impulse received by
each sub-segment of 𝐶𝑚 , when the joint angles are set to Θ′𝑚 that contains only the initial
pose as one of the arbitrary poses. Similarly, 𝑆𝑡𝑟𝑒𝑡𝑐ℎ(𝑆𝑚,𝑖𝑚 ,𝑃𝑚,𝑗𝑚 ,𝑃𝑚 + 1,𝑗𝑚 + 1 ) (𝜃) and
𝐶𝑢𝑟𝑣𝑎𝑡𝑢𝑟𝑒(𝑆𝑚,𝑖𝑚 ,𝑃𝑚,𝑗𝑚 ,𝑃𝑚 + 1,𝑗𝑚 + 1 ) (𝜃) are the maximum stretch and minimum curvature
𝐷′0,𝑚 satisfying the adjacency condition between 𝐷0,𝑚 and 𝐷2,𝑚−1 in the attachment test [16]
is given by
Compared to 𝐷0,𝑚 , 𝐷′0,𝑚 includes fewer PVs. Thus, the burden can be reduced by
applying the adjacency condition in CSAT [16].
Statements & Declarations
Funding
The authors declare that no funds, grants, or other support were received during the preparation
of this manuscript.
Competing Interests
References
[1] International Federation of Robotics (2021) Executive summary world robotics 2021
industrial robots.
https://ifr.org/img/worldrobotics/Executive_Summary_WR_Industrial_Robots_2021.pd
[3] Spillmann J, Teschner M (2007) CoRdE: Cosserat rod elements for the dynamic
simulation: From rigid bodies to deformable cables. In: 5th World Multiconf Syst
Cybern Informatics (SCI ’01) 2001, pp 325–332.
https://doi.org/10.1016/j.jmsy.2017.02.001
May 2023.
[12] Kressin J (2013) Path optimization for multi-robot station minimizing dresspack
Systems.
Robot station optimization for minimizing dress pack problems. Procedia CIRP 44:389–
394. https://doi.org/10.1016/j.procir.2016.01.022
[14] Hermansson T, Carlson JS, Linn J, Kressin J (2021) Quasi-static path optimization
for industrial robots with dress packs. Robot Comput Integr Manuf 68:102055.
https://doi.org/10.1016/j.rcim.2020.102055
method for industrial robot arms. Robot Comput Integr Manuf 73:102245.
https://doi.org/10.1016/j.rcim.2021.10224
optimization based on critical robot poses for industrial robot arms . IEEE Access
10:66028–66044. https://doi.org/10.1109/ACCESS.2022.3184421
centric framework for robotic task learning and optimization, J Manuf Syst 67:68–79.
https://doi.org/10.1016/j.jmsy.2023.01.003
https://doi.org/10.1109/IROS51168.2021.9636184.
[19] Mon AA, Aye KK (1995) Hermite interpolation by Pythagorean hodograph curve.
[21] Hall CA, Meyer WW (1976) Optimal error bounds for cubic spline interpolation. J
[23] Bloomenthal J (1990) Calculation of reference frames along a space curve. Graph
https://doi.org/10.1051/matecconf/20153110002
https://doi.org/10.1007/978-3-540-70529-1_374.
http://www.ia.omron.com/products/family/3520/download/catalog.html. Accessed 1
May 2023.
SupplementalVideo1.mp4
SupplementalVideo2.mp4