IEEE

Path Coordination for Robust, Fast, and Scalable Multi-Agent Path Finding Under Unforeseen Delays

Abstract: Multi-agent path finding (MAPF), i.e., finding collision-free paths for multiple agents on graphs, is widely applied to domains such as warehouse automation, robotic manufacturing, and ...
IEEE

Adaptive Lifelong Multi-Agent Path Finding With Multiple Priorities

Abstract: In this letter, we introduce the Lifelong Evaluation-Based Large Neighborhood Search (LEB-LNS) algorithm designed to address the Lifelong Adaptive Multiple Priorities Multi-Agent Path ...
GitHub

Lifelong Planning A* (LPA*) is a replanning method that is an incremental version of A* algorithm for single-shot grid-based 2D path finding.

Current project provides an implementation of LPA* algorithm adapted for single-shot grid-based 2D environment. Current implementation is not a complete LPA* with random map changes. For the sake of ...
GitHub

Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic

This software is based on the latest MAPF-LNS implementation from [1] and Anytime Multi-Agent Path Finding from [2]. Adaptive Delay-based Destroy-and-Repair Enhanced with Success-based Self-Learning ...