Multi-Agent Path Finding: Policies Instead of Plans

Jakub Mestek, Roman Barták

2024

Abstract

The task of Multi-Agent Path Finding (MAPF) problem is to find collision-free plans for a set of agents moving from their starting locations to their destinations. In the classical variant of MAPF, a plan for an agent is a sequence of actions. In this paper, we suggest a novel approach to solving this problem in a non-deterministic environment – constructing a solution in the form of policies (one for each agent). The policy prescribes the agent which action it should take in a given situation described by a location and a timestep.

Paper Citation

in Harvard Style

Mestek J. and Barták R. (2024). Multi-Agent Path Finding: Policies Instead of Plans. In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-680-4, SciTePress, pages 95-104. DOI: 10.5220/0012397200003636

in Bibtex Style

@conference{icaart24,
author={Jakub Mestek and Roman Barták},
title={Multi-Agent Path Finding: Policies Instead of Plans},
booktitle={Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2024},
pages={95-104},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012397200003636},
isbn={978-989-758-680-4},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - Multi-Agent Path Finding: Policies Instead of Plans
SN - 978-989-758-680-4
AU - Mestek J.
AU - Barták R.
PY - 2024
SP - 95
EP - 104
DO - 10.5220/0012397200003636
PB - SciTePress