Alternatives and similar repositories for hog2

Users that are interested in hog2 are comparing it to the libraries listed below

• snape / HRVO
  The Hybrid Reciprocal Velocity Obstacle (C++)
  ☆147Updated last week
• PathPlanning / ORCA-algorithm
  Implementation of ORCA algorithm
  ☆166Updated last year
• PathPlanning / AA-SIPP-m
  Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allo…
  ☆121Updated 4 years ago
• Kei18 / lacam
  LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)
  ☆70Updated 5 months ago
• PathPlanning / Continuous-CBS
  Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…
  ☆256Updated 8 months ago
• Ohohcakester / Any-Angle-Pathfinding
  A collection of algorithms used for any-angle pathfinding with visualisations.
  ☆164Updated 3 years ago
• snape / AVO2
  Reciprocal Collision Avoidance with Acceleration-Velocity Obstacles (C++)
  ☆72Updated last week
• PathPlanning / SuboptimalSIPP
  Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.
  ☆33Updated 4 years ago
• eli-b / mapf
  A MAPF framework in C#, with implementations for MA-CBS, ICBS, CBSH, ID, A*, A*+OD, and EPEA*
  ☆52Updated 9 months ago
• GavinPHR / Space-Time-AStar
  A* Search Algorithm with an Additional Time Dimension to Deal with Dynamic Obstacles
  ☆203Updated 4 years ago
• yge58 / collaborative_a_star_pathfinding
  Based on David Silver's paper "Cooperative Pathfinding"
  ☆49Updated 8 years ago
• AndrewWalker / Dubins-Curves
  Path generation for the Dubin's car
  ☆318Updated 3 years ago
• PathPlanning / AStar-JPS-ThetaStar
  Basic algorithms for single-shot grid-based 2D path finding: BFS, Dijkstra, A*, Jump Point Search (JPS), Theta*
  ☆73Updated 4 years ago
• igrek51 / coop-pathfinder
  Cooperative path-finding algorithm simulator for solving bottle-necks in multi-agent systems
  ☆30Updated 7 years ago
• rishabh1b / RealTimePathPlanning
  Sampling based rewiring approaches to solve motion planning problems for a robot with dynamic obstacles
  ☆334Updated 8 years ago
• enginbaglayici / ConflictBasedSearch
  Conflict-based search for multi-agent path finding (MAPF)
  ☆89Updated 3 years ago
• Jiaoyang-Li / EECBS
  A bounded-suboptimal solver for Multi-Agent Path Finding
  ☆128Updated last year
• Kei18 / lacam3
  Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding (AAMAS-24)
  ☆105Updated 7 months ago
• Kei18 / pibt2
  Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)
  ☆94Updated 9 months ago
• Jiaoyang-Li / RHCR
  An efficient solver for lifelong Multi-Agent Path Finding
  ☆193Updated last year
• Kei18 / lacam2
  Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)
  ☆37Updated 5 months ago
• MAPF-Competition / PlanViz
  An offline visualization tool for analysing solutions to multi-robot coordination problems.
  ☆43Updated this week
• Kei18 / mapf-IR
  Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)
  ☆142Updated 9 months ago
• jcontrerasleyton / MAPF
  Multi-Agent Path Finding in C++ (WHCA*, iWHCA*, WCBS)
  ☆56Updated 5 years ago
• Kei18 / pibt
  Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)
  ☆42Updated 4 years ago
• ct2034 / cobra
  ☆30Updated last year
• yangda75 / naiveMAPF
  naive implementations of Multi-Agent Path Finding algorithms
  ☆15Updated 5 months ago
• Jiaoyang-Li / CBSH2
  Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search
  ☆75Updated 4 years ago
• Jiaoyang-Li / CBSH2-RTC
  An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning
  ☆126Updated last year
• eli-b / idcbs
  Disjoint CBSH and IDCBS integrated with LPA* and other incremental techniques
  ☆11Updated 4 years ago