Symbolic Planning and Multi-Agent Path Finding in Extremely Dense Environments with Unassigned Agents
Proceedings of the AAAI Conference on Artificial Intelligence · 14.03.2026 · 40 (35) · 29421-29431
DOI: 10.1609/aaai.v40i35.40183 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 14.03.2026. Verfasst von Bo Fu und 6 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
We introduce the Block Rearrangement Problem (BRaP), a challenging component of large warehouse management which involves rearranging storage blocks within dense grids to achieve a goal state. We formally define the BRaP as a graph search problem. Building on intuitions from sliding puzzle problems, we propose five search-based solution algorithms, leveraging joint configuration space search, classical planning, multi-agent pathfinding, and expert heuristics. We evaluate the five approaches empirically for plan quality and scalability. Despite the exponential relation between search space size and block number, our methods demonstrate efficiency in creating rearrangement plans for deeply buried blocks in up to 80x80 grids.
Zitieren
APA
Fu, B., Chen, Z., Chandan, R., Barbosa, A. O. G., Caldara, M., Durham, J. W., & Pecora, F. (2026). Symbolic Planning and Multi-Agent Path Finding in Extremely Dense Environments with Unassigned Agents. Proceedings of the AAAI Conference on Artificial Intelligence, 40(35), 29421-29431. https://doi.org/10.1609/aaai.v40i35.40183
Vancouver
Fu B, Chen Z, Chandan R, Barbosa AOG, Caldara M, Durham JW, et al. Symbolic Planning and Multi-Agent Path Finding in Extremely Dense Environments with Unassigned Agents. Proceedings of the AAAI Conference on Artificial Intelligence. 2026;40(35):29421-29431. doi:10.1609/aaai.v40i35.40183
BibTeX
@article{Fu2026,
author = {Fu, Bo and Chen, Zhe and Chandan, Rahul and Barbosa, Alexandre Ormiga Galvao and Caldara, Michael and Durham, Joey W. and Pecora, Federico},
title = {Symbolic Planning and Multi-Agent Path Finding in Extremely Dense Environments with Unassigned Agents},
journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
year = {2026},
volume = {40},
number = {35},
pages = {29421--29431},
doi = {10.1609/aaai.v40i35.40183}
}
EUVIMED