Multi-robot Learning for Continuous Area Sweeping

  • Mazda Ahmadi
  • Peter Stone
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3898)


As mobile robots become increasingly autonomous over extended periods of time, opportunities arise for their use on repetitive tasks. We define and implement behaviors for a class of such tasks that we call continuous area sweeping tasks. A continuous area sweeping task is one in which a group of robots must repeatedly visit all points in a fixed area, possibly with non-uniform frequency, as specified by a task-dependent cost function. Examples of problems that need continuous area sweeping are trash removal in a large building and routine surveillance. We present a formulation for this problem and an initial algorithm to address it. The approach is analyzed analytically and is fully implemented and tested, both in simulation and on physical robots.


Grid Cell Coarse Grid Real Robot Message Type Expected Reward 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kalra, N., Stentz, A.T., Ferguson, D.: Hoplites: A market framework for complextight coordination in multi-agent teams. Technical Report CMU-RI-TR-04-41, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA (2004)Google Scholar
  2. 2.
    Kurabayashi, D., Ota, J., Arai, T., Yoshida, E.: Cooperative sweeping by multiple mobile robots. In: Proc. of IEEE International Conference on Robotics & Automation, ICRA (1996)Google Scholar
  3. 3.
    Choset, H.: Coverage for robotics; a survey of recent results. Annals of Mathematics and Artificial Intelligence 31, 113–126 (2001)CrossRefMATHGoogle Scholar
  4. 4.
    Parker, L.E.: Distributed algorithms for multi-robot observation of multiple moving targets. Autonomous Robots 12, 231–255 (2002)CrossRefMATHGoogle Scholar
  5. 5.
    Hert, S., Lumelsky, V.: Polygon area decomposition for multiple-robot workspace division. Special Issue of International Journal of Computational Geometry & Applications on Applied Computational Geometry 8, 437–466 (1998)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Bast, H., Hert, S.: The area partitioning problem. In: Proceedings of the 12th Canadian Conference on Computational Geometry (1995)Google Scholar
  7. 7.
    Min, T.W., Yin, H.K.: A decentralized approach for cooperative sweeping by multiple mobile robots. In: International Conference on Intelligent Robots and Systems, IROS (1998)Google Scholar
  8. 8.
    Jager, M., Nebel, B.: Dynamic decentralized area partitioning for cooperating cleaning robots. In: ICRA (2002)Google Scholar
  9. 9.
    Schneider-Fontan, M., Mataric, M.: Territorial multi-robot task division. IEEE Transactions on Robotics and Automation 15 (1998)Google Scholar
  10. 10.
    Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)MATHGoogle Scholar
  11. 11.
    Stone, P., Dresner, K., Fidelman, P., Jong, N.K., Kohl, N., Kuhlmann, G., Sridharan, M., Stronger, D.: The UT Austin Villa 2004 RoboCup four-legged team: Coming of age. Technical Report UT-AI-TR-04-313, The University of Texas at Austin, Department of Computer Sciences, AI Laboratory (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mazda Ahmadi
    • 1
  • Peter Stone
    • 1
  1. 1.Department of Computer ScienceLearning Agent Research Group (LARG)USA

Personalised recommendations