We consider the problem of designing distributed collision-avoidance multi-agent control in
large-scale environments with potentially moving obstacles, where a large number of agents …

Multi-agent path finding (MAPF) is an indispensable component of large-scale robot
deployments in numerous domains ranging from airport management to warehouse …

In this work we present Digital Life Project a framework utilizing language as the universal
medium to build autonomous 3D characters who are capable of engaging in social …

We study optimal multirobot path planning on graphs (MPP) over four minimization
objectives: the makespan (last arrival time), the maximum (single-robot traveled) distance …

The multi-agent path-finding (MAPF) problem has recently received a lot of attention.
However, it does not capture important characteristics of many real-world domains, such as …

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 …

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 …

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

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 …

Multi-agent pathfinding (MAPF) is an area of expanding research interest. At the core of this
research area, numerous diverse search-based techniques were developed in the past 6 …