Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics tha...
JPS (Jump Point Search) is a state-of-the-art optimal algorithm for onli...
The Flatland Challenge, which was first held in 2019 and reported in Neu...
The classic problem of constrained path finding is a well-studied
but ye...
The Euclidean shortest path problem (ESPP) is a well studied problem wit...
Bi-objective search is a well-known algorithmic problem, concerned with
...
Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem t...
During Multi-Agent Path Finding (MAPF) problems, agents can be delayed b...
The 13th Symposium on Combinatorial Search (SoCS) was held May 26-28, 20...
The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision...
We study prioritized planning for Multi-Agent Path Finding (MAPF). Exist...
Over two million containers crossed the docks at Sydney's Port Botany in...
In this paper we explore a symmetry-based search space reduction techniq...
The state of the art in local search for the Traveling Salesman Problem ...