Multi-agent pathfinding via Conflict Based Search
☆121Apr 22, 2024Updated 2 years ago
Alternatives and similar repositories for MAPF-ICBS
Users that are interested in MAPF-ICBS are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- CBS, MA-CBS algorithms and evaluation of these algorithms.☆31Aug 26, 2026Updated 2 months ago
- Conflict-based search for multi-agent path finding (MAPF)☆91Aug 29, 2022Updated 4 years ago
- Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*☆446Aug 30, 2024Updated 2 years ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆139Jul 24, 2024Updated 2 years ago
- Multi-Agent Path Finding in C++ (WHCA*, iWHCA*, WCBS)☆57Jul 1, 2020Updated 6 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Python implementation of Space-time A*, Prioritized Planning, & Conflict-based Search for Multi-agent Path Finding (MAPF)☆34Nov 30, 2020Updated 5 years ago
- A solution of Multi-Agent Path Finding problem☆72Apr 16, 2024Updated 2 years ago
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆272May 30, 2025Updated last year
- A bounded-suboptimal solver for Multi-Agent Path Finding☆140Jul 24, 2024Updated 2 years ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆84Aug 22, 2025Updated last year
- Conflict-based search for optimal multi-agent pathfinding☆29Nov 8, 2025Updated 11 months ago
- Some Multi-Agent Path Planning algorithms☆13Sep 27, 2020Updated 6 years ago
- Goal of project is to write programs that will allow multiple agents to find optimal paths from their start location to their goal locat…☆35Sep 2, 2021Updated 5 years ago
- Quick Multi-Robot Motion Planning by Combining Sampling and Search (IJCAI-23)☆26Apr 14, 2025Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- ☆40Jul 10, 2022Updated 4 years ago
- An efficient solver for lifelong Multi-Agent Path Finding☆223Dec 17, 2024Updated last year
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆76May 9, 2024Updated 2 years ago
- naive implementations of Multi-Agent Path Finding algorithms☆15Sep 4, 2025Updated last year
- This is a multi-agent path planning(also known as Multi-Agent Path Finding, MAPF) algorithm package for ROS/ROS2.☆252May 12, 2025Updated last year
- A novel offline Multi-Agent Path Planning approach using MLA* and IDA* with Floyd Warshall based heuristic computation☆19Apr 12, 2021Updated 5 years ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆124May 9, 2024Updated 2 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆122Apr 14, 2025Updated last year
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆145Apr 14, 2025Updated last year
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- An offline visualization tool for analysing solutions to multi-robot coordination problems.☆57Sep 10, 2026Updated last month
- An Efficient Multi-Agent Path Finding Solver for Car-Like Robots☆421Jul 31, 2023Updated 3 years ago
- The repository contains the implementation Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. It plans and navigates more t…☆34Jul 21, 2025Updated last year
- ☆58Apr 28, 2025Updated last year
- ☆17Updated this week
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆99Nov 16, 2024Updated last year
- ☆22Updated this week
- BCP-MAPF – branch-and-cut-and-price for multi-agent path finding☆99Jul 28, 2025Updated last year
- Kinodynamic-CBS (K-CBS) is a decentralized motion planning algorithm capable of solving complex multi-agent motion planning queries for a…☆18Dec 28, 2023Updated 2 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- A MAPF framework in C#, with implementations for MA-CBS, ICBS, CBSH, ID, A*, A*+OD, and EPEA*☆55Apr 29, 2025Updated last year
- Python implementation of a bunch of multi-robot path-planning algorithms.☆1,472Apr 5, 2023Updated 3 years ago
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆80Mar 15, 2021Updated 5 years ago
- Solve Multi-agent Path Finding problem for heterogeneous robots.☆30Feb 24, 2021Updated 5 years ago
- Library with search algorithms for task and path planning for multi robot/agent systems☆1,051Aug 10, 2023Updated 3 years ago
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆18Feb 5, 2024Updated 2 years ago
- 3 algorithms for classical MAPF on 4 connected grid in one project☆37Jun 30, 2022Updated 4 years ago