- document
-
Siekman, Stef (author)In the field of cooperative multi-agent pathfinding (MAPF) the optimal set of non-conflicting paths must be found for a set of agents in a graph. The addition of waypoints to this problem (MAPFW) gives rise to the possibility of more complex applications, such as in vehicle routing, aviation, computer games or robotics. Yet no algorithms have...bachelor thesis 2020
- document
-
van Dijk, Jeroen (author)Little to no research has been done on the multi-agent path finding with waypoints problem (MAPFW) even though it has many important real world applications. In this paper we extend an existing algorithm for the multi-agent path finding problem (MAPF) called M* \cite{New}. We do so by ordering the waypoints using a Travelling salesman problem...bachelor thesis 2020
- document
-
Bestebreur, Timon (author)The Multi-Agent Path Finding (MAPF) problem is a problem in which a route must be found for multiple agents such that they do not collide. The Multi-Agent 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
-
Ferwerda, Arjen (author)Multi-Agent 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
- document
-
Oude Grotebevelsborg, Rik (author)Successful implementation of fully autonomous vehicles is a much desired objective. Within the area of unmanned marine craft or unmanned surface vehicles (USV), the implementation of truly autonomous navigation is still a challenge. During times in which humans are still actively involved in the processof maritime navigation, regulations are...master thesis 2019