Symmetry-breaking constraints for grid-based multi-agent path finding

J Li, D Harabor, PJ Stuckey, H Ma, S Koenig - Proceedings of the AAAI …, 2019 - aaai.org
We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding
(MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve …

Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding

J Li, D Harabor, PJ Stuckey, H Ma… - Proceedings of the AAAI …, 2019 - cir.nii.ac.jp
抄録< jats: p> We describe a new way of reasoning about symmetric collisions for Multi-
Agent Path Finding (MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking …

[PDF][PDF] Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding

J Li, D Harabor, PJ Stuckey, H Ma, S Koenig - 2019 - cs.sfu.ca
We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding
(MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve …

Symmetry-breaking constraints for grid-based Multi-Agent Path Finding

J Li, D Harabor, PJ Stuckey, H Ma… - AAAI Conference on …, 2019 - research.monash.edu
We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding
(MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve …

Symmetry-breaking constraints for grid-based multi-agent path finding

J Li, D Harabor, PJ Stuckey, H Ma… - Proceedings of the Thirty …, 2019 - dl.acm.org
We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding
(MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve …

[PDF][PDF] Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding

J Li, D Harabor, PJ Stuckey, H Ma, S Koenig - 2019 - cdn.aaai.org
We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding
(MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve …

[PDF][PDF] Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding

J Li, D Harabor, PJ Stuckey, H Ma, S Koenig - 2019 - jiaoyangli.me
We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding
(MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve …

[PDF][PDF] Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding

J Li, D Harabor, PJ Stuckey, H Ma, S Koenig - 2019 - researchmgt.monash.edu
We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding
(MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve …

Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding

J Li, D Harabor, PJ Stuckey, H Ma… - Proceedings of the AAAI …, 2019 - ojs.aaai.org
We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding
(MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve …

[PDF][PDF] Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding

J Li, D Harabor, PJ Stuckey, H Ma, S Koenig - 2019 - harabor.net
We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding
(MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve …