| Summary: | Multi-Agent Path Finding (MAPF) is a fundamental problem of planning paths for multi-agents where the key constraint is that the agents will be able to follow these paths concurrently without colliding with each other. Furthermore, there exist multiple algorithms used to solve the problem w.r.t multiple extended versions of the initial MAPF problem. However, to the best of my knowledge, there does not exist any platform allowing the users to visualize the detail paths of the agents dynamically w.r.t various maps and agent locations. To develop a new algorithm for MAPF, individual researchers must conduct their own experiments set up which is very inconvenient. Thus, there is a need for a centralized interface that could allow the researcher to test their own algorithm w.r.t different maps and agent locations. As a web application, the MAPF Visualizer will offer features like adding the new agent locations, changing the map as well as visualizing the paths of those agents w.r.t different algorithms in a map and their setup locations. The author will also propose a small improvement of the implementation of one algorithm named conflict-based search.
|
|---|