Skip to content
@PathPlanning

PathPlanning

It's all about path planning/finding (2D, 3D, grid-based, any-angle, multi-agent and many more)

Popular repositories Loading

  1. Continuous-CBS Continuous-CBS Public

    Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Timeline is not discretized, i.e. is continuous.

    C++ 271 60

  2. ORCA-algorithm ORCA-algorithm Public

    Implementation of ORCA algorithm

    C++ 180 30

  3. AA-SIPP-m AA-SIPP-m Public

    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 conti…

    C++ 127 38

  4. 3D-AStar-ThetaStar 3D-AStar-ThetaStar Public

    Basic algorithms for height map based 3D path planning: BFS, Dijkstra, A*, Theta*

    C++ 99 21

  5. AStar-JPS-ThetaStar AStar-JPS-ThetaStar Public

    Basic algorithms for single-shot grid-based 2D path finding: BFS, Dijkstra, A*, Jump Point Search (JPS), Theta*

    C++ 71 32

  6. Push-and-Rotate--CBS--PrioritizedPlanning Push-and-Rotate--CBS--PrioritizedPlanning Public

    3 algorithms for classical MAPF on 4 connected grid in one project

    C++ 37 14

Repositories

Showing 10 of 36 repositories
  • PathPlanning/2026-Project-Seminar-Mobile-Wheeled-Robots's past year of commit activity
    TeX 2 0 0 0 Updated Sep 11, 2026
  • PathPlanning/CubicPrimitivesGenerator's past year of commit activity
    Jupyter Notebook 2 MIT 0 0 0 Updated Sep 1, 2026
  • LatticeSIPP Public

    Safe Interval Path Planning (SIPP) on State Lattices for grid-based dynamic environments. Presented at ICR 2026.

    PathPlanning/LatticeSIPP's past year of commit activity
    Python 3 MIT 0 0 0 Updated Aug 19, 2026
  • MeshAStar Public

    Efficient Lattice-Based Planning With MeshA* algorithm (AAAI 2026).

    PathPlanning/MeshAStar's past year of commit activity
    Python 12 MIT 0 0 0 Updated Jul 7, 2026
  • ManipulationPlanning-SI-RRT Public

    Combination of Rapidly-Exporing Random Trees (RRT) and Safe Interval Path Planning (SIPP) for high-DOF planning in dynamic environments, i.e. planning a path for a manipulator when moving obstacles are present (and their trajectories are know/accurately predicted)

    PathPlanning/ManipulationPlanning-SI-RRT's past year of commit activity
    Jupyter Notebook 20 MIT 3 0 0 Updated May 17, 2026
  • RPMPLv2 Public Forked from robotics-ETF/RPMPLv2

    Rapid Prototyping Motion Planning Library v2 (C++). Our fork adapts code to our implementation of collision detector for comparison with SI-RRT.

    PathPlanning/RPMPLv2's past year of commit activity
    C++ 0 2 0 0 Updated Mar 12, 2026
  • ompl Public Forked from ompl/ompl

    The Open Motion Planning Library (OMPL). Fork for adapting profiler for SI-RRT comparison and additional fixes.

    PathPlanning/ompl's past year of commit activity
    C++ 0 717 0 0 Updated Mar 11, 2026
  • PathPlanning/Decentralized-Unlabeled-Navigation's past year of commit activity
    2 0 0 0 Updated Dec 15, 2025
  • PathPlanning/MPPI-Collision-Avoidance's past year of commit activity
    Jupyter Notebook 36 7 1 0 Updated Jul 29, 2025
  • Continuous-CBS Public

    Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Timeline is not discretized, i.e. is continuous.

    PathPlanning/Continuous-CBS's past year of commit activity
    C++ 271 MIT 60 4 0 Updated May 30, 2025

Top languages

Loading…

Most used topics

Loading…