Kinodynamic-CBS (K-CBS) is a decentralized motion planning algorithm capable of solving complex multi-agent motion planning queries for agent with complex, possibly unique, kinodynamic constraints.
☆18Dec 28, 2023Updated 2 years ago
Alternatives and similar repositories for Chance-Constrained-K-CBS
Users that are interested in Chance-Constrained-K-CBS are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)☆18Feb 5, 2024Updated 2 years ago
- Distributed Multi-robot trajectory Optimization Algorithm☆22Mar 31, 2022Updated 4 years ago
- Demonstrations of our Kinodynamic Conflict-Based Search algorithm that are too involved to be included in OMPL.☆11Feb 7, 2024Updated 2 years ago
- Multi-Robot RL Benchmark and Learning Environment for the Robotarium | IEEE MRS 2023 (Best Paper Award)☆14Mar 31, 2025Updated last year
- [ICRA'25] Decentralized Safe and Scalable Multi-Agent Control Under Limited Actuation☆20Jan 28, 2025Updated last year
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- naive implementations of Multi-Agent Path Finding algorithms☆15Sep 4, 2025Updated last year
- ROS wrapper for CL-CBS☆21Feb 3, 2023Updated 3 years ago
- A distributed TEB planner for multi-robot trajectory planning☆39Oct 10, 2022Updated 3 years ago
- Experimental implementation☆10Sep 17, 2022Updated 3 years ago
- ☆40Jul 10, 2022Updated 4 years ago
- Benchmark for Multi Robot Planning☆20Feb 22, 2023Updated 3 years ago
- The MAPFpython library is designed for rapid research into multi-agent pathfinding domains.☆12May 18, 2017Updated 9 years ago
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆79Mar 15, 2021Updated 5 years ago
- Solve Multi-agent Path Finding problem for heterogeneous robots.☆30Feb 24, 2021Updated 5 years ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆271May 30, 2025Updated last year
- Python implementation of Space-time A*, Prioritized Planning, & Conflict-based Search for Multi-agent Path Finding (MAPF)☆34Nov 30, 2020Updated 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 2 months 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
- This project offers to solve Multi-Agent-Path-Finding(MAPF) problem optimally using Conflict-Based Search(CBS).☆14Aug 31, 2022Updated 4 years ago
- C++ Implementation of Multi-Objective Safe-Interval Path Planning☆12Aug 20, 2022Updated 4 years ago
- Gradient-Based Trajectory Optimizer 中文注释，论文：Gradient-Based Online Safe Trajectory Generation for Quadrotor Flight in Complex Environments…☆10Jul 30, 2022Updated 4 years ago
- Multi-Vehicle Motion Planning with Posture Constraints in Real World (Implementation of RVO, ORCA(RVO2), and our PCA with python).☆16May 6, 2022Updated 4 years ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆82Aug 22, 2025Updated last year
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Local control techiniques for collision avoidance scenarios on multi-agent system☆21Mar 12, 2020Updated 6 years ago
- ☆18May 9, 2025Updated last year
- ☆10Apr 23, 2021Updated 5 years ago
- Multi-Vehicle Movement Sequence Planning algorithm on topological map.☆11Jul 13, 2018Updated 8 years ago
- ☆11Jan 8, 2025Updated last year
- Multi-agent pathfinding via Conflict Based Search☆122Apr 22, 2024Updated 2 years ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆135Jul 24, 2024Updated 2 years ago
- A solution of Multi-Agent Path Finding problem☆71Apr 16, 2024Updated 2 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
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Quick Multi-Robot Motion Planning by Combining Sampling and Search (IJCAI-23)☆26Apr 14, 2025Updated last year
- An Efficient Multi-Agent Path Finding Solver for Car-Like Robots☆415Jul 31, 2023Updated 3 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…☆29Oct 17, 2024Updated last year
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆117May 9, 2024Updated 2 years ago
- This is a multi-agent path planning(also known as Multi-Agent Path Finding, MAPF) algorithm package for ROS/ROS2.☆251May 12, 2025Updated last year
- Sccheduling Environment for Multi-Robot Coordination Problems☆19May 9, 2022Updated 4 years ago
- ☆22May 9, 2025Updated last year