skip to main content
10.1145/1389095.1389128acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Multi-agent task allocation: learning when to say no

Published: 12 July 2008 Publication History

Abstract

This paper presents a communication-less multi-agent task allocation procedure that allows agents to use past experience to make non-greedy decisions about task assignments. Experimental results are given for problems where agents have varying capabilities, tasks have varying difficulties, and agents are ignorant of what tasks they will see in the future. These types of problems are difficult because the choice an agent makes in the present will affect the decisions it can make in the future. Current task-allocation procedures, especially the market-based ones, tend to side-step the issue by ignoring the future and assigning tasks to agents in a greedy way so that short-term goals are met. It is shown here that these short-sighted allocation procedures work well in situations where the ratio of task length to team size is small, but their performance decreases as this ratio increases. The adaptive method presented here is shown to perform well in a wide range of task-allocation problems, and because it requires no explicit communication, its computational costs are independent of team size.

References

[1]
D. P. Bertsekas. Auction algorithms for network flow problems: A tutorial introduction. Computational Optimization and Applications, 1:7--66, December 1992.
[2]
E. Bonabeau, M. Dorigo, and G. Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, Santa Fe Institute Studies in the Sciences of Complexity, New York, NY, 1999.
[3]
H. El-Rewini, H. H. Ali, and T. Lewis. Task scheduling in multiprocessing systems. Computer, 28(12):27--37, 1995.
[4]
U. Faigle. Some recent results in the analysis of greedy algorithms for assignment problems. OR Spectrum, 15(4):181--188, December 1994.
[5]
N. R. Franks. Teams in social insects: group retrieval of prey by army ants (eciton burchelli, hymenoptera: Formicidae). Behavioral Ecology and Sociobiology, 18(6):425--429, 1986.
[6]
D. Gale. The Theory of Linear Economic Models. McGraw-Hill Book Company, Inc., New York, 1960.
[7]
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
[8]
B. P. Gerkey and M. J. Matarić. Sold!: Market methods for multi-robot coordination. IEEE Transactions on Robotics and Automation, 18(5):758--768, October 2002.
[9]
B. P. Gerkey and M. J. Matarić. A formal analysis and taxonomy of task allocation in multi-robot systems. International Journal of Robotics Research, 23(9):939--954, September 2004.
[10]
H. W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1):83--97, 1955.
[11]
T. H. Labella, M. Dorigo, and J.-L. Deneubourg. Efficiency and task allocation in prey retrieval. In Proceedings of the 1st International Workshop on Biologically Inspired Approaches to Advanced Information Technology, pages 274--289, 2004.
[12]
K. Lerman, C. Jones, A. Galstyan, and M. J. Matarıc. Analysis of dynamic task allocation in multi-robot systems. International Journal of Robotics Research, 25(3):225--241, 2006.
[13]
T. C. Lueth and T. Laengle. Task description, decomposition and allocation in a distributed autonomous multi-agent robot system. In Proceedings of International Conference on Intelligent Robots and Systems, pages 1516--1523, September 1994.
[14]
M. J. Matarić, G. S. Sukhatme, and E. H. Østergaard. Multirobot task allocation in uncertain environments. Autonomous Robots, 14(23):255--263, 2003.
[15]
E. H. Østergaard, M. J. Matarić, and G. S. Sukhatme. Distributed multi-robot task allocation for emergency handling. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Wailea, Hawaii, October 2001.
[16]
L. E. Parker. Alliance: An architecture for fault-tolerant multi-robot cooperation. IEEE Transactions on Robotics and Automation, 14(2):220--240, 1998.
[17]
F. Ravary, E. Lecoutey, G. Kaminski, N. Châline, and P. Jaisson. Individual experience alone can generate lasting division of labor in ants. Current Biology, 17:1308--1312, 2007.
[18]
P. R. Wurman, R. D'Andrea, and M. Mountz. Coordinating hundreds of cooperative, autonomous vehicles in warehouses. In AAAI, pages 1752--. AAAI Press, 2007.

Cited By

View all
  • (2017)Multi-Robot Coalitions Formation with Deadlines: Complexity Analysis and SolutionsPLOS ONE10.1371/journal.pone.017065912:1(e0170659)Online publication date: 24-Jan-2017
  • (2015)Bounty Hunters and Multiagent Task AllocationProceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems10.5555/2772879.2772930(387-394)Online publication date: 4-May-2015
  • (2015)An influence diagram based multi-criteria decision making framework for multirobot coalition formationAutonomous Agents and Multi-Agent Systems10.1007/s10458-014-9276-y29:6(1061-1090)Online publication date: 1-Nov-2015
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation
July 2008
1814 pages
ISBN:9781605581309
DOI:10.1145/1389095
  • Conference Chair:
  • Conor Ryan,
  • Editor:
  • Maarten Keijzer
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 July 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. adaptive systems
  2. multi-agent systems
  3. task allocation

Qualifiers

  • Research-article

Conference

GECCO08
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)17
  • Downloads (Last 6 weeks)1
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2017)Multi-Robot Coalitions Formation with Deadlines: Complexity Analysis and SolutionsPLOS ONE10.1371/journal.pone.017065912:1(e0170659)Online publication date: 24-Jan-2017
  • (2015)Bounty Hunters and Multiagent Task AllocationProceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems10.5555/2772879.2772930(387-394)Online publication date: 4-May-2015
  • (2015)An influence diagram based multi-criteria decision making framework for multirobot coalition formationAutonomous Agents and Multi-Agent Systems10.1007/s10458-014-9276-y29:6(1061-1090)Online publication date: 1-Nov-2015
  • (2014)Profiling: An application assignment approach for green data centersIECON 2014 - 40th Annual Conference of the IEEE Industrial Electronics Society10.1109/IECON.2014.7049325(5400-5406)Online publication date: Oct-2014
  • (2012)Multi-robot coalition formation in real-time scenariosRobotics and Autonomous Systems10.1016/j.robot.2012.06.00460:10(1295-1307)Online publication date: 1-Oct-2012
  • (2012)Swarm-like Methodologies for Executing Tasks with DeadlinesJournal of Intelligent and Robotic Systems10.1007/s10846-012-9666-968:1(3-19)Online publication date: 1-Sep-2012
  • (2012)MuRoCo: A Framework for Capability- and Situation-Aware Coalition Formation in Cooperative Multi-Robot SystemsJournal of Intelligent & Robotic Systems10.1007/s10846-012-9654-067:3-4(339-370)Online publication date: 29-Feb-2012

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media