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…
☆128Dec 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆34Nov 2, 2021Updated 5 years ago
- 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
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆75May 9, 2024Updated 2 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 (IJCAI-19)☆43Nov 23, 2021Updated 4 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- An efficient solver for lifelong Multi-Agent Path Finding☆222Dec 17, 2024Updated last year
- naive implementations of Multi-Agent Path Finding algorithms☆15Sep 4, 2025Updated last year
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆121Apr 14, 2025Updated last year
- C++ implementation of CBS with using SIPP as a low-level planner☆11Nov 27, 2018Updated 7 years ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆139Jul 24, 2024Updated 2 years ago
- Solve Multi-agent Path Finding problem for heterogeneous robots.☆30Feb 24, 2021Updated 5 years ago
- Library with search algorithms for task and path planning for multi robot/agent systems☆1,050Aug 10, 2023Updated 3 years ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆84Aug 22, 2025Updated last year
- Codes for paper Integrated Task Assignment and Path Planning forCapacitated Multi-Agent Pickup and Delivery☆52Jul 30, 2022Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆145Apr 14, 2025Updated last year
- A bounded-suboptimal solver for Multi-Agent Path Finding☆140Jul 24, 2024Updated 2 years ago
- An Efficient Multi-Agent Path Finding Solver for Car-Like Robots☆420Jul 31, 2023Updated 3 years ago
- Safe Interval Path Planning with Intervals Projection (SIPP-IP) - a SIPP-based planner capable of handling non-instantaneous acceleration…☆20Dec 1, 2022Updated 3 years ago
- Anonymous Multi-Agent Path Finding (MAPF) with Conflict-Based Search and Space-Time A*☆446Aug 30, 2024Updated 2 years ago
- BCP-MAPF – branch-and-cut-and-price for multi-agent path finding☆99Jul 28, 2025Updated last year
- Decomposing instance into subproblem with priority☆13Jul 18, 2026Updated 3 months ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆122May 9, 2024Updated 2 years ago
- ☆58Apr 28, 2025Updated last year
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- An experimental package for solving various versions of multi-agent path finding problem (MAPF). Most of solvers in the package are base…☆10Aug 5, 2022Updated 4 years ago
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆80Mar 15, 2021Updated 5 years ago
- Time-Optimal Any-Angle Safe Interval Path Planning☆11Mar 13, 2021Updated 5 years 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 6 years ago
- Code for bachelor thesis about Multi-Agent Path Finding☆17Apr 29, 2018Updated 8 years ago
- Prioritized Multi-Agent Path Finding using Safe Interval Path Planning (SIPP) and modifications☆29Dec 23, 2021Updated 4 years ago
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆18Feb 5, 2024Updated 2 years ago
- Kinodynamic-CBS (K-CBS) is a decentralized motion planning algorithm capable of solving complex multi-agent motion planning queries for a…☆18Dec 28, 2023Updated 2 years ago
- Implementation of the SADG RHC feedback control scheme to reduce route completion times of delayed agents following MAPF plans.☆29Feb 2, 2026Updated 9 months ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Implement a single- angle solver, namely space-time A*, and parts of three MAPF solvers, namely prioritized planning, Conflict-Based Sear…☆26Apr 14, 2020Updated 6 years ago
- Goal of project is to write programs that will allow multiple agents to find optimal paths from their start location to their goal locat…☆35Sep 2, 2021Updated 5 years ago
- Multi-agent path finding (MAPF), Token Swapping (TSWAP) and related solvers. Among others SMT-based solvers, variants of CBS, and SAT-bas…☆19Jun 10, 2026Updated 4 months ago
- Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)☆31Apr 14, 2025Updated last year
- Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)☆138Oct 11, 2026Updated 3 weeks ago
- ☆18May 29, 2025Updated last year
- A Python library for multi-agent planning and pathfinding: CBS, PIBT, LaCAM, LNS, space-time A*, plus decentralized NMPC, velocity obstac…☆87Oct 22, 2026Updated last week