Geometric task decomposition in a multi-agent environment

Kaivan Kamali, Dan Ventura, Amulya Garga, Soundar R.T. Kumara

Research output: Contribution to journalReview article

2 Citations (Scopus)

Abstract

Task decomposition in a multi-agent environment is often, performed online. This paper proposes a method for sub-task allocation that can be performed before the agents are deployed, reducing the need for communication among agents during their mission. The proposed method uses a Voronoi diagram to partition the task-space among team members and includes two phases: static and dynamic. Static decomposition (performed in simulation before the start of the mission) repeatedly partitions the task-space by generating random diagrams and measuring the efficacy of the corresponding sub-task allocation. If necessary, dynamic decomposition (performed in simulation after the start of a mission) modifies the. result, of a static decomposition (i.e., in case of resource limitations for some agents). Empirical results are reported for the problem of surveillance of an arbitrary region by a team of agents.

Original languageEnglish (US)
Pages (from-to)437-456
Number of pages20
JournalApplied Artificial Intelligence
Volume20
Issue number5
DOIs
StatePublished - Jun 1 2006

Fingerprint

Decomposition
Communication

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Kamali, Kaivan ; Ventura, Dan ; Garga, Amulya ; Kumara, Soundar R.T. / Geometric task decomposition in a multi-agent environment. In: Applied Artificial Intelligence. 2006 ; Vol. 20, No. 5. pp. 437-456.
@article{0fd4add7a8e94aefafd5eba5ff41a500,
title = "Geometric task decomposition in a multi-agent environment",
abstract = "Task decomposition in a multi-agent environment is often, performed online. This paper proposes a method for sub-task allocation that can be performed before the agents are deployed, reducing the need for communication among agents during their mission. The proposed method uses a Voronoi diagram to partition the task-space among team members and includes two phases: static and dynamic. Static decomposition (performed in simulation before the start of the mission) repeatedly partitions the task-space by generating random diagrams and measuring the efficacy of the corresponding sub-task allocation. If necessary, dynamic decomposition (performed in simulation after the start of a mission) modifies the. result, of a static decomposition (i.e., in case of resource limitations for some agents). Empirical results are reported for the problem of surveillance of an arbitrary region by a team of agents.",
author = "Kaivan Kamali and Dan Ventura and Amulya Garga and Kumara, {Soundar R.T.}",
year = "2006",
month = "6",
day = "1",
doi = "10.1080/08839510500313737",
language = "English (US)",
volume = "20",
pages = "437--456",
journal = "Applied Artificial Intelligence",
issn = "0883-9514",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

Geometric task decomposition in a multi-agent environment. / Kamali, Kaivan; Ventura, Dan; Garga, Amulya; Kumara, Soundar R.T.

In: Applied Artificial Intelligence, Vol. 20, No. 5, 01.06.2006, p. 437-456.

Research output: Contribution to journalReview article

TY - JOUR

T1 - Geometric task decomposition in a multi-agent environment

AU - Kamali, Kaivan

AU - Ventura, Dan

AU - Garga, Amulya

AU - Kumara, Soundar R.T.

PY - 2006/6/1

Y1 - 2006/6/1

N2 - Task decomposition in a multi-agent environment is often, performed online. This paper proposes a method for sub-task allocation that can be performed before the agents are deployed, reducing the need for communication among agents during their mission. The proposed method uses a Voronoi diagram to partition the task-space among team members and includes two phases: static and dynamic. Static decomposition (performed in simulation before the start of the mission) repeatedly partitions the task-space by generating random diagrams and measuring the efficacy of the corresponding sub-task allocation. If necessary, dynamic decomposition (performed in simulation after the start of a mission) modifies the. result, of a static decomposition (i.e., in case of resource limitations for some agents). Empirical results are reported for the problem of surveillance of an arbitrary region by a team of agents.

AB - Task decomposition in a multi-agent environment is often, performed online. This paper proposes a method for sub-task allocation that can be performed before the agents are deployed, reducing the need for communication among agents during their mission. The proposed method uses a Voronoi diagram to partition the task-space among team members and includes two phases: static and dynamic. Static decomposition (performed in simulation before the start of the mission) repeatedly partitions the task-space by generating random diagrams and measuring the efficacy of the corresponding sub-task allocation. If necessary, dynamic decomposition (performed in simulation after the start of a mission) modifies the. result, of a static decomposition (i.e., in case of resource limitations for some agents). Empirical results are reported for the problem of surveillance of an arbitrary region by a team of agents.

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

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

U2 - 10.1080/08839510500313737

DO - 10.1080/08839510500313737

M3 - Review article

AN - SCOPUS:33646408776

VL - 20

SP - 437

EP - 456

JO - Applied Artificial Intelligence

JF - Applied Artificial Intelligence

SN - 0883-9514

IS - 5

ER -