By Topic

Rearrangement task of multiple robots using task assignment applicable to different environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Naoki Oyama ; Research into Artifacts, Center for Engineering (RACE), The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba, Japan ; Zhaojia Liu ; Lounell B. Gueta ; Jun Ota

This paper addresses a rearrangement problem by a group of mobile robots and proposes a method for task assignment and path planning applicable to different kinds of environment. The method minimizes task completion time considering complexity of robot's paths in achieving the goal state of a working environment. It minimizes the number of possible delivery tasks between robots thereby reducing the task completion time. The proposed method is compared with continuous transportation method and Territorial Approach through simulations. The results of simulations show the effectiveness of the proposed method. The proposed method can realize an efficient rearrangement task by mobile robots in various working environments under feasible computation time.

Published in:

Robotics and Biomimetics (ROBIO), 2010 IEEE International Conference on

Date of Conference:

14-18 Dec. 2010