Alexandre Ormiga Galvao Barbosa

Symbolic Planning and Multi-Agent Path Finding in Extremely Dense Environments with Unassigned Agents

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,