We study two state-of-the-art solutions to the multi-agent pickup and delivery (MAPD) problem based on different principles -- multi-agent path-finding (MAPF) and multi-agent reinforcement learning (MARL). Specifically, a recent MAPF algorithm called conflict-based search (CBS) and a current MARL algorithm called shared experience actor-critic (SEAC) are studied. While the performance of these algorithms is measured using quite different metrics in their separate lines of work, we aim to benchmark these two methods comprehensively in a simulated warehouse automation environment.
@article{arxiv.2203.07092,
title = {The Multi-Agent Pickup and Delivery Problem: MAPF, MARL and Its Warehouse Applications},
author = {Tim Tsz-Kit Lau and Biswa Sengupta},
journal= {arXiv preprint arXiv:2203.07092},
year = {2022}
}