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 …

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 …

We address the problem of optimal pathfinding for multiple agents. Given a start state and a
goal state for each of the agents, the task is to find minimal paths for the different agents …

Cooperative trajectory planning for autonomous vehicles has garnered significant attention
in structured environments, but corresponding methodologies for unstructured environments …

The task in the multi-agent path finding problem (MAPF) isto find paths for multiple agents,
each with a different startand goal position, such that agents do not collide. It is possibleto …

A* is often described as beingoptimal', in that it expands the minimum number of unique
nodes. But, A* may generate many extra nodes which are never expanded. This is a …

Planning optimal paths for large numbers of robots is computationally expensive. In this
thesis, we present a new framework for multirobot path planning called subdimensional …

In the multi-agent pathfinding (MAPF) problem, agents must move from their current
locations to their individual destinations while avoiding collisions. Ideally, agents move to …

This paper addresses optimal and near-optimal solving of the (N2–1)-puzzle using the A*
search algorithm. We develop a novel heuristic based on artificial neural networks (ANNs) …

In order to improve the efficiency of logistics warehouses, multi-agent path finding (MAPF)
has become a hot research. Although most of the current decentralized MAPF algorithms …