Article,
Cooperative multi-agent planning
A. Torreno, E. Onaindia, A. Komenda, and M. Stolba.ACM Computing Surveys, 50 (6): 1--32 (Nov 22, 2017)
DOI: 10.1145/3128584
Meta data
- BibTeX key
- Torreno2017
- entry type
- article
- year
- 2017
- month
- nov
- day
- 22
- journal
- ACM Computing Surveys
- number
- 6
- pages
- 1--32
- volume
- 50
- eprint
- 1711.09057
- issn
- 03600300
- archiveprefix
- arXiv
- comment
- Survey on deterministic cooperative multiagent planning. Emphasizes privacy concerns on many cooperative multiagent planners. "Group goals" require multiple agents; "Non-group goals" can be solved by a single agent, but can be solved faster with multiple agents. Unthreaded Planning and Coordination: planning separated from coordination. Iterative Response Planning. - ADP: Iterative agent plannig. Fastest MAP planner yet. (1st) - MARC: m planning agents for n executing agents, where m < n. Task allocation to "transformer agents". (4th). - u-SATPLAN: Task allocation then planning. Iterative agent planning. No group goals. - MAPR: Task Allocation then planning using relaxed reachability analysis. Iterative agent planning. Global plans is parallelized to shorten makespan. Requires homogeneous agents and does not support group goals. (15th) - TFPOP: The first MAP planner with durative actions.
- DOI
- 10.1145/3128584
- url
- https://dl.acm.org/ft\_gateway.cfm?id=3128584\&\#38;ftid=1926082\&\#38;dwn=1\&\#38;CFID=60953899\&\#38;CFTOKEN=39f1f95cb9312e3c-42948318-C346-2544-8EC9DD7D7EC1B3B1
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Journal Article
%1 Torreno2017
%A Torreno, Alejandro
%A Onaindia, Eva
%A Komenda, Antonin
%A Stolba, Michal
%D 2017
%J ACM Computing Surveys
%K deterministic, map, survey
%N 6
%P 1--32
%R 10.1145/3128584
%T Cooperative multi-agent planning
%U https://dl.acm.org/ft\_gateway.cfm?id=3128584&\#38;ftid=1926082&\#38;dwn=1&\#38;CFID=60953899&\#38;CFTOKEN=39f1f95cb9312e3c-42948318-C346-2544-8EC9DD7D7EC1B3B1
%V 50
@article{Torreno2017,
added-at = {2020-05-24T20:36:48.000+0200},
archiveprefix = {arXiv},
author = {Torreno, Alejandro and Onaindia, Eva and Komenda, Antonin and Stolba, Michal},
biburl = {https://www.bibsonomy.org/bibtex/22238899d1550d04ba19ad142badece0c/marcondg},
comment = {Survey on deterministic cooperative multiagent planning.
Emphasizes privacy concerns on many cooperative multiagent planners.
"Group goals" require multiple agents; "Non-group goals" can be solved by a single agent, but can be solved faster with multiple agents.
Unthreaded Planning and Coordination: planning separated from coordination.
Iterative Response Planning.
- ADP: Iterative agent plannig. Fastest MAP planner yet. (1st)
- MARC: m planning agents for n executing agents, where m < n. Task allocation to "transformer agents". (4th).
- u-SATPLAN: Task allocation then planning. Iterative agent planning. No group goals.
- MAPR: Task Allocation then planning using relaxed reachability analysis. Iterative agent planning. Global plans is parallelized to shorten makespan. Requires homogeneous agents and does not support group goals. (15th)
- TFPOP: The first MAP planner with durative actions.},
day = 22,
doi = {10.1145/3128584},
eprint = {1711.09057},
interhash = {e51c039973918f39e5859707ac67e3b1},
intrahash = {2238899d1550d04ba19ad142badece0c},
issn = {03600300},
journal = {ACM Computing Surveys},
keywords = {deterministic, map, survey},
month = nov,
number = 6,
pages = {1--32},
timestamp = {2020-05-24T20:36:48.000+0200},
title = {{Cooperative multi-agent planning}},
url = {https://dl.acm.org/ft\_gateway.cfm?id=3128584\&\#38;ftid=1926082\&\#38;dwn=1\&\#38;CFID=60953899\&\#38;CFTOKEN=39f1f95cb9312e3c-42948318-C346-2544-8EC9DD7D7EC1B3B1},
volume = 50,
year = 2017
}