Constructing policies for multi-agent path finding

The thesis deals with the Multi-Agent Path Finding problem. The task is to find for each agent a path from its current location to its destination in such a way that agents will not collide. A novel approach to solving this problem in non-deterministic environment is suggested. That is to look for a solution in form of policies that prescribe which action the agent should perform in given situation.