Multi-agent Path Planning
Anna Gorbenko, Vladimir Popov · Electronic scientific archive of UrFU (Ural Federal University) · 2012
In this paper, we consider multi-agent path planning on graphs.In particular, we consider the multi-agent path planning problem on collision-free unit-distance graphs. We describe an approach to solve the problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.