Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.
☆70Nov 16, 2021Updated 5 years ago
Alternatives and similar repositories for Flatland
Users that are interested in Flatland are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆58Apr 28, 2025Updated last year
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆78May 9, 2024Updated 2 years ago
- ☆12May 8, 2024Updated 2 years ago
- Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)☆31Apr 14, 2025Updated last year
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆52Jul 30, 2022Updated 4 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Multi-agent reinforcement learning on trains, for Deep Learning class at UNIBO☆20Jan 14, 2021Updated 5 years ago
- ☆21Nov 11, 2025Updated last year
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆139Jul 24, 2024Updated 2 years ago
- The Flatland Framework is a multi-purpose environment to tackle problems around resilient resource allocation under uncertainty. It is de…☆77Updated this week
- ☆23Nov 3, 2026Updated 2 weeks ago
- BCP-MAPF – branch-and-cut-and-price for multi-agent path finding☆99Jul 28, 2025Updated last year
- An efficient solver for lifelong Multi-Agent Path Finding☆224Dec 17, 2024Updated last year
- Multi-Agent Pickup and Delivery implementation☆39May 8, 2025Updated last year
- ☆12Dec 9, 2023Updated 2 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- ☆56Dec 18, 2024Updated last year
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆145Apr 14, 2025Updated last year
- ☆14Apr 5, 2019Updated 7 years ago
- Time-Independent Planning for Multiple Moving Agents (AAAI-21)☆15Mar 16, 2023Updated 3 years ago
- Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allo…☆129Dec 5, 2021Updated 4 years ago
- ☆11Mar 22, 2022Updated 4 years ago
- Traffic management libraries for RMF☆43Updated this week
- 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…☆30Oct 17, 2024Updated 2 years ago
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆273May 30, 2025Updated last year
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆126May 9, 2024Updated 2 years ago
- Time-Optimal Any-Angle Safe Interval Path Planning☆11Mar 13, 2021Updated 5 years ago
- Quick Multi-Robot Motion Planning by Combining Sampling and Search (IJCAI-23)☆26Apr 14, 2025Updated last year
- Implementation of PIBT with toio robots☆10Feb 24, 2022Updated 4 years ago
- ☆17Nov 3, 2026Updated 2 weeks ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆121Apr 14, 2025Updated last year
- ☆13Aug 20, 2023Updated 3 years ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆142Jul 24, 2024Updated 2 years ago
- An offline visualization tool for analysing solutions to multi-robot coordination problems.☆58Sep 10, 2026Updated 2 months ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- [AAAI-2024] Follower: This study addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed Follow…☆67Jul 28, 2025Updated last year
- Flatland code for our submission to the NeurIPS 2020 Flatland challenge (round 1 winner, 4th place at round 2).☆11Feb 2, 2021Updated 5 years ago
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆34Nov 2, 2021Updated 5 years ago
- Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution (ICAPS-22; AIJ-23)☆31Aug 23, 2025Updated last year
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆42Aug 22, 2025Updated last year
- Implementations of various algorithms used to solve the problem of Multi-Agent Pickup and Delivery (a generalization of Multi-Agent Path …☆77Nov 22, 2021Updated 4 years ago
- 3 algorithms for classical MAPF on 4 connected grid in one project☆37Jun 30, 2022Updated 4 years ago
Are these results useful?