google maps for block game
-
Updated
Mar 30, 2026 - Java
#
astar-pathfinding
Here are 469 public repositories matching this topic...
CosmosFramework is a medium-lightweight plug-in Unity development framework . Has a rich Unity method extensions and toolchain. async/await syntax support, multi-network channel support.Long term support for this project
csharp tcp unity game-development astar-algorithm kcp quadtree puremvc assetbundle aoi unityframework astar-pathfinding unity3d-framework tcp-client-server unity-framework unity-package-manager await-async indiegamedev
-
Updated
Jun 7, 2025 - C#
Implementation of the D* lite algorithm in Python for "Improved Fast Replanning for Robot Navigation in Unknown Terrain"
python robotics astar astar-algorithm rrt pygame ros rrt-star gazebo slam obstacle-avoidance dstarlite dstar ros2 astar-pathfinding robotics-programming robot-navigation pathplanning rrtstar dstar-lite
-
Updated
Nov 26, 2023 - Python
Implementation of Near-Optimal Hierarchical Pathfinding (HPA*) algorithm in Unity, tested with maps from Dragon Age: Origins
-
Updated
Dec 26, 2022 - C#
A very simple A* implementation in C++ callable from Python for pathfinding on a two-dimensional grid.
-
Updated
Feb 22, 2026 - Python
Pathfinder and A* solver (astar or a-star) native extension for Defold Engine build on MicroPather.
astar astar-algorithm pathfinding defold-game-engine pathfinder a-star defold astar-pathfinding pather defold-library micropather
-
Updated
Apr 15, 2026 - Python
A collection of useful Scripts, Scenes, Systems, and Templates for the Godot Game Engine.
game utility helper ui vr astar astar-algorithm godotengine godot utility-classes utility-library ui-components utility-based-ai godot-addon astar-pathfinding godot-plugin godot-game-engine utility-scripts
-
Updated
Aug 31, 2020 - GDScript
3D A* Pathfinding that doesn't need baked navmeshes and can be used with dynamically created terrain (MapMagic or other)
-
Updated
Feb 20, 2025 - C#
Visualize working of famous algorithms, Currently Implemented Path Finding (Dijkstra's, A Star, BFS, DFS) Sorting (Bubble, Insertion, Selection, Merge, Quick, Heap)
algorithm algorithms astar-algorithm pathfinding sort bubble-sort dijkstra html-css-javascript dijkstra-algorithm astar-pathfinding graph-visualizer algorithm-visualiser
-
Updated
Dec 28, 2020 - JavaScript
The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
graph-algorithms astar pathfinding polygon-intersection computational-geometry convex-hull voronoi-diagram voronoi delaunay-triangulation convex-hull-algorithms flood-fill point-in-polygon astar-pathfinding planar-subdivision path-coverage line-of-sight dcel-subdivision quadrant-tree
-
Updated
Jul 19, 2021 - Java
Dungeon generation and navigation using constrained random walks and A* in Unity
-
Updated
Feb 21, 2020 - C#
python package for fast shortest path computation on 2D polygon or grid maps
graph-algorithms robotics navigation pathfinding path path-planning polygon pathfinder visibility shortest-paths gridworld pathfinding-algorithm visibility-graph offline-path-planners multipolygon astar-pathfinding shortest-path shortest-pathfinding-algorithm shortest-path-algorithm visibility-graph-algorithm
-
Updated
Jan 14, 2026 - Python
Game and prototypes with SharpDX and Directx 11
c-sharp collada-importer game-engine shaders blender game-development effects game-logic animation-3d collada heightmap deferred-rendering navmesh directx-11 astar-pathfinding forward-rendering sky-scattering foliage hardware-instancing
-
Updated
Mar 6, 2026 - C#
A*-based collision avoidance for UAV path planning
-
Updated
Sep 9, 2019 - Python
Source code for the HappyCoders.eu articles on pathfinding and shortest path algorithms (Dijkstra, A*, Bellman-Ford, Floyd-Warshall).
java algorithms astar astar-algorithm pathfinding dijkstra shortest-paths floyd-warshall dijkstra-algorithm astar-pathfinding algorithms-and-data-structures bellman-ford bellman-ford-algorithm floyd-warshall-algorithm
-
Updated
Apr 15, 2026 - Java
Python programm showing A* path finding on quadtree representation of a 2D map.
-
Updated
Jun 20, 2019 - Python
High performance A* pathfinding in C#
-
Updated
Nov 13, 2020 - C#
这个算法用于无人机群避障一个加入机群的无人机，算法分为两种思路：(1)加入者的路径规划主动机动规避编队机群、(2)编队微调避让加入者。目前只做了第一种思路。唯一已知信息是原机群的运动轨迹F(x，y，z，t)|each plane，对于第一种思路：对于补位飞机唯一的输入参数是无人机编队时间帧和每架飞机的对应位置，即F(x，y，z，t)|each plane，输出参数是规划的单条路径。对于第二种思路：让正常飞行的编队可以保持在其原始轨迹周围(即，边界条件，规避机动范围<Δv球)，补位无人机穿越他们的空隙到达目标位置，输出为需要避碰的其他无人机的机动向量。第一种思路采用三维A*+分段局部规划
-
Updated
Aug 20, 2025 - C
Go implementation of A* from RedBlobGames
-
Updated
Mar 3, 2019 - Go
🗺️ A JavaScript implementation of A* algorithm.
-
Updated
Aug 11, 2021 - JavaScript
Improve this page
Add a description, image, and links to the astar-pathfinding topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the astar-pathfinding topic, visit your repo's landing page and select "manage topics."