Solving concurrent multiagent planning using classical planning

Furelos Blanco, Daniel; Jonsson, Anders, 1973-

Solving concurrent multiagent planning using classical planning

Citació

Furelos-Blanco D, Jonsson A. Solving concurrent multiagent planning using classical planning. In: Stolba M, Komenda A, editors. DMAP 2018. Proceedings of the 6th Workshop on Distributed and Multi-Agent Planning; 2018 Jun 24-29; Delft, the Netherlands. Palo Alto (CA): AAAI; 2018. p. 8-16.

Resum

In this work we present a novel approach to solving concurrent multiagent planning problems in which several agents act in parallel. Our approach relies on a compilation from concurrent multiagent planning to classical planning, allowing us to use an off-the-shelf classical planner to solve the original multiagent problem. The solution can be directly interpreted as a concurrent plan that satisfies a given set of concurrency constraints, while avoiding the exponential blowup associated with concurrent actions. Theoretically, we show that the compilation is sound and complete. Empirically, we show that our compilation can solve challenging multiagent planning problems that require concurrent actions.

Descripció

Comunicació presentada al 6th Workshop on Distributed and Multi-Agent Planning (DMAP 2018), celebrat durant la 28th International Conference on Automated Planning and Scheduling, els dies 24 a 29 de juny de 2018 a Delft, Països Baixos.