Safe Interval Path Planning with Intervals Projection (SIPP-IP) - a SIPP-based planner capable of handling non-instantaneous accelerations/decelerations of an agent (kinodynamic constraints).
☆17Dec 1, 2022Updated 3 years ago
Alternatives and similar repositories for SIPP-IP
Users that are interested in SIPP-IP are comparing it to the libraries listed below
Sorting:
- The repository contains the implementation Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. It plans and navigates more t…☆29Jul 21, 2025Updated 7 months ago
- Traffic management libraries for RMF☆33Jan 13, 2026Updated 2 months ago
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆33Nov 2, 2021Updated 4 years ago
- ☆22Oct 3, 2022Updated 3 years ago
- Precedence constrained multi-agent task assignment and path finding☆15Dec 26, 2023Updated 2 years ago
- This is the repo for the team Pikachu's solution in the League of Robot Competition 2023. Our solution won the Overall Best and Fast Move…☆27Oct 17, 2024Updated last year
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆96Apr 14, 2025Updated 11 months ago
- Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allo…☆124Dec 5, 2021Updated 4 years ago
- Kinodynamic-CBS (K-CBS) is a decentralized motion planning algorithm capable of solving complex multi-agent motion planning queries for a…☆17Dec 28, 2023Updated 2 years ago
- naive implementations of Multi-Agent Path Finding algorithms☆15Sep 4, 2025Updated 6 months ago
- C++ implementation of CBS with using SIPP as a low-level planner☆10Nov 27, 2018Updated 7 years ago
- ☆51Apr 28, 2025Updated 10 months ago
- long-term dynamic window approach local planner for differential wheeled robots☆49May 2, 2023Updated 2 years ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆131Jul 24, 2024Updated last year
- Experimental reservation library in rust.☆13Aug 19, 2025Updated 7 months ago
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆38Aug 22, 2025Updated 6 months 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
- Offline Time-Independent Multi-Agent Path Planning (IJCAI-22, T-RO-23)☆31Apr 14, 2025Updated 11 months ago
- Dynamic obstacle avoidance for mobile robots by combining deep learning motion prediction and MPC trajectory generation.☆26May 29, 2025Updated 9 months ago
- Polygonal simulation environment and implementation of the STAA*, DWA, and a PD controller for nonholonomic agents.☆18Oct 11, 2024Updated last year
- ☆10Apr 23, 2021Updated 4 years ago
- ☆19Mar 12, 2026Updated last week
- CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces (AAMAS-22)☆38Jan 5, 2023Updated 3 years ago
- This repository contains files to set up a simulation environment for a decentralized multi-robot exploration using 2D Stage simulator an…☆14Oct 22, 2019Updated 6 years ago
- ROS wrapper for pedestrian prediction.☆12Feb 25, 2019Updated 7 years ago
- Vector Field-based Collision Avoidance for Moving Obstacles with Time-Varying Shape☆29Dec 2, 2022Updated 3 years ago
- Official implementation of the paper "Guidance Graph Optimization for Lifelong Multi-Agent Path Finding", published in IJCAI 2024.☆19Mar 10, 2026Updated last week
- This repository aims to compare different motion planners for dynamical systems, namely search-based, sampling-based, and optimization-ba…☆46Jul 24, 2023Updated 2 years ago
- Prioritized Multi-Agent Path Finding using Safe Interval Path Planning (SIPP) and modifications☆28Dec 23, 2021Updated 4 years ago
- A distributed TEB planner for multi-robot trajectory planning☆40Oct 10, 2022Updated 3 years ago
- Motion Planning Benchmark☆86Jul 6, 2023Updated 2 years ago
- Autonomous Navigation for Differential Drive Robots☆14May 6, 2022Updated 3 years ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆106May 9, 2024Updated last year
- A full-stack solution for multi-robot pickup and delivery (MAPD) problem under uncertainty. The solution runs in a 3D simulation environm…☆16Jun 8, 2021Updated 4 years ago
- [AAAI-2025] This repository contains MAPF-GPT, a deep learning-based model for solving MAPF problems. Trained with imitation learning on …☆120Mar 5, 2026Updated 2 weeks ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆128Jul 24, 2024Updated last year
- An efficient path smoothing algorithm that has analytic solution. This algorithm provides curvature continuous path using cubic Bezier cu…☆22Apr 27, 2018Updated 7 years ago
- Visualizing the structure of planning problems using local-minima trees☆33Feb 4, 2022Updated 4 years ago
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆17Feb 5, 2024Updated 2 years ago