Cooperative sweeping by multiple mobile robots

  • Kurabayashi D
  • Ota J
  • Arai T
 et al. 
  • 37


    Mendeley users who have this article in their library.
  • 98


    Citations of this article.


In this paper, we propose an off-line planning algorithm for cooperative tasks of multiple mobile robots. Sweeping means a motion that a robot covers a 2-dimensional area by its effector. Sweeping of a whole work area is fundamental and essential task of mobile robots. For efficient cooperation, setting appropriate burden onto each robot is very important because interference of robots and overlaps of their effecters make efficiency low. The cost of sweeping depends on both sweeping ability of a robot and a shape of a work area to be swept. Evaluation and distribution of the cost are most important issues. In the proposed algorithm, the cost is evaluated by means of length on which robot should move. We introduce both edges of the configuration space and Voronoi diagram so as to compute paths in the whole area. We generate the a tour for traversing all the paths by applying the algorithm of the Chinese Postman Problem. According to the cost evaluation, appropriate paths of the tour are assigned to each robot. The efficiency of the proposed algorithm is verified by simulations and an experiment View full abstract

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Error loading document authors.

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free