π GitHub Detail
MuneebBaderoen/AdaptiveFieldDStar
By MuneebBaderoen
Honours Project. Pathfinding with adaptive mesh refinement. The implementation of the Field D* algorithm in 2D and 2.5D triangle meshes with adaptive refinements. Weβre aiming to perform local mesh refinements to produce a fine triangle mesh in areas traversed by a calculated path and iteratively improve the approximation of the path found using...
Honours Project. Pathfinding with adaptive mesh refinement. The implementation of the Field D* algorithm in 2D and 2.5D triangle meshes with adaptive refinements. Weβre aiming to perform local mesh refinements to produce a fine triangle mesh in areas traversed by a calculated path and iteratively improve the approximation of the path found using this dynamic scheme. We will be investigating the heuristics used by current pathfinding algorithms to direct node expansions in Field D*. Implemented in C++.
Live Snapshot
β
Stars
12
π΄
Forks
6
π
License
Unknown
π§©
Type
C
About this open-source project
Live information fetched from GitHub.
Honours Project. Pathfinding with adaptive mesh refinement. The implementation of the Field D* algorithm in 2D and 2.5D triangle meshes with adaptive refinements. Weβre aiming to perform local mesh refinements to produce a fine triangle mesh in areas traversed by a calculated path and iteratively improve the approximation of the path found using...
Honours Project. Pathfinding with adaptive mesh refinement. The implementation of the Field D* algorithm in 2D and 2.5D triangle meshes with adaptive refinements. Weβre aiming to perform local mesh refinements to produce a fine triangle mesh in areas traversed by a calculated path and iteratively improve the approximation of the path found using this dynamic scheme. We will be investigating the heuristics used by current pathfinding algorithms to direct node expansions in Field D*. Implemented in C++.
Default Branch
master
Open Issues
0
Watchers
12