nathansttt / hog2
Pathfinding and search testbed/visualization suite. Current code is in PDB-refactor branch.
☆113Updated last month
Alternatives and similar repositories for hog2:
Users that are interested in hog2 are comparing it to the libraries listed below
- The Hybrid Reciprocal Velocity Obstacle (C++)☆135Updated 8 months ago
- Implementation of ORCA algorithm☆133Updated 9 months ago
- Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allo…☆111Updated 3 years ago
- Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Ti…☆228Updated 9 months ago
- Based on David Silver's paper "Cooperative Pathfinding"☆47Updated 7 years ago
- Conflict-based search for multi-agent path finding (MAPF)☆70Updated 2 years ago
- Reciprocal Collision Avoidance with Acceleration-Velocity Obstacles (C++)☆61Updated 8 months ago
- Basic algorithms for single-shot grid-based 2D path finding: BFS, Dijkstra, A*, Jump Point Search (JPS), Theta*☆70Updated 3 years ago
- Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.☆28Updated 3 years ago
- Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search☆69Updated 3 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (IJCAI-19)☆33Updated 3 years ago
- A* Search Algorithm with an Additional Time Dimension to Deal with Dynamic Obstacles☆181Updated 3 years ago
- A bounded-suboptimal solver for Multi-Agent Path Finding☆103Updated 5 months ago
- An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning☆109Updated 5 months ago
- A lightweight library of Behavior Trees Library in C++.☆187Updated 6 years ago
- Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)☆64Updated 4 months ago
- An efficient solver for lifelong Multi-Agent Path Finding☆150Updated last month
- An offline visualization tool for analysing solutions to multi-robot coordination problems.☆32Updated last month
- A basic implementation of the D* lite algorithm☆116Updated 9 years ago
- LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding (AAAI-23)☆46Updated 10 months ago
- A Comparion of Increasing Cost Tree Search (ICTS) and Enhanced Partial Expansion A*☆19Updated last year
- Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)☆122Updated 2 years ago
- 📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)☆72Updated last week
- Disjoint CBSH and IDCBS integrated with LPA* and other incremental techniques☆11Updated 3 years ago
- 🤖 ASPRILO, an intra-logistics benchmark suite for answer set programming☆56Updated 2 years ago
- Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding (IJCAI-23)☆27Updated 6 months ago
- Anytime Multi-Agent Path Finding via Large-Neighborhood Search☆57Updated 8 months ago
- A C++ implementation of Jump Point Search on both 2D and 3D maps☆395Updated 3 years ago
- ☆27Updated 4 months ago
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search☆67Updated 8 months ago