There are 9 repositories under mapf topic.
Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Timeline is not discretized, i.e. is continuous.
POGEMA stands for Partially-Observable Grid Environment for Multiple Agents. This is a grid-based environment that was specifically designed to be flexible, tunable and scalable. It can be tailored to a variety of PO-MAPF settings.
Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allowed to follow any-angle path on the grid). Timeline is continuous, i.e. action durations are not explicitly discretized into timesteps. Different agents' size and moving speed are supported. Planning is carried out in (x, y, \theta) configuration space, i.e. agents' orientation are taken into account.
📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)
JAX-based implementation for multi-agent path planning (MAPP) in continuous spaces.
simple multi-agent pathfinding (MAPF) visualizer for research usage
Multi-Agent Pickup and Delivery implementation
Multi-agent reinforcement learning on trains, for Deep Learning class at UNIBO
This study addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed Follower approach utilizes a combination of a planning algorithm for constructing a long-term plan and reinforcement learning for resolving local conflicts.
MATS-LP addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed approach utilizes a combination of Monte Carlo Tree Search and reinforcement learning for resolving conflicts.
"When to Switch" Implementation: Addressing the PO-MAPF challenge with RePlan & EPOM policies. This repo includes search-based re-planning, reinforcement learning techniques, and three mixed policies for pathfinding in partially observable multi-agent environments. 🤖🛤️
Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.
Conflict Avoidant CBS (CA-CBS)
code corresponding to a research paper about M* (M star) and it's modification to solve multi agent pathfinding with matching problems (MMAPF)
Combinatorial Decision Making and Optimization Course Project.
Explainable Multi-Agent Path Finder (XMAPF, work in progress) based on Lazy Conflict-Based Search (Gange, Harabor and Stuckey, 2021).
Multi Agent Path Finding (MAPF) advanced solver infrastructure with Bi-Directional solver and automated splitting method
Multi Agent Path Finding CBS algorithm with visualization as a mini project in robotics seminar
This software solves the capacitated multi agent pickup and delivery problem using OR-Tools from Google.