BCP-MAPF-CPP

Branch-and-Cut-and-Price applied to Multi-Agent Pathfinding Problem

Reference

[1]Lam E, Le Bodic P, Harabor D D, et al. Branch-and-Cut-and-Price for Multi-Agent Pathfinding[C]//IJCAI. 2019: 1289-1296.

[2]Lam E, Le Bodic P. New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding[C]//Proceedings of the International Conference on Automated Planning and Scheduling. 2020, 30: 184-192.

[3]Silver D. Cooperative Pathfinding[J]. AIIDE, 2005, 1: 117-122.