Plan merging by reuse for multi-agent planning Articles uri icon

publication date

  • January 2019

start page

  • 365

end page

  • 396

issue

  • 2

volume

  • 50

International Standard Serial Number (ISSN)

  • 0924-669X

Electronic International Standard Serial Number (EISSN)

  • 1573-7497

abstract

  • Multi-Agent Planning deals with the task of generating a plan for/by a set of agents that jointly solve a planning problem. One of the biggest challenges is how to handle interactions arising from agents' actions. The first contribution of the paper is Plan Merging by Reuse, pmr, an algorithm that automatically adjusts its behaviour to the level of interaction. Given a multi-agent planning task, pmr assigns goals to specific agents. The chosen agents solve their individual planning tasks and the resulting plans are merged. Since merged plans are not always valid, pmr performs planning by reuse to generate a valid plan. The second contribution of the paper is rrpt-plan, a stochastic plan-reuse planner that combines plan reuse, standard search and sampling. We have performed extensive sets of experiments in order to analyze the performance of pmr in relation to state of the art multi-agent planning techniques.

subjects

  • Computer Science

keywords

  • automated planning; centralized planning; distributed planning; multi-agent planning; plan reuse