4 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.AI2019★ 4 cited
Position Paper: From Multi-Agent Pathfinding to Pipe Routing
Gleb Belov, Liron Cohen, Maria Garcia de la Banda +3
The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free paths for a number of agents, from a set of start locations to a set of goal positions in a known 2D e…
math.OC2015★ 3 cited
Exploration of models for a cargo assembly planning problem
G. Belov, N. Boland, M. W. P. Savelsbergh +1
We consider a real-world cargo assembly planning problem arising in a coal supply chain. The cargoes are built on the stockyard at a port terminal from coal delivered by trains. Th…