research-article

How to Form a Task-Oriented Robust Team

Authors:

Nicolas Schwind,

Maxime Clement,

Pierre MarquisAuthors Info & Claims

AAMAS '15: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems

Pages 395 - 403

Published: 04 May 2015 Publication History

Abstract

How to form a team for achieving a given set of tasks is an important issue in multi-agent systems. Task-oriented team formation is the problem of selecting a group of agents, where each agent is characterized by a set of capabilities; the objective is to achieve a given set of tasks, where each task is made precise by a set of capabilities necessary for managing it. Robustness (i.e., the ability to reach the goal even if some agents break down) is an expected property of a team. In this paper, the focus is laid on the Task-Oriented Robust Team Formation (TORTF) problem. A formal framework is defined and some decision and optimization problems for TORTF are pointed out. The computational complexity of TORTF is then identified. Interestingly, TORTF does not prove more computationally demanding than the task-efficient team formation problem, i.e., robustness is in some sense "for free". In order to solve these TORTF problems, two algorithms, ART (Algorithm for Robust Team) for the decision problem and AORT (Algorithm for Optimal Robust Team) for bi-objective constraint optimization problems, are presented and evaluated on a number of benchmarks.

References

[1]

N. Agmon and P. Stone. Leading ad hoc agents in joint action settings with multiple teammates. In AAMAS, pages 341--348, 2012.

Digital Library

[2]

S. Ali, A. Maciejewski, H. Siegel, and J. Kim. Measuring the robustness of a resource allocation. Parallel and Distributed Systems, 15(7):630--641, 2004.

Digital Library

[3]

Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam. Optimal coalition structure generation in cooperative graph games. In AAAI, pages 81--87, 2013.

[4]

Y. Bachrach and J. Rosenschein. Coalitional skill games. In AAMAS, pages 1023--1030, 2008.

Digital Library

[5]

H. Choi, L. Brunet, and J. How. Consensus-based decentralized auctions for robust task allocation. IEEE Transactions on Robotics, 25(4):912--926, 2009.

Digital Library

[6]

P. Dasgupta and K. Cheng. Robust multi-robot team formations using weighted voting games. Distributed Autonomous Robotic Systems, 83:373--387, 2013.

[7]

R. Dechter. Constraint Processing. Morgan Kaufmann Publishers, 2003.

Digital Library

[8]

M. E. Gaston and M. desJardins. Agent-organized networks for dynamic team formation. In AAMAS, pages 230--237, 2005.

Digital Library

[9]

J. George, J. Pinto, P. Sujit, and J. Sousa. Multiple UAV coalition formation strategies. In AAMAS, pages 1503--1504, 2010.

Digital Library

[10]

T. Hogg, B. Huberman, and C. Williams. Phase transitions and the search problem. Artificial Intelligence, 81(1-2):1--15, 1996.

Digital Library

[11]

G. Kaminka and I. Frenkel. Flexible teamwork in behavior-based robots. In AAAI, pages 108--113, 2005.

Digital Library

[12]

R. M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85--103, 1972.

[13]

H. Kitano and S. Tadokoro. Robocup rescue: A grand challenge for multiagent and intelligent systems. AI Magazine, 22(1):39--52, 2001.

[14]

S. Koenig, C. Tovey, X. Zheng, and I. Sungur. Sequential bundle-bid single-sale auction algorithms for decentralized control. In IJCAI, pages 1359--1365, 2007.

Digital Library

[15]

T. Lappas, K. Liu, and E. Terzi. Finding a team of experts in social networks. In KDD, pages 467--476, 2009.

Digital Library

[16]

S. Liemhetcharat and M. Veloso. Modeling and learning synergy for team formation with heterogeneous agents. In AAMAS, pages 365--374, 2012.

Digital Library

[17]

S. Liemhetcharat and M. Veloso. Forming an effective multi-robot team robust to failures. In IROS, pages 5240--5245, 2013.

[18]

S. Liemhetcharat and M. Veloso. Weighted synergy graphs for effective team formation with heterogeneous ad hoc agents. Artificial Intelligence, 208:41--65, 2014.

Digital Library

[19]

L. S. Marcolino, A. Jiang, and M. Tambe. Multi-agent team formation: Diversity beats strength? In IJCAI, pages 81--87, 2013.

Digital Library

[20]

R. Marinescu. Best-first vs. depth-first and/or search for multi-objective constraint optimization. In ICTAI, pages 439--446, 2010.

Digital Library

[21]

T. Matthews, S. Ramchurn, and G. Chalkiadakis. Competing with humans at fantasy football: Team formation in large partially-observable domains. In AAAI, pages 1394--1400, 2012.

Digital Library

[22]

M. Moz and M. Pato. Solving the problem of rerostering nurse schedules with hard constraints: New multicommodity flow models. Annals OR, 128(1-4):179--197, 2004.

[23]

R. Nair and M. Tambe. Hybrid bdi-pomdp framework for multiagent teaming. Journal of Artificial Intelligent Research, 23:367--420, 2005.

Digital Library

[24]

T. Rahwan and N. Jennings. Coalition structure generation: Dynamic programming meets anytime optimization. In AAAI, pages 156--161, 2008.

Digital Library

[25]

E. Rollon and J. Larrosa. Bucket elimination for multiobjective optimization problems. Journal of Heuristics, 12(4-5):307--328, 2006.

Digital Library

[26]

E. Rollon and J. Larrosa. Multi-objective Russian doll search. In AAAI, pages 249--254, 2007.

Digital Library

[27]

T. Sandholm, K. Larson, M. Andersson, O. Shehory, and F. Tohmé. Coalition structure generation with worst case guarantees. Artificial Intelligence, 111(1-2):209--238, 1999.

Digital Library

[28]

T. Schiex, H. Fargier, and G. Verfaillie. Valued constraint satisfaction problems: Hard and easy problems. In IJCAI, pages 631--639, 1995.

Digital Library

[29]

J. Vidal. The effects of co-operation on multiagent search in task-oriented domains. Journal of Experimental and Theoretical Artificial Intelligence, 16(1):5--18, 2004.

[30]

D. Yeh. A dynamic programming approach to the complete set partitioning problem. BIT Computer Science and Numerical Mathematics, 26(4):467--474, 1986.

Digital Library

[31]

R. Zlot and A. Stentz. Complex task allocation for multiple robots. In ICRA, pages 1515--1522, 2005.

Cited By

Gourvès LMonaco GDastani MSichman JAlechina NDignum V(2024)Nash Stability in Hedonic Skill GamesProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662923(706-714)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662923
Igarashi AOta KSakurai YYokoo M(2019)Robustness against agent failure in hedonic gamesProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367085(364-370)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367032.3367085
Rahmattalabi AVayanos PFulginiti ATambe MElkind EVeloso MAgmon NTaylor M(2019)Robust Peer-Monitoring on Graphs with an Application to Suicide Prevention in Social NetworksProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3332046(2168-2170)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3332046
Show More Cited By

Index Terms

How to Form a Task-Oriented Robust Team
1. Theory of computation

Recommendations

Recoverable Team Formation: Building Teams Resilient to Change
AAMAS '18: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems

Team formation consists in finding the least expensive team of agents such that a certain set of skills is covered. In this paper, we formally introduce recoverable team formation (RTF), a generalization of the above problem, by taking into account the ...
Algorithms for partially robust team formation
Abstract
In one of its simplest forms, Team Formation involves deploying the least expensive team of agents while covering a set of skills. While current algorithms are reasonably successful in computing the best teams, the resilience to change of such ...
Partial Robustness in Team Formation: Bridging the Gap between Robustness and Resilience
AAMAS '21: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems

Team formation is the problem of deploying the least expensive team of agents while covering a set of skills. Once a team has been formed, some of the agents considered at start may be finally defective and some skills may become uncovered. Two solution ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

AAMAS '15: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems

May 2015

2072 pages

ISBN:9781450334136

General Chairs:
Gerhard Weiss
Maastricht University, The Netherlands
,
Pınar Yolum
Bogazici University, Turkey
,
Program Chairs:
Rafael H. Bordini
PUCRS, Brazil
,
Edith Elkind
University of Oxford, UK

Sponsors

IFAAMAS

In-Cooperation

SIGAI: ACM Special Interest Group on Artificial Intelligence

Publisher

International Foundation for Autonomous Agents and Multiagent Systems

Richland, SC

Publication History

Published: 04 May 2015

Check for updates

Author Tags

Qualifiers

Research-article

Conference

AAMAS'15

Sponsor:

AAMAS'15: International Conference on Autonomous Agents and Multiagent Systems

May 4 - 8, 2015

Istanbul, Turkey

Acceptance Rates

AAMAS '15 Paper Acceptance Rate 108 of 670 submissions, 16%;

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
170
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Gourvès LMonaco GDastani MSichman JAlechina NDignum V(2024)Nash Stability in Hedonic Skill GamesProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662923(706-714)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662923
Igarashi AOta KSakurai YYokoo M(2019)Robustness against agent failure in hedonic gamesProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367085(364-370)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367032.3367085
Rahmattalabi AVayanos PFulginiti ATambe MElkind EVeloso MAgmon NTaylor M(2019)Robust Peer-Monitoring on Graphs with an Application to Suicide Prevention in Social NetworksProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3332046(2168-2170)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3332046
Ismaili AHazon NWatanabe EYokoo MKraus SElkind EVeloso MAgmon NTaylor M(2019)Complexity and Approximations in Robust Coalition Formation via Max-Min k-PartitioningProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3332002(2036-2038)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3332002
Igarashi AOta KSakurai YYokoo MElkind EVeloso MAgmon NTaylor M(2019)Robustness against Agent Failure in Hedonic GamesProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3331999(2027-2029)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3331999
Demirović ESchwind NOkimoto TInoue KAndre EKoenig SDastani MSukthankar G(2018)Recoverable Team FormationProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3237903(1362-1370)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.5555/3237383.3237903
Andrejczuk ERodríguez-Aguilar JRoig CSierra CLarson KWinikoff MDas SDurfee E(2017)Synergistic Team CompositionProceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems10.5555/3091125.3091330(1463-1465)Online publication date: 8-May-2017
https://dl.acm.org/doi/10.5555/3091125.3091330
Okimoto TRibeiro TBouchabou DInoue K(2016)Mission oriented robust multi-team formation and its application to robot rescue simulationProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence10.5555/3060621.3060685(454-460)Online publication date: 9-Jul-2016
https://dl.acm.org/doi/10.5555/3060621.3060685

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents