The control of a multiple unmanned aerial vehicle (UAV) system is popular and attracting a
lot of attentions. This is motivated by many practical civil and commercial UAV applications …

Recent years have shown a large increase in applications and research of problems that
include moving a fleet of physical robots. One particular application that is currently a multi …

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 …

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 …

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 study the offline Multi-Agent Pickup-and-Delivery (MAPD) problem, where a team of
agents has to execute a batch of tasks with release times in a known environment. To …

Abstract Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem that asks
us to plan collision-free paths for a team of cooperative agents. In this work, we show that …

We consider the problem of routing a large fleet of drones to deliver packages
simultaneously across broad urban areas. Besides flying directly, drones can use public …

Abstract Conflict-Based Search (CBS) and its enhancements are among the strongest
algorithms for the multi-agent path-finding problem. However, existing variants of CBS do …

Abstract The Multi-Agent Path Finding problem aims to find a set of collision-free paths that
minimizes the total cost of all paths. The problem is extensively studied in artificial …