Multirobot 2016 - Workshop on Multirobot Path Finding

This workshop addresses the problem of multi-agent path following where the goal is to compute a path multiple agents from an initial to a goal location without colliding with other agents, while at the same time optimizing a cost function like distance traveled. The past five years have seen the rise of provably correct algorithms for multi agent path finding. These algorithms can find optimal solutions to problems that were previously only solvable via heuristic methods. These algorithms fall into three broad categories; search based algorithms, which intelligently generate low-dimensional representations of the very high-dimensional multi agent path finding problem; rule based algorithms, which compose simple behaviors to generate paths for even densely packed systems; and AI based approaches, which recast the multi agent path finding problem as a canonical problem in AI for which advanced planners exist. The purpose of the proposed workshop is to gather the foremost designers of multi-agent algorithms in each of these categories, and practitioners who operate large multi agent systems in a common forum. Topics to be covered, but are not limited to, include
Advanced search based algorithms
Rule-based approaches
Boolean satisfiable approaches
Subdimensional expansion / managing large configuration spaces
Permutations of tasks / scheduling
Practical uses and implementations of multi-agent planning
Network / Topology-based approaches