Professional Documents
Culture Documents
,
SG2
D
k
,o
M
. (3)
Thus, P
k
can be xed by substituting Equation (3) into Equation (2).
Consequently, P
k
and t
k
can be expressed as monadic functions of D
k
. For the
prototype, an o
M
of 2000 deg/sec
2
has been experienced as a suitable value.
In addition, the motor has a limited speed with P
max
, and a large D
k
may cause
P
k
to exceed P
max
. In this case, P
k
and t
k
should be recomputed with the conditions
P
k
= P
max
,
(4)
t
k
=
2D
k
P
k
.
Once P
k
and t
k
are determined, the cubic speed can be formulated by
identifying coefcients in
0
motor
=
l
2
t
2
+ l
3
t
3
, t |0, t
k
,2]
P
k
l
2
(t t
k
,2)
2
l
3
(t t
k
,2)
3
, t |t
k
,2, t
k
],
(5)
with l
2
= 12P
k
,t
2
k
and l
3
= 16P
k
,t
3
k
.
Considering the delay t
S
, the motion period T
k
for kth segment is expressed as
T
k
= t
S
+ t
k
. (6)
Equations (1)(6) summarize the motion generation process for the motor,
which is executed by the controller when it reads a command D
k
in kth segment.
A FORMULATION FOR OPTIMAL PATH PLANNING
An operation with low energy consumption and smooth behavior can be
obtained by using basic criteria for an optimal path planning.
Time is an important issue when a robot serves a human although the
action of anthropomorphic robotic arm is not expected to be as fast as industrial
manipulators. Although the mechanical design of LARM clutched arm gifts energy
saving features, how to use the single motor and clutches properly and efciently
D
o
w
n
l
o
a
d
e
d
b
y
[
M
a
r
c
o
C
e
c
c
a
r
e
l
l
i
]
a
t
0
6
:
4
9
1
1
F
e
b
r
u
a
r
y
2
0
1
2
PATH PLANNING FOR A 1-DOF CLUTCHED ARM 115
is still a question for low energy consumption. Accelerations of the end effector
can directly indicate the motion characteristics. For friendly and safe purposes, the
acceleration o
H
should be minimized during a task of LARM clutched arm.
Thus, an optimal path planning of LARM clutched arm can be formulated
as a multiobjective optimization problem with traveling time T
tra
, consumed energy
E
con
, and maximum acceleration o
H
of the end effector in the form
min ] = ]
T
tra
T
ref
,
E
con
E
ref
,
o
H
o
ref
, (7)
subject to
0
1
|0
1 min
, 0
1 max
],
0
2
|0
2 min
, 0
2 max
],
(8)
0
E
|0
E min
, 0
E max
],
0
motor
|P
max
, P
max
],
where T
ref
, E
ref
, and o
ref
are reference values and 0
1
0
3
are the joint angles with
0
E
= 0
3
0
2
as the elbow angle.
By using weighting sum strategy (The Math Works, 1992), the multiobjective
problem in Equation (7) can be converted into a scalar one in the form
min ] = n
1
T
tra
T
ref
+ n
2
E
con
E
ref
+ n
3
o
H
o
ref
, (9)
in which n
1
n
3
are weighting factors with condition 0 n
i
1 (i = 13) and n
1
+
n
2
+ n
3
= 1.
Since the three criteria in Equation (9) can be competitive to each other, a
weighting factor of the most emphasized criterion can be conveniently considered
as for major effect.
For a path with N segments, the traveling time can be computed as sum of
time segments with Equation (6). The consumed energy E
con
can be computed by
summing the work of the motor (W
motor
) and the work of electromagnetic clutches
(W
clutch
). W
motor
can be computed as
W
motor
=
N
k=1
T
k
0
t
motor
0
motor
dt
, (10)
where t
motor
is the actuating motor torque. Since the power of the selected
electromagnetic clutch in the prototype is given as Pn
clutch
= 7.2 W, W
clutch
can be
computed as
W
clutch
=
N
k=1
(n
OP
T
k
Pn
clutch
), (11)
in which n
OP
is the number of activated clutches depending on the OP mode.
D
o
w
n
l
o
a
d
e
d
b
y
[
M
a
r
c
o
C
e
c
c
a
r
e
l
l
i
]
a
t
0
6
:
4
9
1
1
F
e
b
r
u
a
r
y
2
0
1
2
116 GU AND CECCARELLI
Figure 5 A kinematic model of the LARM clutched arm (Gu and Ceccarelli, 2010a).
Acceleration o
H
can be computed by referring to Cartesian Space coordinates
(x, ,, z) in the form
o
H
= Max(
x
2
+ ,
2
+ z
2
). (12)
Since the LARM clutched arm can achieve any point-to-point task (within its
workspace) with OP1, OP2, and OP3 sequentially, a reference operation mode can
be dened with utmost those three segments to compute T
ref
, E
ref
, and o
ref
.
The computation of W
motor
and o
H
requires evaluation of the arms kinematics
and dynamics. LARM clutched arm can be considered as a two-link planar
manipulator rotating around the Y-axis with dimensions L
1
, L
2
, and L
3
(L
0
is
shoulder size in a trunk body; Fig. 5). The rotating plane for upper arm and forearm
is dened as S-plane with coordinate X
s
Y
s
. The Forward Kinematic Problem (FKP)
and Inverse Kinematic Problem (IKP) of LARM clutched arm can be expressed by
using the model in Fig. 5.
The dynamics of a model with concentrated link masses can be computed to
give the motor torque t
motor
as
t
motor
= C
1
t
1
,K
1
+ C
2
t
2
,K
2
+ C
3
t
3
,K
3
+ t
]
, (13)
in which K
1
, K
2
, and K
3
are reduction ratios for three gear trains; C
i
(i = 13)
indicates the clutch state that equals to 1 or 0; t
i
(i = 13) is the output torque
for each joint. It means that when clutch C
i
is deactivated, the link output torque t
i
do not require motor torque, since the self-locking mechanism ensures the braking
action. t
]
is a torque considering friction and other secondary effects that are
generated in the gear trains. Since it is difcult to formulate accurately a t
]
as in
practical case, it has been convenient to identify t
]
approximately via tests on the
prototype, in which t
]
considers all the dissipative effects as computed by comparing
a numerical result with an experimental test. With a payload of 0.25kg on the arm
D
o
w
n
l
o
a
d
e
d
b
y
[
M
a
r
c
o
C
e
c
c
a
r
e
l
l
i
]
a
t
0
6
:
4
9
1
1
F
e
b
r
u
a
r
y
2
0
1
2
PATH PLANNING FOR A 1-DOF CLUTCHED ARM 117
extremity, t
]
has been measured from 0.167Nm up to 0.271Nm as depending on
the operation mode, with the maximum value when all gear trains are activated.
A NUMERICAL PROCEDURE FOR OPTIMAL PATH PLANNING
Since path generation for LARM clutched arm with OP vectors can be
considered as a 3D robot navigation procedure in joint space, widely used Articial
Intelligence (AI) methods in the optimal path planning can be also properly applied.
Among many approaches in AI area, A* (A star) is one of the most common
and well-known heuristic graph-searching algorithm (Nilsson, 1982). In order to
use A*, a node structure can be dened with information on path-planning
characteristics that are related to ] objective function in Equation (9). Parameter
h is the predict estimate to reach the goal end point, which provides the heuristic
information for the A* search (Nilsson, 1982), as the distance left to the goal with
the expression
h =
(0
1
0
1end
)
2
+ (0
2
0
2end
)
2
+ (0
3
0
3end
)
2
(0
1start
0
1end
)
2
+ (0
2start
0
2end
)
2
+ (0
3start
0
3end
)
2
, (14)
in which (0
1start
, 0
2start
, 0
3start
) and (0
1end
, 0
2end
, 0
3end
) are joint coordinates for start
point and end point, respectively. The cost for a node is a sum of ] and h. A node
with minimal cost will be selected rstly in the path search.
Figure 6(a) illustrates a node expanding process with OPs, where a father node
is a current selected node while son nodes are those expanded from the father node.
The depth information of a node increases by 1, which can indicate the order of
generation for the node. In Fig. 6(b), a more visual scheme for node expansion is
indicated in joint space, where black circles are for father nodes, and white circles
are for son nodes.
One important issue is that each node will remember its father node and
pointers of the son nodes will point to the data address of their father node. In such
a way, once a node is on the goal, the optimal path can be obtained by tracking
back with pointers.
Figure 6 A scheme for node expansion: (a) in the node tree; (b) in the joint space.
D
o
w
n
l
o
a
d
e
d
b
y
[
M
a
r
c
o
C
e
c
c
a
r
e
l
l
i
]
a
t
0
6
:
4
9
1
1
F
e
b
r
u
a
r
y
2
0
1
2
118 GU AND CECCARELLI
When a motion step of motor (A0
motor
) is given, the joint coordinates of the
new expanded nodes can be updated with expressions as
0
i
= 0
i
+ C
i
sign (OP) A0,K
i
, (i = 1, . . . , 3) (15)
where OP can be either positive or negative for forward or backward movement.
NUMERICAL EXAMPLE AND TEST RESULTS
A numerical example is reported as referring to the case with weighting factors
for T
tra
, E
con
, and o
H
with decreasing values n
1
= 0.6, n
2
= 0.3, and n
3
= 0.1,
respectively. A start point in joint space is given as (90
, 90
, 0
), while an end
point is given as (130
, 60
, 40
). A0
motor
is given at 100
,
2300
, and 200