Improved Planning and Filtering Algorithm for Task-priority
Redundancy Resolution in Mobile Manipulation
Nagamanikandan Govindan and Asokan Thondiyath
Department of Engineering Design, Indian Institute of Technology Madras, Chennai, India
Keywords: Mobile Manipulator, Redundancy Resolution, Path Planning, Behavioural Control, Inverse Kinematics,
CLIK.
Abstract: Discrete time implementation of task-priority redundancy resolution using closed loop inverse kinematics
with fixed sampling time may lead to discretization chatter. The chattering effect is due to switching between
different closed loop behaviours whenever the corresponding external event has occurred. This effect causes
high frequency oscillation with finite frequency and amplitude in both joint space motion and operational
space motion which is highly undesired. In this paper, we propose a planning and filtering algorithm to
improve the robustness of task-priority redundancy resolution without having the effect of chattering, while
combining multiple closed loop behaviours. We also show how the null space projection in task- priority
control affects the operational space motion while switching between the behaviours. To demonstrate the
effectiveness of the proposed algorithm, three different case studies are presented for a planar mobile
manipulator with holonomic constraint. The results confirm that the proposed algorithm eliminates the chatter
and moves the end effector on a smooth trajectory.
1 INTRODUCTION
Mobile manipulator with holonomic constraints can
be modelled as a redundant system, which offers high
flexibility and versatility, even though the system is
non-commensurate. A robot is said to be
kinematically redundant, if the dimension of joint
space
is greater than the dimension of operational
space
,... The redundant degrees of
freedom (DoF) can be used to perform additional
tasks in joint space (Sciavicco et al., 2012). It can also
be viewed as an underdetermined system, where the
number of solutions in joint space is a finite set of
infinite number of solutions for a given admissible
range of operational space motion (Burdick, 1989).
In service domain, there is an increasing demand
for mobile manipulators to perform various high-
level behaviours which consists of reactive and
repeated tasks. Synthesizing controller for such high-
level behaviours is highly complicated and often such
high-level tasks are decomposed into primitive level
subtasks with individual low-level controllers, as
described in (Kress-Gazit, 2008). Various constraints
and conflicts among the tasks can be handled by
assigning the order of priority for each task, and the
resulting end-effector motion can be realized by
projecting the task having lower priority onto the null
space of the higher priority task, as proposed in
(Nakamura et al., 1987).
One of the main challenges in autonomous robot
control is the smooth change of its control scheme
while switching between different tasks. For
example, consider the end-effector of a manipulator
is commanded to move along a trajectory while
avoiding obstacles without violating the joint limits.
Here, trajectory tracking, obstacle avoidance, and
joint limit avoidance are the three behavioural tasks
and will be activated only on absolute necessity. Each
subtask describes the dynamics of the behaviour with
current state and sensor information, and the robot is
expected to execute many of such behaviours
simultaneously. Each task will generate its own
motion command which has to be combined through
suitable behavioural control scheme to achieve a
single motion command. The work presented by
(Antonelli et al., 2008) has investigated and compared
the null-space behavioural (NSB) control with the
existing methods in behavioural coordination. But, in
general, it is impossible to accomplish all the tasks
concurrently, because of the task conflict. To avoid
numerical drifting and task space error while solving
inverse kinematics using redundancy resolution,