Combining Strengths of Optimal Multi-Agent Path Finding Algorithms

Jiří Švancara, Roman Barták

2019

Abstract

The problem of multi-agent path finding (MAPF) is studied in this paper. Solving MAPF optimally is a computationally hard problem and many different optimal algorithms have been designed over the years. These algorithms have good runtimes for some problem instances, while performing badly for other instances. Interestingly, these hard instances are often different across the algorithms. This leads to an idea of combining the strengths of different algorithms in such a way that an input problem instance is split into disjoint subproblems and each subproblem is solved by appropriate algorithm resulting in faster computation than using either of the algorithms for the whole instance. By manual problem decomposition we will empirically show that the above idea is viable. We will also sketch a possible future work on automated problem decomposition.

Paper Citation

in Harvard Style

Švancara J. and Barták R. (2019). Combining Strengths of Optimal Multi-Agent Path Finding Algorithms.In Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-350-6, pages 226-231. DOI: 10.5220/0007470002260231

in Bibtex Style

@conference{icaart19,
author={Jiří Švancara and Roman Barták},
title={Combining Strengths of Optimal Multi-Agent Path Finding Algorithms},
booktitle={Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2019},
pages={226-231},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007470002260231},
isbn={978-989-758-350-6},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Combining Strengths of Optimal Multi-Agent Path Finding Algorithms
SN - 978-989-758-350-6
AU - Švancara J.
AU - Barták R.
PY - 2019
SP - 226
EP - 231
DO - 10.5220/0007470002260231