Jiaoyang-Li / RHCRView external linksLinks
An efficient solver for lifelong Multi-Agent Path Finding
☆193Dec 17, 2024Updated last year
Alternatives and similar repositories for RHCR
Users that are interested in RHCR are comparing it to the libraries listed below
Sorting:
- A bounded-suboptimal solver for Multi-Agent Path Finding☆128Jul 24, 2024Updated last year
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆126Jul 24, 2024Updated last year
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆256May 30, 2025Updated 8 months ago
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆74May 9, 2024Updated last year
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆103May 9, 2024Updated last year
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆142Apr 14, 2025Updated 10 months ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆95Apr 14, 2025Updated 10 months ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆70Aug 22, 2025Updated 5 months ago
- ☆30Sep 3, 2024Updated last year
- Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*☆431Aug 30, 2024Updated last year
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆75Mar 15, 2021Updated 4 years ago
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆52Jul 30, 2022Updated 3 years ago
- This is the repo for the team Pikachu's solution in the League of Robot Competition 2023. Our solution won the Overall Best and Fast Move…☆27Oct 17, 2024Updated last year
- Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allo…☆121Dec 5, 2021Updated 4 years ago
- Disjoint CBSH and IDCBS integrated with LPA* and other incremental techniques☆11Apr 17, 2021Updated 4 years ago
- C++ implementation of CBS with using SIPP as a low-level planner☆10Nov 27, 2018Updated 7 years ago
- Library with search algorithms for task and path planning for multi robot/agent systems☆984Aug 10, 2023Updated 2 years ago
- An Efficient Multi-Agent Path Finding Solver for Car-Like Robots☆403Jul 31, 2023Updated 2 years ago
- ☆50Apr 28, 2025Updated 9 months ago
- ☆32Feb 9, 2026Updated last week
- Training code PRIMAL2 - Public Repo☆187May 24, 2024Updated last year
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆33Nov 2, 2021Updated 4 years ago
- Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.☆68Nov 16, 2021Updated 4 years ago
- Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.☆26Feb 2, 2026Updated 2 weeks ago
- Multi-Agent Pickup and Delivery implementation☆38May 8, 2025Updated 9 months ago
- PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning -- Distributed RL/IL code for Multi-Agent Path Finding (MAPF)☆421Apr 9, 2024Updated last year
- BCP-MAPF – branch-and-cut-and-price for multi-agent path finding☆98Jul 28, 2025Updated 6 months ago
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆91Nov 16, 2024Updated last year
- Multi-agent pathfinding via Conflict Based Search☆113Apr 22, 2024Updated last year
- A Multi-Agent Path Finding visualization website.☆52Jan 7, 2024Updated 2 years ago
- [AAAI-2025] This repository contains MAPF-GPT, a deep learning-based model for solving MAPF problems. Trained with imitation learning on …☆116Jan 17, 2026Updated last month
- Python implementation of a bunch of multi-robot path-planning algorithms.☆1,424Apr 5, 2023Updated 2 years ago
- A* Search Algorithm with an Additional Time Dimension to Deal with Dynamic Obstacles☆203Jun 14, 2021Updated 4 years ago
- Conflict-based search for multi-agent path finding (MAPF)☆89Aug 29, 2022Updated 3 years ago
- Time-Optimal Any-Angle Safe Interval Path Planning☆10Mar 13, 2021Updated 4 years ago
- ☆37Jul 10, 2022Updated 3 years ago
- Time-Independent Planning for Multiple Moving Agents (AAAI-21)☆15Mar 16, 2023Updated 2 years ago
- ☆46Dec 18, 2024Updated last year
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆17Feb 5, 2024Updated 2 years ago