Abstract The Multi-Agent Pickup and Delivery (MAPD) problem models applications where a
large number of agents attend to a stream of incoming pickup-and-delivery tasks. Token …

Abstract Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free
paths for a team of agents in a common environment. MAPF is NP-hard to solve optimally …

In this paper, we review multi-agent collective behavior algorithms in the literature and
classify them according to their underlying mathematical structure. For each mathematical …

We propose a neural network (NN) approach that yields approximate solutions for high-
dimensional optimal control (OC) problems and demonstrate its effectiveness using …

This paper presents a new efficient algorithm which guarantees a solution for a class of multi-
agent trajectory planning problems in obstacle-dense environments. Our algorithm …

We describe an attempt to unify search-based and compilation-based approaches to multi-
agent path finding (MAPF) through satisfiability modulo theories (SMT). The task in MAPF is …

Abstract In Multi-Agent Path Finding (MAPF), a team of agents needs to find collision-free
paths from their starting locations to their respective targets. Combined Target Assignment …

Multi-agent pathfinding (MAPF) is a well-studied abstract model for navigation in a multi-
robot system, where every robot finds the path to its goal position without any collision. Due …

This letter presents a new online multi-agent trajectory planning algorithm that guarantees to
generate safe, dynamically feasible trajectories in a cluttered environment. The proposed …

Incorporating mobile robots into the production shop-floor helps realize the concept of smart
production, and it is considered one of the approaches to enhance manufacturing and …