GEOMETRIC TASK DECOMPOSITION IN A MULTI-AGENT ENVIRONMENT

Autor:	Dan Ventura, Kaivan Kamali, Soundar R. T. Kumara, Amulya Garga
Rok vydání:	2006
Předmět:	Mathematical optimization Resource (project management) Artificial Intelligence Computer science Real-time computing Decomposition (computer science) Applied research State (computer science) Voronoi diagram Partition (database) Task (project management)
Zdroj:	Applied Artificial Intelligence. 20:437-456
ISSN:	1087-6545 0883-9514
DOI:	10.1080/08839510500313737
Popis:	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. This material is based on work carried out at the Applied Research Laboratory at The Pennsylvania State Uni...
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::0a11d174eea980270d04b182c6ea8182 https://doi.org/10.1080/08839510500313737 Zobrazit plný text záznamu Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.