A review of graph-based multi-agent pathfinding solvers: From classical to beyond classical
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 …
robot system, where every robot finds the path to its goal position without any collision. Due …
Lifelong multi-agent path finding in large-scale warehouses
Abstract Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their
goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where …
goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where …
Multi-goal multi-agent pickup and delivery
In this work, we consider the Multi-Agent Pickup-and-Delivery (MAPD) problem, where
agents constantly engage with new tasks and need to plan collision-free paths to execute …
agents constantly engage with new tasks and need to plan collision-free paths to execute …
Multi-robot coordination and layout design for automated warehousing
With the rapid progress in Multi-Agent Path Finding (MAPF), researchers have studied how
MAPF algorithms can be deployed to coordinate hundreds of robots in large automated …
MAPF algorithms can be deployed to coordinate hundreds of robots in large automated …
Ultralight, strong, and self-reprogrammable mechanical metamaterials
Versatile programmable materials have long been envisioned that can reconfigure
themselves to adapt to changing use cases in adaptive infrastructure, space exploration …
themselves to adapt to changing use cases in adaptive infrastructure, space exploration …
Which MAPF model works best for automated warehousing?
Abstract Multi-Agent Path Finding (MAPF) algorithms and their variants can find high-quality
collision-free plans for automated warehousing under simplified assumptions about the …
collision-free plans for automated warehousing under simplified assumptions about the …
Double-deck multi-agent pickup and delivery: Multi-robot rearrangement in large-scale warehouses
B Li, H Ma - IEEE Robotics and Automation Letters, 2023 - ieeexplore.ieee.org
We introduce a new problem formulation, Double-Deck Multi-Agent Pickup and Delivery (DD-
MAPD), which models the multi-robot shelf rearrangement problem in automated …
MAPD), which models the multi-robot shelf rearrangement problem in automated …
ME‐MADDPG: An efficient learning‐based motion planning method for multiple agents in complex environments
Develo** efficient motion policies for multiagents is a challenge in a decentralized
dynamic situation, where each agent plans its own paths without knowing the policies of the …
dynamic situation, where each agent plans its own paths without knowing the policies of the …
Multi-UAV simultaneous target assignment and path planning based on deep reinforcement learning in dynamic multiple obstacles environments
X Kong, Y Zhou, Z Li, S Wang - Frontiers in Neurorobotics, 2024 - frontiersin.org
Target assignment and path planning are crucial for the cooperativity of multiple unmanned
aerial vehicles (UAV) systems. However, it is a challenge considering the dynamics of …
aerial vehicles (UAV) systems. However, it is a challenge considering the dynamics of …
Optimal and bounded-suboptimal multi-goal task assignment and path finding
We formalize and study the multi-goal task assignment and path finding (MG-TAPF) problem
from theoretical and algorithmic perspectives. The MG-TAPF problem is to compute an …
from theoretical and algorithmic perspectives. The MG-TAPF problem is to compute an …