Pathfinder | Informatik von Kersten Reinhard Brändle
The Pathfinder solves a problem of the HFTM’s “RoboCup” - team: The task of the team's robots is to autonomously find a path between two points within a complex factory set up. As this is done against competing robots, the path has to be found fast. The common shortest path algorithms such as Dijkstra and A* are too slow while maintaining the required precision.