Displaying 1 to 20 from 29 results

easystarjs - An asynchronous A* pathfinding API written in Javascript.

  •    Javascript

easystar.js is an asynchronous A* pathfinding API written in Javascript for use in your HTML5 games and interactive projects. The goal of this project is to make it easy and fast to implement performance conscious pathfinding.First create EasyStar.

PathFinding.js - A comprehensive path-finding library for grid based games

  •    Javascript

The aim of this project is to provide a path-finding library that can be easily incorporated into web games. It may run on Node.js or the browser. Note that this project only provides path-finding algorithms for 2D space. If you need to work in a 3D environment, then you may use @schteppe's fork.

ngraph.path - Path finding in a graph

  •    Javascript

Fast path finding for arbitrary graphs. Play with a demo or watch it on YouTube. If you want to learn how the demo was made, please refer to the demo's source code. I tried to describe it in great details.

gdx-ai - Artificial Intelligence framework for games based on libGDX or not

  •    Java

An artificial intelligence framework, entirely written in Java, for game development with libGDX.The gdxAI project is a libGDX extension living under the libGDX umbrella. However it does not force you to use that specific framework if you do not wish to do so. The libGDX jar remains an essential requirement, mostly due to the use of libGDX collections which are optimized for mobile platforms by limiting garbage creation and supporting primitive types directly, so avoiding boxing and unboxing.

High-Speed-Priority-Queue-for-C-Sharp - A C# priority queue optimized for pathfinding applications

  •    CSharp

Yes! See the license page for more details. This project contains two priority queue implementations - one that's super-fast (without thread-safety, safety checks, etc), and one that's easy/safe to use.

DEngine - C# XNA 2D Game Engine


A 2D game engine written in C# and XNA. Features animated sprite capability and physics simulation by FarseerPhysics. Includes a level editor, a GUI controls library and a sample RTS game, Factions. Contains A* pathfinding for unit movement and an ants system for AI navigation.


  •    DotNet

MeshSharp is a Navigational Mesh pathfinding library for .net written in C#. Uses A* and string pulling. Can be used in robotics, simulation and games.

cupoch - Robotics with GPU computing

  •    C++

Cupoch is a library that implements rapid 3D data processing for robotics using CUDA. The goal of this library is to implement fast 3D data computation in robot systems. For example, it has applications in SLAM, collision avoidance, path planning and tracking. This repository is based on Open3D.

go-detour - Navigation mesh pathfinding and spatial reasoning library

  •    Go

Recast is state of the art navigation mesh construction toolset for games.The Recast process starts with constructing a voxel mold from a level geometry and then casting a navigation mesh over it. The process consists of three steps, building the voxel mold, partitioning the mold into simple regions, peeling off the regions as simple polygons.

recast.js - A wrapper for the RecastDetour navigation library for node and the browser

  •    Javascript

A Javascript library to handle navigation meshes, in nodejs and the browser. It is designed to work along a WebGL software but it's completely library agnostic. It only manages a mesh and its properties.

jKstra - JavaScript graph routing library

  •    Javascript

jKstra is a JavaScript library to work with graphs - as in "data structures", with edges and vertices, not as in "graphics". See an interactive demo.

node-path-finding - a simple server-side path finding module for NodeJS

  •    CoffeeScript

a Node.JS implementation for AStar path finding algorithm. This implementation uses primitive data types (Number and Byte/Buffer) to present location and block data that significantly improve the speed and have a good control on memory consumption

three-pathfinding - Navigation mesh utilities for three.js, based on PatrolJS.

  •    Javascript

Navigation mesh toolkit for ThreeJS, based on PatrolJS. Computes paths between points on a 3D nav mesh, supports multiple zones, and clamps movement vectors for FPS controls. To learn how to create a navigation mesh using Blender, see Creating a Nav Mesh. Thanks to Nick Janssen for creating PatrolJS, which was the basis for this library.

cefet-games-pathfinding - Ajude Gon a chegar do outro lado, seco.

  •    Java

Ao abrir o código na IDE, você pode compilar e executar o código e deve aparecer o mapa, com o agente no canto esquerdo, assim como mostra a figura lá em cima.

constellation.js - A grid geometry toolkit for A* pathfinding and 2D sprite motion.

  •    Javascript

A grid geometry toolkit for controlling 2D sprite motion. While Constellation is not an animation library itself, it's designed to work hand-in-hand with animation tools such as jQuery, TweenLite, or TweenJS (to name a few). Use Constellation to manage and search across grid geometry, then feed its points into your preferred animation library.

pathfinding-visualiser - Visualises pathfinding algorithms

  •    Javascript

Visualises pathfinding algorithms allowing customisation of algorithm, map generation and animation. The UI is build on Polymer's paper elements. polyserve is used to serve the demo so bower dependencies are referenced correctly to enable pathfinding-visualiser to be reuseable.

PatrolJS - Navigation mesh toolkit for ThreeJS

  •    Javascript

PatrolJS helps your AI agents navigate around your world. It uses the A* and Funnel algorithms to calculate a path on a navigation mesh. Traditionally games and 3D apps used waypoints to help their AI agents navigate. This is bad and has a lot of problems, but is generally easier to implement than navigation meshes. Navmeshes are far more accurate, faster and take into account the size of the AI agent (e.g. tanks require move space to maneuver than soldiers).

dijkstra - Fastest golang Dijkstra path finder

  •    Go

Golangs fastest Dijkstra's shortest (and longest) path calculator, requires go 1.6 or above (for benchmarking). go test -bench .

linq-to-astar - LINQ as query expression against heuristic algorithms

  •    CSharp

LINQ to A* is an experimental library aimed to incorporate LINQ expressions into A* as well as other heuristic search algorithms. With the library, LINQ can now be used as query expression to state conditions and fetch path found by the algorithm. The library defines a set of generic APIs that can be applied to any problem as long as the problem can be solved with the algorithm. By taking advantage of the power of LINQ, the library is not only about re-implementing in C#, but also giving new ability and flexibility to the algorithms.

We have large collection of open source products. Follow the tags from Tag Cloud >>

Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.