Trial-Based Heuristic Tree-search for Distributed Multi-Agent Planning

Authors

  • Tim Schulte Albert-Ludwigs-Universität Freiburg
  • Bernhard Nebel Albert-Ludwigs-Universität Freiburg

DOI:

https://doi.org/10.1609/socs.v7i1.18402

Keywords:

planning, search, thts, uct, multi-agent, codmap

Abstract

We present a novel search scheme for privacy-preserving multi-agent planning, inspired by UCT search. We compare the presented approach to classical multi-agent forward search and evaluate it based on benchmarks from the CoDMAP competition.

SoCS 2016 Proceedings Cover

Downloads

Published

2021-09-01

How to Cite

Schulte, T., & Nebel, B. (2021). Trial-Based Heuristic Tree-search for Distributed Multi-Agent Planning. Proceedings of the International Symposium on Combinatorial Search, 7(1), 137–138. https://doi.org/10.1609/socs.v7i1.18402

Issue

Vol. 7 No. 1 (2016): Ninth Annual Symposium on Combinatorial Search

Section

Short Papers