GitHub topics: any-angle
Tjstretchalot/AnyAnglePathfinding
This repository is a modular implementation of any-angle pathfinding in C#.
Language: C# - Size: 413 KB - Last synced at: 4 days ago - Pushed at: almost 4 years ago - Stars: 28 - Forks: 3
vleue/vleue_navigator
Pathfinding on NavMeshes for Bevy
Language: Rust - Size: 2.49 MB - Last synced at: 12 days ago - Pushed at: 17 days ago - Stars: 309 - Forks: 24
vleue/polyanya
Pathfinding using Polyanya
Language: Rust - Size: 2 MB - Last synced at: 13 days ago - Pushed at: 18 days ago - Stars: 369 - Forks: 25
IbrahimSquared/visibility-heuristic-path-planner
Highly efficient holistic 2D visibility solution for grid-based environments/maps (C++ and MATLAB). Extends to a planner.
Language: MATLAB - Size: 7.53 MB - Last synced at: 5 months ago - Pushed at: 5 months ago - Stars: 18 - Forks: 3
IbrahimSquared/visibility-based-marching
VBM is an efficient exact wave propagation technique that has an O(n) compute and space complexity. Inherently produces globally optimal paths to all grid points. Solves several shortcomings of state-of-the-art FMM.
Language: C++ - Size: 21.8 MB - Last synced at: 11 months ago - Pushed at: 11 months ago - Stars: 3 - Forks: 0
LaiYanKai/2D
2D any-angle path planners, and R2: novel vector-based any-angle path planner.
Language: C++ - Size: 28.7 MB - Last synced at: 12 months ago - Pushed at: 12 months ago - Stars: 2 - Forks: 0
PathPlanning/AA-SIPP-m
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 continuous, i.e. action durations are not explicitly discretized into timesteps. Different agents' size and moving speed are supported. Planning is carried out in (x, y, \theta) configuration space, i.e. agents' orientation are taken into account.
Language: C++ - Size: 74.8 MB - Last synced at: about 1 year ago - Pushed at: over 3 years ago - Stars: 89 - Forks: 37
