mapf
Here are 65 public repositories matching this topic...
Language:All
Sort:Most stars
Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*
- Updated
Aug 30, 2024 - Python
An Efficient Multi-Agent Path Finding Solver for Car-Like Robots
- Updated
Jul 31, 2023 - C++
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.
- Updated
Mar 29, 2024 - C++
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.
- Updated
Sep 18, 2024 - Python
Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)
- Updated
Jan 14, 2023 - C++
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…
- Updated
Dec 5, 2021 - C++
Multi-agent pathfinding via Conflict Based Search
- Updated
Apr 22, 2024 - Jupyter Notebook
📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)
- Updated
Feb 27, 2025 - Python
Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)
- Updated
Sep 1, 2024 - C++
simple multi-agent pathfinding (MAPF) visualizer for research usage
- Updated
Nov 16, 2024 - C++
Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
- Updated
Mar 9, 2025 - C++
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)
- Updated
Mar 19, 2024 - C++
This repository contains MAPF-GPT, a deep learning-based model for solving MAPF problems. Trained with imitation learning on trajectories produced by LaCAM, it generates actions under partial observability without heuristics or agent communication. MAPF-GPT excels on unseen instances and outperforms state-of-the-art solvers.
- Updated
Sep 20, 2024 - Python
JAX-based implementation for multi-agent path planning (MAPP) in continuous spaces.
- Updated
Dec 13, 2022 - Jupyter Notebook
[AAAI-2025] This repository contains MAPF-GPT, a deep learning-based model for solving MAPF problems. Trained with imitation learning on trajectories produced by LaCAM, it generates actions under partial observability without heuristics or agent communication. MAPF-GPT excels on unseen instances and outperforms learnable state-of-the-art solvers
- Updated
Dec 26, 2024 - Python
[AAAI-2024] Follower: 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.
- Updated
Aug 26, 2024 - C++
[IROS 2024] EPH: Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding
- Updated
Oct 8, 2024 - Python
Multi-Agent Pickup and Delivery implementation
- Updated
Jul 30, 2024 - Python
Improve this page
Add a description, image, and links to themapf topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with themapf topic, visit your repo's landing page and select "manage topics."