Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.
☆70Nov 16, 2021Updated 4 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
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆52Jul 30, 2022Updated 4 years ago
- Multi-agent reinforcement learning on trains, for Deep Learning class at UNIBO☆21Jan 14, 2021Updated 5 years ago
- BCP-MAPF – branch-and-cut-and-price for multi-agent path finding☆99Jul 28, 2025Updated last year
- ☆22May 9, 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.
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆75May 9, 2024Updated 2 years ago
- An efficient solver for lifelong Multi-Agent Path Finding☆218Dec 17, 2024Updated last year
- Traffic management libraries for RMF☆39Sep 24, 2026Updated 2 weeks ago
- The Flatland Framework is a multi-purpose environment to tackle problems around resilient resource allocation under uncertainty. It is de…☆73Updated this week
- Multi-Agent Pickup and Delivery implementation☆39May 8, 2025Updated last year
- 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…☆29Oct 17, 2024Updated last year
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆138Jul 24, 2024Updated 2 years ago
- Time-Optimal Any-Angle Safe Interval Path Planning☆11Mar 13, 2021Updated 5 years ago
- ☆38Jul 15, 2026Updated 2 months ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆145Apr 14, 2025Updated last year
- The official repo for ICRA 2023 paper 'Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality'☆21May 25, 2023Updated 3 years ago
- Implementations of various algorithms used to solve the problem of Multi-Agent Pickup and Delivery (a generalization of Multi-Agent Path …☆75Nov 22, 2021Updated 4 years ago
- 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
- Official implementation of the paper "Multi-Robot Coordination and Layout Design for Automated Warehousing", published in IJCAI 2023.☆26Oct 4, 2023Updated 3 years ago
- STRIPS benchmarks for classical planning☆16Mar 29, 2022Updated 4 years ago
- ☆55Dec 18, 2024Updated last year
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆34Nov 2, 2021Updated 4 years ago
- Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allo…☆128Dec 5, 2021Updated 4 years ago
- Open source password manager - Proton Pass • AdSecurely store, share, and autofill your credentials with Proton Pass, the end-to-end encrypted password manager trusted by millions.
- Time-Independent Planning for Multiple Moving Agents (AAAI-21)☆15Mar 16, 2023Updated 3 years ago
- [AAAI-2024] Follower: This study addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed Follow…☆67Jul 28, 2025Updated last year
- Minimal Python implementation of PIBT for MAPF☆64Nov 4, 2025Updated 11 months ago
- Disjoint CBSH and IDCBS integrated with LPA* and other incremental techniques☆11Apr 17, 2021Updated 5 years ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆137Jul 24, 2024Updated 2 years ago
- Flatland Multi Agent Reinforcement Learning☆16Aug 1, 2020Updated 6 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆117Apr 14, 2025Updated last year
- 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
- An offline visualization tool for analysing solutions to multi-robot coordination problems.☆55Sep 10, 2026Updated 3 weeks ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- LaCAM: a quick and scalable multi-agent pathfinding algorithm☆30Feb 26, 2026Updated 7 months ago
- Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution (ICAPS-22; AIJ-23)☆31Aug 23, 2025Updated last year
- ☆17May 9, 2025Updated last year
- ☆13Apr 5, 2019Updated 7 years ago
- Precedence constrained multi-agent task assignment and path finding☆17Dec 26, 2023Updated 2 years ago
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆42Aug 22, 2025Updated last year
- Pathfinding and search testbed/visualization suite. Current code is in PDB-refactor branch.☆126Jul 9, 2026Updated 3 months ago