mit-wu-lab / mapf_neural_neighborhood_searchLinks
☆12Updated last year
Alternatives and similar repositories for mapf_neural_neighborhood_search
Users that are interested in mapf_neural_neighborhood_search are comparing it to the libraries listed below
Sorting:
- Benchmarking Large Neighborhood Search for Multi-Agent Path Finding☆13Updated last month
- Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.☆64Updated 3 years ago
- python implementation of "Multi-Goal Multi-Agent Pickup and Delivery"☆12Updated 2 years ago
- [IROS 2024] EPH: Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding☆47Updated 11 months ago
- [AAMAS 2025 Oral] CAMP: Collaborative Attention Model with Profiles for Vehicle Routing Problems☆24Updated 4 months ago
- This repository contains the code for Diversity Control (DiCo), a novel method to constrain behavioral diversity in multi-agent reinforce…☆26Updated 9 months ago
- POGEMA stands for Partially-Observable Grid Environment for Multiple Agents. This is a grid-based environment that was specifically desig…☆44Updated 2 months ago
- [AAAI-2024] Follower: This study addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed Follow…☆46Updated last month
- Algorithms for the Orienteering Problem☆41Updated 4 months ago
- Uber's Multi-Agent Routing Value Iteration Network☆64Updated 4 years ago
- Public version of the decentralized, attention-based mTSP code☆37Updated 4 years ago
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆70Updated last year
- The official implementation of "RouteExplainer: An Explanation Framework for Vehicle Routing Problem" (PAKDD 2024, oral)☆15Updated last year
- A ray-based library of Distributed POPulation-based OPtimization for Large-Scale Black-Box Optimization.☆18Updated last year
- Population-Based Reinforcement Learning for Combinatorial Optimization☆81Updated last year
- The Flatland Framework is a multi-purpose environment to tackle problems around resilient resource allocation under uncertainty. It is de…☆47Updated last week
- ☆19Updated 2 months ago
- [NeurIPS 2025] PARCO: Parallel AutoRegressive Combinatorial Optimization☆26Updated last week
- [AAAI-2025] This repository contains MAPF-GPT, a deep learning-based model for solving MAPF problems. Trained with imitation learning on …☆81Updated last month
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆34Updated 6 years ago
- ☆36Updated 9 months ago
- Conflict-Based Search and Enhanced CBS in Julia☆33Updated 4 years ago
- Code accompanying the paper Graph Neural Network Guided Local Search for the Traveling Salesperson Problem☆29Updated 2 years ago
- RouteRL is a multi-agent reinforcement learning framework for modeling and simulating the collective route choices of humans and autonomo…☆27Updated this week
- [AAAI-2024] MATS-LP addresses the challenging problem of decentralized lifelong multi-agent pathfinding. The proposed approach utilizes a…☆25Updated last month
- Efficient Large-Scale Multi-Drone Delivery Using Transit Networks☆83Updated 2 years ago
- [TMLR 2025 + ICML 2024 FM-Wild Oral] RouteFinder: Towards Foundation Models for Vehicle Routing Problems☆89Updated last week
- COMPASS: Combinatorial Optimization with Policy Adaptation using Latent Space Search☆41Updated last year
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆38Updated 5 months ago
- [NeurIPS 2024] "Collaboration! Towards Robust Neural Methods for Routing Problems"☆20Updated 10 months ago