We introduce the multi-agent transportation (MAT) problem, where agents have to transport containers from their starting positions designated goal positions. Movement takes place in a common environment collisions between and must be avoided. In contrast other frameworks such as pathfinding (MAPF) or pickup delivery (MAPD), are allowed separate at any time, which can reduce makespan also allows...