PULS
Foto: Matthias Friel
Multi-agent path finding is the name of the problem of planning the path of a multitude of agents. The goal is to avoid collisions between the agents while optimizing the paths. In this lecture, the students will read relevant papers on the subject, write summaries about them and participate in a practical project.
Knowledge about ASP is mandatory for this course. Taking this course and the "Answer Set Solving in Practice" course in the same semester is discouraged.
The password is mapf29138mcp
© Copyright HISHochschul-Informations-System eG