Implementations of various algorithms used to solve the problem of Multi-Agent Pickup and Delivery (a generalization of Multi-Agent Path Finding).
☆76Nov 22, 2021Updated 4 years ago
Alternatives and similar repositories for Multi-Agent_Pickup_and_Delivery
Users that are interested in Multi-Agent_Pickup_and_Delivery are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Multi-Agent Pickup and Delivery implementation☆38May 8, 2025Updated last year
- python implementation of "Multi-Goal Multi-Agent Pickup and Delivery"☆13May 18, 2023Updated 3 years ago
- The official repo for ICRA 2023 paper 'Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality'☆21May 25, 2023Updated 3 years ago
- Time-Independent Planning for Multiple Moving Agents (AAAI-21)☆15Mar 16, 2023Updated 3 years ago
- 🤖 ASPRILO, an intra-logistics benchmark suite for answer set programming☆70Jun 24, 2026Updated last month
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- A bounded-suboptimal solver for Multi-Agent Path Finding☆135Jul 24, 2024Updated 2 years ago
- Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*☆442Aug 30, 2024Updated last year
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆145Apr 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
- ☆16Dec 16, 2024Updated last year
- A Layered Approach for Multi-Agent Path Finding☆12Jan 5, 2023Updated 3 years ago
- Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.☆29Feb 2, 2026Updated 6 months ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆114Apr 14, 2025Updated last year
- An efficient solver for lifelong Multi-Agent Path Finding☆211Dec 17, 2024Updated last year
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆269May 30, 2025Updated last year
- Minimal Python implementation of PIBT for MAPF☆62Nov 4, 2025Updated 9 months ago
- Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution (ICAPS-22; AIJ-23)☆31Aug 23, 2025Updated 11 months ago
- Robotic Order Fulfillment System Using Kiva-like mobile robots. Conflict-based Search multi-robot path planning.☆138Dec 12, 2019Updated 6 years ago
- Heuristic Search vs. Learning. "Distributed Heuristic Multi-Agent Path Finding with Communication" reproduced, trained & benchmarked with…☆28Dec 27, 2022Updated 3 years ago
- Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.☆70Nov 16, 2021Updated 4 years ago
- Training code PRIMAL2 - Public Repo☆198May 24, 2024Updated 2 years ago
- Official implementation of the paper "Guidance Graph Optimization for Lifelong Multi-Agent Path Finding", published in IJCAI 2024.☆25Mar 10, 2026Updated 5 months ago
- Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)☆31Apr 14, 2025Updated last year
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Conflict-based search for multi-agent path finding☆111Apr 5, 2019Updated 7 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)☆42Nov 23, 2021Updated 4 years ago
- Multi-agent pathfinding via Conflict Based Search☆122Apr 22, 2024Updated 2 years ago
- ☆13Apr 5, 2019Updated 7 years ago
- [ICLR-2025] POGEMA stands for Partially-Observable Grid Environment for Multiple Agents. This is a grid-based environment that was specif…☆297Updated this week
- [ICLR 2026] Towards Efficient Constraint Handling in Neural Solvers for Routing Problems☆15Feb 20, 2026Updated 5 months ago
- Multi Agent Path Finding Algorithms☆100Jun 19, 2021Updated 5 years ago
- An Efficient Multi-Agent Path Finding Solver for Car-Like Robots☆415Jul 31, 2023Updated 3 years ago
- ☆30Sep 3, 2024Updated last year
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- SMART is an efficient soft-tool that bridge the gap between Multi-Agent Path Finding (MAPF) and real-world application. More details can …☆66Jul 14, 2026Updated last month
- Distilled version of LaGAT: a neuro-guided search for multi-agent pathfinding (MAPF)☆15Jul 18, 2026Updated last month
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆115May 9, 2024Updated 2 years ago
- 📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)☆77Aug 11, 2026Updated last week
- ☆23May 30, 2018Updated 8 years ago
- ☆19May 20, 2026Updated 2 months ago
- Python implementation of algorithms for multi-objective multi-agent path finding.☆13May 17, 2022Updated 4 years ago