On June 14th at 15:00 in LAB42, L3.33, Bernhard Nebel will present his research on the computational complexity of multi-agent pathfinding on directed graphs. This problem, also known as "pebble motion on graphs" or "cooperative pathfinding", involves determining the existence of or generating a collision-free movement plan for a set of agents moving on a graph.