Multi-Robot Task Allocation Method for Heterogeneous Tasks with Priorities

  • José Guerrero
  • Gabriel Oliver


Task allocation is a complex and open problem for multi-robot systems and very especially if a priority is associated to each task. In this paper, we present a method to allocate tasks with priorities in a team of heterogeneous robots. The system is partially inspired on auction and thresholds-based methods and tries to determine the optimum number of robots that are needed to solve specific tasks taking into account their priorities and characteristics. Thus, we can minimize the interference effect between robots and increase the system performance. The method has been extensively tested for a modification of the well-known foraging task, using different kinds of robots. Experimental results are presented to show the benefits of the proposed method.


Work Capacity Task Allocation Single Robot Delivery Point Auction Process 
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.
    Agassounon W., Martinoli A. (2002). Efficiency and Robustness of Threshold-Based Distributed Allocation Algorithms in Multi-Agent Systems. 1st Int. Joint Conf. on Autonomous Agents and Multi-Agents Systems, Bologna (Italy).Google Scholar
  2. 2.
    Arkin R.C. (1998), Behaviour-Based Robotics, The MIT Press.Google Scholar
  3. 3.
    Balch T. (1997) Social Entropy: A New Metric for Learning Multi-Robot Teams, 10th international Florida Artificial Intelligent Research Society Conference, CA:AAAI Press, Daytona Beach, FL (USA)Google Scholar
  4. 4.
    Bonabeau E., Sobkowski A., Theraulaz G. and Deneubourg J. L. (1997) Adaptive Task Allocation Inspired by a Model of Division of Labour in Social Insects, Bio Computation and Emergent Computing.Google Scholar
  5. 5.
    Campos M., Bonabeau E. and Thraulaz G., Deneubourg J. L. (2001) Dynamic Scheduling and Division of Labour in Social Insects, Adaptive Behaviour Vol. 8-2, Singapore.Google Scholar
  6. 6.
    Chamowicz L., Campos M., Kumar C. (2002) Dynamic Role Assignment for Cooperative Robots. 2002 IEEE International Conference on Robotics and Automation, Washington-DC (USA).Google Scholar
  7. 7.
    Dias M.B. and Stentz A. (2000) A Free Market Architecture for Distributed Control of a Multirobot System, 6th International Conference on Intelligent Autonomous Systems, Venice (Italy).Google Scholar
  8. 8.
    Gerkey B. P. and Mataric M. J. (2002) Sold!: Auction methods for multi-robot coordination, IEEE Transactions on Robotics and Automation, Special Issue on Multi-robot Systems, Vol. 18 No. 5Google Scholar
  9. 9.
    Guerrero J. and Oliver G. (2003) Multi-robot Task Allocation Strategies Using Auction-Like Mechanisms, Artificial Intelligence Research and Development in Frontiers in Artificial Intelligence and Application, Vol. 100, IOS PressGoogle Scholar
  10. 10.
    Guerrero J., Oliver G. and Ortiz A. (2001) On Simulating Behaviour-based Robot Colonies in the Classroom, First EURON Workshop on Robotics Education and Training, Weingarden (Germany)Google Scholar
  11. 11.
    Krieger M. J., Billeter J. G. and Keller L. (2000) Ant-like task allocation and recruitment in cooperative robots, Nature 406.Google Scholar
  12. 12.
    Lerman K., Galstyan A. (2002) Mathematical Model of Foraging in a Group of Robots: Effect of Interference, Autonomous Robots 13(2)Google Scholar

Copyright information

© Springer 2007

Authors and Affiliations

  • José Guerrero
    • 1
  • Gabriel Oliver
    • 1
  1. 1.Mathematics and Computer Science DepartmentUniversitat de les Illes Balears (UIB)Palma de MallorcaSpain

Personalised recommendations