%0 Conference Paper %1 okimoto2015team %A Okimoto, Tenda %A Schwind, Nicolas %A Clement, Maxime %A Ribeiro, Tony %A Inoue, Katsumi %A Marquis, Pierre %B Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems %C Richland, SC %D 2015 %E Weiss, Gerhard %E Yolum, Pinar %E Bordini, Rafael H. %E Elkind, Edith %I International Foundation for Autonomous Agents and Multiagent Systems %K agent builder formation mas multi system team %P 395–403 %T How to Form a Task-Oriented Robust Team %X 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. %@ 9781450334136

@inproceedings{okimoto2015team, 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.}, added-at = {2020-04-01T14:41:38.000+0200}, address = {Richland, SC}, author = {Okimoto, Tenda and Schwind, Nicolas and Clement, Maxime and Ribeiro, Tony and Inoue, Katsumi and Marquis, Pierre}, biburl = {https://www.bibsonomy.org/bibtex/2f0ffd60b4b39c9788087282c880f52fc/porta}, booktitle = {Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems}, editor = {Weiss, Gerhard and Yolum, Pinar and Bordini, Rafael H. and Elkind, Edith}, interhash = {b6ed2c1a6e3d5994f2bf9574f8dfae56}, intrahash = {f0ffd60b4b39c9788087282c880f52fc}, isbn = {9781450334136}, keywords = {agent builder formation mas multi system team}, location = {Istanbul, Turkey}, numpages = {9}, pages = {395–403}, publisher = {International Foundation for Autonomous Agents and Multiagent Systems}, series = {AAMAS ’15}, timestamp = {2020-04-01T14:41:38.000+0200}, title = {How to Form a Task-Oriented Robust Team}, year = 2015 }