Jiaoyang-Li / Flatland
Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.
☆58Updated 3 years ago
Alternatives and similar repositories for Flatland:
Users that are interested in Flatland are comparing it to the libraries listed below
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆58Updated 10 months ago
- Minimal Python implementation of PIBT for MAPF☆28Updated last year
- An offline visualization tool for analysing solutions to multi-robot coordination problems.☆33Updated last month
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆44Updated 2 years ago
- Distributed Heuristic Multi-Agent Path Finding with Communication - ICRA 2021☆68Updated 3 years ago
- [IROS 2024] EPH: Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding☆40Updated 5 months ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆75Updated 10 months ago
- Conflict-Based Search and Enhanced CBS in Julia☆31Updated 4 years ago
- ☆16Updated 3 years ago
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆29Updated 3 years ago
- Multi-Agent Pickup and Delivery implementation☆35Updated 7 months ago
- BCP-MAPF – branch-and-cut-and-price for multi-agent path finding☆86Updated 5 months ago
- A multi-agent reinforcement learning solution to Flatland3 challenge.☆16Updated last year
- The official repo for ICRA 2023 paper 'Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality'☆18Updated last year
- Disjoint CBSH and IDCBS integrated with LPA* and other incremental techniques☆11Updated 3 years ago
- offical code of paper 'SCRIMP: Scalable Communication for Reinforcement- and Imitation-Learning-Based Multi-Agent Pathfinding'☆46Updated last year
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆69Updated 6 months ago
- Learnable MAPF. “Distributed Heuristic Multi-Agent Path Finding with Communication” (DHC) algorithm from ICRA 2021 is implemented and ben…☆18Updated last year
- [AAAI-2024] Follower: This study addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed Follow…☆39Updated 7 months ago
- CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces (AAMAS-22)☆34Updated 2 years ago
- ☆26Updated 2 weeks ago
- Implementations of various algorithms used to solve the problem of Multi-Agent Pickup and Delivery (a generalization of Multi-Agent Path …☆59Updated 3 years ago
- ☆11Updated 10 months ago
- ☆29Updated 6 months ago
- Public version of the decentralized, attention-based mTSP code☆36Updated 3 years ago
- The Flatland Framework is a multi-purpose environment to tackle problems around resilient resource allocation under uncertainty. It is de…☆36Updated this week
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆69Updated 4 years ago
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆65Updated 4 months ago
- An algorithm for exploiting Reinforcement Learning (RL) on Multi-agent Path Finding tasks.☆57Updated 3 years ago
- POGEMA stands for Partially-Observable Grid Environment for Multiple Agents. This is a grid-based environment that was specifically desig…☆30Updated 2 weeks ago