 document

Hanou, Issa (author)Shunting yards are the locations where trains, which are not included in the train schedule at a certain time, are parked until they are required again. Managing the parking of the trains such that all trains can leave at the desired time is a complicated task, and results in the problem formally known as the Train Unit Shunting Problem (TUSP)....master thesis 2022
 document

van der Woude, Thom (author)Both the assignment problem and the multiagent pathfinding problem are common problems in the fields of robotics and transportation. The joint problem of multiagent pathfinding extended with the assignment of goals to agents, matching, is something that has not been studied much; few methods exist today that solve it. In this work, two types...bachelor thesis 2021
 document

de Bruin, Ivar (author)This paper extends the MultiAgent Pathfinding (MAPF) algorithm, A*+ID+OD, to be able to solve problems with matching. This extension still keeps the optimal and completeness properties of the original algorithm. Matching is added to the algorithm in both an exhaustive and heuristic manner. Exhaustive matching is further improved by adding a new...bachelor thesis 2021
 document

DĂ¶nszelmann, Jonathan (author)Multiagent pathfinding (MAPF) is the process of finding collisionfree paths for multiple agents. MAPF can be extended by grouping agents into teams. In a team, agents need to be assigned (or matched) to one of the team's goals such that the sum of individual cost} is minimised. This extension is called MAPF with matching (MAPFM). M* is a...bachelor thesis 2021
 document

de Jong, Jaap (author)For the MultiAgent Pathfinding (MAPF) problem, a set of noncolliding paths must be found for multiple agents. In MultiAgent Pathfinding with Matching (MAPFM), this problem is extended: agents and goals are added to a team and each agent has to navigate to a goal that belongs to the same team. In this paper, two extensions of the EPEA* MAPF...bachelor thesis 2021
 document

Baauw, Robbin (author)In the MultiAgent 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 MinCostFlow (CBM) has been proposed. This algorithm solves a similar problem that...bachelor thesis 2021
 document

Bestebreur, Timon (author)The MultiAgent Path Finding (MAPF) problem is a problem in which a route must be found for multiple agents such that they do not collide. The MultiAgent PathFinding with Waypoints problem extends this problem by adding waypoints that the agents must visit before travelling to their end location. This paper compares five algorithms for MAPF...bachelor thesis 2020
 document

Michels, Andor (author)In the multiagent pathfinding (MAPF) problem, agents have to traverse a graph to a goal location without running into each other. Currently, the BranchandCutandPriceMAPF (BCPMAPF) algorithm is the stateoftheart algorithm for solving MAPF problems, which uses BranchPriceandCut (BPC) to solve a linear minimization problem. The multi...bachelor thesis 2020
 document

Jadoenathmisier, Noah (author)MultiAgent Path Finding with Waypoints (MAPFW) is the problem of routing agents through a graph past a set of waypoint to a goal location, without agents colliding, with the shortest combined path length. This problem has to the authors knowledge not been investigated yet even though it has implications in train scheduling problems and video...bachelor thesis 2020
 document

Ferwerda, Arjen (author)MultiAgent Pathfinding (MAPF) is a problem in which the goal is to plan paths for distinct agents while avoiding collisions between agents. We consider a new variation of MAPF, namely MAPF with multiple waypoints (MAPFW), where agents are required to visit a set of intermediary locations before visiting their end goal. MAPFW may have...bachelor thesis 2020