Searched for: author%3A%22Baauw%2C+Robbin%22
(1 - 1 of 1)
Baauw, Robbin (author)
In the Multi-Agent Pathfinding with Matching (MAPFM) problem, agents from a team are matched with and routed towards one of their team's goals without colliding with other agents. The sum of path costs of all agents is minimized. In prior works, Conflict Based Min-Cost-Flow (CBM) has been proposed. This algorithm solves a similar problem that...
bachelor thesis 2021