Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allowed to follow any-angle path on the grid). Timeline is continuous, i.e. action durations are not explicitly discretized into timesteps. Different agents' size and moving speed are supported. Planning is carried…
☆124Dec 5, 2021Updated 4 years ago
Alternatives and similar repositories for AA-SIPP-m
Users that are interested in AA-SIPP-m are comparing it to the libraries listed below
Sorting:
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆33Nov 2, 2021Updated 4 years ago
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆259May 30, 2025Updated 9 months ago
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆73May 9, 2024Updated last year
- C++ implementation of CBS with using SIPP as a low-level planner☆10Nov 27, 2018Updated 7 years ago
- Time-Independent Planning for Multiple Moving Agents (AAAI-21)☆15Mar 16, 2023Updated 3 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆98Apr 14, 2025Updated 11 months ago
- An efficient solver for lifelong Multi-Agent Path Finding☆195Dec 17, 2024Updated last year
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)☆42Nov 23, 2021Updated 4 years ago
- Safe Interval Path Planning with Intervals Projection (SIPP-IP) - a SIPP-based planner capable of handling non-instantaneous acceleration…☆17Dec 1, 2022Updated 3 years ago
- naive implementations of Multi-Agent Path Finding algorithms☆15Sep 4, 2025Updated 6 months ago
- Library with search algorithms for task and path planning for multi robot/agent systems☆991Aug 10, 2023Updated 2 years ago
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆52Jul 30, 2022Updated 3 years ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆128Jul 24, 2024Updated last year
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆72Aug 22, 2025Updated 7 months ago
- Time-Optimal Any-Angle Safe Interval Path Planning☆10Mar 13, 2021Updated 5 years ago
- Prioritized Multi-Agent Path Finding using Safe Interval Path Planning (SIPP) and modifications☆28Dec 23, 2021Updated 4 years ago
- ☆51Apr 28, 2025Updated 10 months ago
- An Efficient Multi-Agent Path Finding Solver for Car-Like Robots☆405Jul 31, 2023Updated 2 years ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆131Jul 24, 2024Updated last year
- Code for bachelor thesis about Multi-Agent Path Finding☆17Apr 29, 2018Updated 7 years ago
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆76Mar 15, 2021Updated 5 years ago
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆143Apr 14, 2025Updated 11 months ago
- Solve Multi-agent Path Finding problem for heterogeneous robots.☆31Feb 24, 2021Updated 5 years ago
- Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*☆433Aug 30, 2024Updated last year
- Multi-agent path finding (MAPF), Token Swapping (TSWAP) and related solvers. Among others SMT-based solvers, variants of CBS, and SAT-bas…☆19Feb 6, 2026Updated last month
- BCP-MAPF – branch-and-cut-and-price for multi-agent path finding☆98Jul 28, 2025Updated 7 months ago
- Benchmarking Large Neighborhood Search for Multi-Agent Path Finding☆21Aug 18, 2025Updated 7 months ago
- An implementation of the Conflict-Based Search, written in Python 3. This project, however, will support weighted edges and uncertainty r…☆11Jun 13, 2020Updated 5 years ago
- 3 algorithms for classical MAPF on 4 connected grid in one project☆36Jun 30, 2022Updated 3 years ago
- 📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)☆77Mar 16, 2026Updated last week
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆106May 9, 2024Updated last year
- Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.☆28Feb 2, 2026Updated last month
- simple multi-agent pathfinding (MAPF) visualizer for research usage☆90Nov 16, 2024Updated last year
- ☆38Jul 10, 2022Updated 3 years ago
- Conflict-based search for optimal multi-agent pathfinding☆27Nov 8, 2025Updated 4 months ago
- This is a multi-agent path planning(also known as Multi-Agent Path Finding, MAPF) algorithm package for ROS/ROS2.☆242May 12, 2025Updated 10 months ago
- ☆22Oct 3, 2022Updated 3 years ago
- Python implementation of a bunch of multi-robot path-planning algorithms.☆1,432Apr 5, 2023Updated 2 years ago
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆110Jun 21, 2025Updated 9 months ago