5 Citations (Scopus)

Abstract

It is well understood that, through cooperation, multiple agents can achieve tasks that are unachievable by a single agent. However, there are no formal characterizations of situations where cooperation is required to achieve a goal, thus warranting the application of multiple agents. In this paper, we provide such a formal characterization for multi-agent planning problems with sequential action execution. We first show that determining whether there is required cooperation (RC) is in general intractable even in this limited setting. As a result, we start our analysis with a subset of more restrictive problems where agents are homogeneous. For such problems, we identify two conditions that can cause RC. We establish that when none of these conditions hold, the problem is single-agent solvable; otherwise, we provide upper bounds on the minimum number of agents required. For the remaining problems with heterogeneous agents, we further divide them into two subsets. For one of the subsets, we propose the concept of transformer agent to reduce the number of agents to be considered which is used to improve planning performance. We implemented a planner using our theoretical results and compared it with one of the best IPC CoDMAP planners in the centralized track. Results show that our planner provides significantly improved performance on IPC CoDMAP domains.

Original languageEnglish (US)
Pages (from-to)335-343
Number of pages9
JournalUnknown Journal
Volume2016-January
StatePublished - 2016

Fingerprint

Planning
Multiple agents

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems and Management

Cite this

A formal analysis of required cooperation in multi-agent planning. / Zhang, Yu; Sreedharan, Sarath; Kambhampati, Subbarao.

In: Unknown Journal, Vol. 2016-January, 2016, p. 335-343.

Research output: Contribution to journalArticle

@article{6c8422b5be6e4201b6419fd1e4ca070b,
title = "A formal analysis of required cooperation in multi-agent planning",
abstract = "It is well understood that, through cooperation, multiple agents can achieve tasks that are unachievable by a single agent. However, there are no formal characterizations of situations where cooperation is required to achieve a goal, thus warranting the application of multiple agents. In this paper, we provide such a formal characterization for multi-agent planning problems with sequential action execution. We first show that determining whether there is required cooperation (RC) is in general intractable even in this limited setting. As a result, we start our analysis with a subset of more restrictive problems where agents are homogeneous. For such problems, we identify two conditions that can cause RC. We establish that when none of these conditions hold, the problem is single-agent solvable; otherwise, we provide upper bounds on the minimum number of agents required. For the remaining problems with heterogeneous agents, we further divide them into two subsets. For one of the subsets, we propose the concept of transformer agent to reduce the number of agents to be considered which is used to improve planning performance. We implemented a planner using our theoretical results and compared it with one of the best IPC CoDMAP planners in the centralized track. Results show that our planner provides significantly improved performance on IPC CoDMAP domains.",
author = "Yu Zhang and Sarath Sreedharan and Subbarao Kambhampati",
year = "2016",
language = "English (US)",
volume = "2016-January",
pages = "335--343",
journal = "Scanning Electron Microscopy",
issn = "0586-5581",
publisher = "Scanning Microscopy International",

}

TY - JOUR

T1 - A formal analysis of required cooperation in multi-agent planning

AU - Zhang, Yu

AU - Sreedharan, Sarath

AU - Kambhampati, Subbarao

PY - 2016

Y1 - 2016

N2 - It is well understood that, through cooperation, multiple agents can achieve tasks that are unachievable by a single agent. However, there are no formal characterizations of situations where cooperation is required to achieve a goal, thus warranting the application of multiple agents. In this paper, we provide such a formal characterization for multi-agent planning problems with sequential action execution. We first show that determining whether there is required cooperation (RC) is in general intractable even in this limited setting. As a result, we start our analysis with a subset of more restrictive problems where agents are homogeneous. For such problems, we identify two conditions that can cause RC. We establish that when none of these conditions hold, the problem is single-agent solvable; otherwise, we provide upper bounds on the minimum number of agents required. For the remaining problems with heterogeneous agents, we further divide them into two subsets. For one of the subsets, we propose the concept of transformer agent to reduce the number of agents to be considered which is used to improve planning performance. We implemented a planner using our theoretical results and compared it with one of the best IPC CoDMAP planners in the centralized track. Results show that our planner provides significantly improved performance on IPC CoDMAP domains.

AB - It is well understood that, through cooperation, multiple agents can achieve tasks that are unachievable by a single agent. However, there are no formal characterizations of situations where cooperation is required to achieve a goal, thus warranting the application of multiple agents. In this paper, we provide such a formal characterization for multi-agent planning problems with sequential action execution. We first show that determining whether there is required cooperation (RC) is in general intractable even in this limited setting. As a result, we start our analysis with a subset of more restrictive problems where agents are homogeneous. For such problems, we identify two conditions that can cause RC. We establish that when none of these conditions hold, the problem is single-agent solvable; otherwise, we provide upper bounds on the minimum number of agents required. For the remaining problems with heterogeneous agents, we further divide them into two subsets. For one of the subsets, we propose the concept of transformer agent to reduce the number of agents to be considered which is used to improve planning performance. We implemented a planner using our theoretical results and compared it with one of the best IPC CoDMAP planners in the centralized track. Results show that our planner provides significantly improved performance on IPC CoDMAP domains.

UR - http://www.scopus.com/inward/record.url?scp=84989899459&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84989899459&partnerID=8YFLogxK

M3 - Article

VL - 2016-January

SP - 335

EP - 343

JO - Scanning Electron Microscopy

JF - Scanning Electron Microscopy

SN - 0586-5581

ER -