Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?

Jiří Švancara, Philipp Obermeier, Matej Husár, Roman Barták, Torsten Schaub

2023

Abstract

Multi-agent pathfinding is the task of navigating a set of agents in a shared environment from their start locations to their desired goal locations without collisions. Solving this problem optimally is a hard task and various algorithms have been devised. The algorithms can generally be split into two categories, search- and reduction-based ones. It is known that reduction-based algorithms struggle with large instances in terms of the size of the environment. A recent study tried to mitigate this drawback by pruning some vertices of the environment map. The pruning is done based on the vicinity to a shortest path of an agent. In this paper, we study the effect of choosing such shortest paths. We provide several approaches to choosing the paths and we perform an experimental study to see the effect on the runtime.

Download


Paper Citation


in Harvard Style

Švancara J., Obermeier P., Husár M., Barták R. and Schaub T. (2023). Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?. In Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-623-1, pages 199-206. DOI: 10.5220/0011625100003393


in Bibtex Style

@conference{icaart23,
author={Jiří Švancara and Philipp Obermeier and Matej Husár and Roman Barták and Torsten Schaub},
title={Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?},
booktitle={Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2023},
pages={199-206},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0011625100003393},
isbn={978-989-758-623-1},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?
SN - 978-989-758-623-1
AU - Švancara J.
AU - Obermeier P.
AU - Husár M.
AU - Barták R.
AU - Schaub T.
PY - 2023
SP - 199
EP - 206
DO - 10.5220/0011625100003393