
In robotic applications it is common to use the
sum of squares of joint torques as a criteria of
dissipated energy (Bobrow et al., 2001; Liu et al.,
2000). Following this approach, Eq.3 will be utilized
as a criterion of dissipated energy in this study. The
input of the three joint leg system for a protraction
movement is the trace of joint velocities throughout
the protraction period. This period is taken to be 5
seconds in this work. The input vector at a time
instant can be represented as in Eq.4.
2 TRAJECTORY OPTIMIZATION
The energy optimization problem for the protraction
movement of three joint leg can be stated as to find
the optimal
)(tu trajectory to minimize Eq.3 from
the initial to the final time with given initial and
final tip point positions. This problem is a typical
“optimal control” problem, which is trivial to
formulate and solve (see, e.g. Kirk, 1970). However,
the solution of this optimal control problem is very
much dependent on the initial trajectory used at the
start. If the initial trajectory is not feasible, it is very
probable that the resultant trajectory will also not be
feasible. Therefore, the optimal control technique
needs a feasible initial trajectory. In order to
generate this initial trajectory a method using
“numerical gradient”, in which feasibility is imposed
by penalty functions, is used. The output trajectories
of this method were pretty good. The optimal control
method then is used to tune the trajectories slightly
around the trajectories found by the initial method.
In the method based on the numerical gradient
the conventional method of “steepest descent” is
utilized after the problem is discretized. The total
duration is divided into 50 equal durations, and the
starts of durations are signified as the 50 time
instants (denoted by n). The actuators are assigned a
velocity at each instant and this velocity is held
constant in the sub-period starting with that instant.
In this way, the movement of an actuator is
accomplished by 50 velocity values throughout the
protraction period of 5 seconds. Since there are three
actuators, the input vector which makes the system
to accomplish a whole protraction is a 50
×
3 long
vector ( ). The initial and final tip point positions
are constant. Therefore the required joint angles for
initial and final positions are given. Initial input,
namely initial trajectory of joint velocities, is taken
as the average velocity that would take the tip point
from the initial position to the final. The cost
function is constructed by summing up the following
four penalty functions. Eq.5 is the penalty related
with the sum of torque squares. Eq.6 is the penalty
to avoid the tip point of the leg to go under the
ground (ground level is –5). Eq.7 is the penalty
function related with the joint angle limits. The last
penalty in Eq.8 is related with the required final
condition of angles. If the final angles are not equal
to the required values this term becomes positive.
The overall cost function (Eq.9) is a weighted
sum of these four penalties. The values of these
weights are taken as follows: T=1; U=200; R=0.01;
F=1000. These values are arranged by trial and error
in order to make the four costs comparable and to
force the algorithm to generate some feasible
solution. According to the steepest descent
algorithm, the gradient of the cost function with
respect to the input vector is found and the input
vector is iterated in the opposite direction of the
gradient. The value of
α
in Eq.10 is determined by a
one-dimensional search in each iteration.
In order to determine the trajectories with the
optimal control technique, first the Hamiltonian
formulation of the problem should be performed,
and then the differential equations should be
numerically solved. Following the notation in (Kirk,
1970), the Hamiltonian formulation, necessary
conditions and boundary conditions for the three
joint leg problem are given in Eq.9, 10, and 11,
respectively. The first two equations of the
necessary conditions make up two differential
equations whose initial and final conditions are
given respectively by the boundary conditions
equations. Starting with an initial
)(tu trajectory
these equations can be solved numerically. Next the
)(tu trajectory can be updated in the direction to
minimize the third equation of necessary conditions.
After some iteration the optimal
)(
*
tu
trajectory,
which makes the third necessary condition as close
as possible to 0, can be achieved. This technique is
called “the method of steepest descent for two-point
boundary-value problems” (Kirk, 1970). The initial
)(tu trajectory for this technique is taken from the
n,j
u
FUZZY CONTROLLER DESIGN FOR A THREE JOINT ROBOT LEG IN PROTRACTION PHASE - AN OPTIMAL
BEHAVIOR INSPIRED FUZZY CONTROLLER DESIGN
303