Papers from the 2012 AAAI Workshop

Recently, there has been a growing interest in multiagent path planning. The problem is to compute a path for each agent from an initial to a goal location without conflicting with other agents, often aiming to minimize a cost function, such as elapsed time or throughput. Applications include vehicle fleet coordination, computer games, robotics and various military scenarios. The papers in this workshop present the state of the art and discuss open challenges.