SMART is an efficient soft-tool that bridge the gap between Multi-Agent Path Finding (MAPF) and real-world application. More details can be found in our paper: Advancing MAPF towards the Real World: A Scalable Multi-Agent Realistic Testbed (SMART) [1].
☆37Feb 13, 2026Updated 2 weeks ago
Alternatives and similar repositories for smart
Users that are interested in smart are comparing it to the libraries listed below
Sorting:
- ☆17May 9, 2025Updated 9 months ago
- Official implementation of the paper "Guidance Graph Optimization for Lifelong Multi-Agent Path Finding", published in IJCAI 2024.☆17Apr 29, 2024Updated last year
- Official implementation of the paper "Multi-Robot Coordination and Layout Design for Automated Warehousing", published in IJCAI 2023.☆24Oct 4, 2023Updated 2 years ago
- ☆15May 29, 2025Updated 8 months 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
- Lightweight and Effective Preference Construction in PIBT for Large-Scale Multi-Agent Pathfinding (SoCS-25)☆15May 21, 2025Updated 9 months ago
- Solve Multi-agent Path Finding problem for heterogeneous robots.☆31Feb 24, 2021Updated 5 years ago
- ☆25Nov 5, 2025Updated 3 months ago
- ☆17May 9, 2025Updated 9 months ago
- ☆12May 8, 2024Updated last year
- Disjoint CBSH and IDCBS integrated with LPA* and other incremental techniques☆11Apr 17, 2021Updated 4 years ago
- Precedence constrained multi-agent task assignment and path finding☆15Dec 26, 2023Updated 2 years ago
- This is code repo for the paper, Depolying Ten Thousand Robots: Scalable Imitation Learninig for Lifelong Mulit-Agent Path Finding, which…☆62Feb 15, 2026Updated last week
- The global planner used in our paper 'ODS-Bot: Mobile robot navigation for outdoor delivery services' (IEEE Access '22)☆15May 20, 2024Updated last year
- Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.☆68Nov 16, 2021Updated 4 years ago
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆72May 9, 2024Updated last year
- The local planner used in our paper 'ODS-Bot: Mobile Robot Navigation for Outdoor Delivery Services' (IEEE Access '22)☆22May 18, 2024Updated last year
- A bounded-suboptimal solver for Multi-Agent Path Finding☆130Jul 24, 2024Updated last year
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆104May 9, 2024Updated last year
- ☆51Apr 28, 2025Updated 9 months ago
- Learnable MAPF. “Distributed Heuristic Multi-Agent Path Finding with Communication” (DHC) algorithm from ICRA 2021 is implemented and ben…☆24Nov 9, 2023Updated 2 years ago
- Multi-Robot Motion Planning with Diffusion Models☆185Feb 13, 2025Updated last year
- [ICLR-2025] POGEMA stands for Partially-Observable Grid Environment for Multiple Agents. This is a grid-based environment that was specif…☆269Updated this week
- Implementation of ORCA algorithm☆167Mar 27, 2024Updated last year
- Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.☆27Feb 2, 2026Updated 3 weeks ago
- An efficient solver for lifelong Multi-Agent Path Finding☆194Dec 17, 2024Updated last year
- An algorithm for exploiting Reinforcement Learning (RL) on Multi-agent Path Finding tasks.☆63Feb 9, 2022Updated 4 years ago
- Minimal Python implementation of LaCAM* for MAPF☆43Feb 17, 2026Updated last week
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆71Aug 22, 2025Updated 6 months ago
- ☆32Feb 20, 2026Updated last week
- Traffic management libraries for RMF☆33Jan 13, 2026Updated last month
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆33Nov 2, 2021Updated 4 years ago
- A simple example for fully integrated Python development of a ROS / ROS2 project in PyCharm☆10Oct 6, 2025Updated 4 months ago
- ☆11Dec 17, 2024Updated last year
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆37Aug 22, 2025Updated 6 months ago
- Downloads files and folders from LumiNUS☆11May 6, 2023Updated 2 years ago
- A bookshelf generator Kit Extension created using OpenUSD☆12Jul 25, 2024Updated last year
- Zheng, Dongliang, and Panagiotis Tsiotras. "Accelerating Kinodynamic RRT* Through Dimensionality Reduction." 2021 IEEE/RSJ International …☆44Mar 19, 2022Updated 3 years ago
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆256May 30, 2025Updated 9 months ago