A* is a search algorithm that has long been used in the pathfinding research community. Its
efficiency, simplicity, and modularity are often highlighted as its strengths compared to other …

Mobile robot path planning involves designing optimal routes from starting points to
destinations within specific environmental conditions. Even though there are well …

The multi-agent pathfinding problem (MAPF) is the fundamental problem of planning paths
for multiple agents, where the key constraint is that the agents will be able to follow these …

Georgios N. Yannakakis Julian Togelius Page 1 Artificial Intelligence and Games Georgios N.
Yannakakis Julian Togelius Page 2 Artificial Intelligence and Games Page 3 Georgios N …

We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF
algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed …

In the multi-agent pathfinding problem (MAPF) we are given a set of agents each with
respective start and goal positions. The task is to find paths for all agents while avoiding …

The task in the multi-agent path finding problem (MAPF) is to find paths for multiple agents,
each with a different start and goal position, such that agents do not collide. A successful …

Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that each agent reaches its goal and the agents do not collide. In recent years, variants …

We consider the construction of neural network architectures for data on simplicial
complexes. In studying maps on the chain complex of a simplicial complex, we define three …

Abstract Conflict-Based Search (CBS) and its generalization, Meta-Agent CBS are amongst
the strongest newly introduced algorithms for Multi-Agent Path Finding. This paper …