Anytime multi-agent path finding via large neighborhood search

J Li, Z Chen, D Harabor, PJ Stuckey… - … Joint Conference on …, 2021 - research.monash.edu
Abstract Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-
free paths for multiple agents. Algorithms for solving MAPF can be categorized on a …
被引用次数：84 相关文章
[PDF] nsf.gov

[PDF][PDF] Anytime Multi-Agent Path Finding via Large Neighborhood Search

J Li, Z Chen, D Harabor, P Stuckey… - Proceedings of the …, 2021 - par.nsf.gov
Abstract Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-
free paths for multiple agents. Algorithms for solving MAPF can be categorized on a …

Anytime Multi-Agent Path Finding via Large Neighborhood Search

J Li, Z Chen, D Harabor, PJ Stuckey, S Koenig - generic.wordpress.soton.ac.uk
Abstract Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-
free paths for multiple agents. MAPF algorithms can be categorized on a spectrum. At one …
[PDF] harabor.net

[PDF][PDF] Anytime Multi-Agent Path Finding via Large Neighborhood Search

J Li, Z Chen, D Harabor, PJ Stuckey, S Koenig - harabor.net
Abstract Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-
free paths for multiple agents. Algorithms for solving MAPF can be categorized on a …
[PDF] ijcai.org

[PDF][PDF] Anytime Multi-Agent Path Finding via Large Neighborhood Search

J Li, Z Chen, D Harabor, PJ Stuckey, S Koenig - ijcai.org
Abstract Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-
free paths for multiple agents. Algorithms for solving MAPF can be categorized on a …
[PDF] ifaamas.org

[PDF][PDF] Anytime Multi-Agent Path Finding via Large Neighborhood Search

J Li, Z Chen, D Harabor, PJ Stuckey, S Koenig - 2021 - ifaamas.org
ABSTRACT Multi-Agent Path Finding (MAPF) is the challenging problem of computing
collision-free paths for a cooperative team of moving agents. Algorithms for solving MAPF …

Anytime Multi-Agent Path Finding via Large Neighborhood Search

J Li, Z Chen, D Harabor, PJ Stuckey… - Proceedings of the 20th …, 2021 - dl.acm.org
Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-free
paths for a cooperative team of moving agents. Algorithms for solving MAPF can be …
[PDF] archive.org

[PDF][PDF] Anytime Multi-Agent Path Finding via Large Neighborhood Search

J Li, Z Chen, D Harabor, PJ Stuckey, S Koenig - scholar.archive.org
Abstract Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-
free paths for multiple agents. Algorithms for solving MAPF can be categorized on a …
[PDF] liv.ac.uk

[PDF][PDF] Anytime Multi-Agent Path Finding via Large Neighborhood Search

J Li, Z Chen, D Harabor, PJ Stuckey, S Koenig - 2021 - ifmas.csc.liv.ac.uk
ABSTRACT Multi-Agent Path Finding (MAPF) is the challenging problem of computing
collision-free paths for a cooperative team of moving agents. Algorithms for solving MAPF …
[PDF] jiaoyangli.me

[PDF][PDF] Anytime Multi-Agent Path Finding via Large Neighborhood Search

J Li, Z Chen, D Harabor, PJ Stuckey, S Koenig - jiaoyangli.me
Abstract Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-
free paths for multiple agents. Algorithms for solving MAPF can be categorized on a …