All Projects → digitsensitive → astar-typescript

digitsensitive / astar-typescript

Licence: MIT License
A* search algorithm in TypeScript

Programming Languages

typescript
32286 projects
javascript
184084 projects - #8 most used programming language

Projects that are alternatives of or similar to astar-typescript

Baritone
google maps for block game
Stars: ✭ 3,868 (+10354.05%)
Mutual labels:  astar, pathfinding
pathfinding-visualizer
Website built using React Framework for visualizing Pathfinding and Maze Generation Algorithms.
Stars: ✭ 33 (-10.81%)
Mutual labels:  astar, pathfinding
Graphhopper
Open source routing engine for OpenStreetMap. Use it as Java library or standalone web server.
Stars: ✭ 3,457 (+9243.24%)
Mutual labels:  astar, pathfinding
uastar
Minimal A* implementation in C. No dynamic memory allocation.
Stars: ✭ 76 (+105.41%)
Mutual labels:  pathfinding, a-star
Pathfinding
A pmmp virion (library) for pathfinding using A*
Stars: ✭ 36 (-2.7%)
Mutual labels:  astar, pathfinding
unity-pathfinding
Find paths in Unity Tilemaps with A* Search
Stars: ✭ 70 (+89.19%)
Mutual labels:  astar, pathfinding
php-a-star
A* (A Star) search algorithm for PHP
Stars: ✭ 61 (+64.86%)
Mutual labels:  pathfinding, a-star
Easystarjs
An asynchronous A* pathfinding API written in Javascript.
Stars: ✭ 1,743 (+4610.81%)
Mutual labels:  astar, pathfinding
astar-gridmap-2d
A* algorithms for 2D gridmaps. The fastest one, until you prove me wrong
Stars: ✭ 43 (+16.22%)
Mutual labels:  astar, pathfinding
a star on grids
Best practices for implementing A* with a focus on four- and eight-connected grid worlds.
Stars: ✭ 23 (-37.84%)
Mutual labels:  pathfinding, a-star
Artificial-Intelligence-State-Space-Search
Different Searching algorithms (DFS, BFS, IDS, Greedy, A*) opting to find optimal path from source to destination
Stars: ✭ 24 (-35.14%)
Mutual labels:  astar, search-algorithm
path demo
An experimental set of pathfinding algorithms for video games
Stars: ✭ 16 (-56.76%)
Mutual labels:  astar, pathfinding
tektosyne
The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
Stars: ✭ 52 (+40.54%)
Mutual labels:  astar, pathfinding
NavMeshDemo
Unity client navmesh export to server for pathfinding
Stars: ✭ 31 (-16.22%)
Mutual labels:  astar, pathfinding
pynpuzzle
Solve, test and benchmark algorithms for N-Puzzle problem with Python
Stars: ✭ 26 (-29.73%)
Mutual labels:  search-algorithm
yupi
🎲 open source gaming emulator for flash based games
Stars: ✭ 28 (-24.32%)
Mutual labels:  a-star
Maze solver
An interactive online maze generator and solver able to use several different algorithms.
Stars: ✭ 40 (+8.11%)
Mutual labels:  pathfinding
NavMeshAvoidance
Custom Nav Mesh Avoidance to replace default one in Unity.
Stars: ✭ 32 (-13.51%)
Mutual labels:  pathfinding
Project-1-Search-in-Pacman
Search algorithms(BFS, DFS, UCS, A*) in python.Berkeley Pacman Project 1.
Stars: ✭ 20 (-45.95%)
Mutual labels:  search-algorithm
Hybrid-A-Star-U-Turn-Solution
Autonomous driving trajectory planning solution for U-Turn scenario
Stars: ✭ 75 (+102.7%)
Mutual labels:  a-star

AStar-Typescript

GitHub Stars GitHub Stars GitHub Forks GitHub Issues Current Version

The A* search algorithm library in TypeScript

AStar-TypeScript is an A* pathfinding API written in TypeScript to use for your HTML5 games or other browser-based projects.

This library was influenced and inspired by @qioa - PathFinding.js, @bgrins - javascript-astar, @prettymuchbryce - easystarjs and @redblobgames.

Buy me a coffee

Whether you use this project, have learned something from it, or just like it, please consider supporting it by buying me a coffee.

Live example

Select a folder, navigate to it, and clone this repository with this command-line:

git clone https://github.com/digitsensitive/astar-typescript.git

Install the dependencies:

yarn install

Run the live example:

yarn run-example

Installation

yarn add astar-typescript
npm install astar-typescript --save
bower install astar-typescript --save

Import

TypeScript

import { AStarFinder } from "astar-typescript";

Javascript

let AStarFinder = require("astar-typescript");

AMD

define(function(require,exports,module){
  let AStarFinder = require('astar-typescript');
});

Basic Usage

Create an astar instance:

private aStarInstance: AStarFinder;

Load grid data:

Using an array (hardcoded or from a Tilemap-Editor)

0 = walkable 1 = not walkable

let myMatrix = [
  [0, 0, 0, 0, 0, 0, 0, 0],
  [0, 0, 0, 0, 0, 0, 0, 1],
  [0, 0, 1, 1, 0, 1, 1, 0],
  [0, 0, 1, 0, 0, 0, 1, 0],
  [0, 0, 0, 0, 0, 0, 1, 0],
  [1, 1, 1, 0, 1, 0, 1, 0],
  [0, 0, 0, 0, 1, 0, 1, 0],
  [0, 0, 1, 0, 0, 0, 0, 0]
];

this.aStarInstance = new AStarFinder({
  grid: {
    matrix: myMatrix
  }
});

or randomly generated array from width and height

this.aStarInstance = new AStarFinder({
  grid: {
    width: 8,
    height: 8
  }
});

Get the path:

let startPos = { x: 0, y: 0 };
let goalPos = { x: 4, y: 5 };

let myPathway = this.aStarInstance.findPath(startPos, goalPos);

Advanced Usage

Additional parameters may be passed to adapt your finder.

If you want to disable diagonal movements:

this.aStarInstance = new AStarFinder({
  grid: {
    width: 8,
    height: 8
  },
  diagonalAllowed: false
});

Set the heuristic function (Manhattan, Euclidean, Chebyshev or Octile):

this.aStarInstance = new AStarFinder({
  grid: {
    width: 8,
    height: 8
  },
  heuristicFunction: "Manhattan"
});

It is possible to adjust the weight of the heuristic function. For example if you use 0, every heuristic function will return zero. That is how you can turn A* into Dijkstra’s Algorithm. Depending on the weight value you can decide if you prefer speed or accuracy. The lower the weight is, the lower will the heuristic function get, which will make the A* slower.

this.aStarInstance = new AStarFinder({
  grid: {
    width: 8,
    height: 8
  },
  weight: 0.7
});

Include or Exclude the start and end node:

this.aStarInstance = new AStarFinder({
  grid: {
    width: 8,
    height: 8
  },
  includeStartNode: true,
  includeEndNode: true
});

Prettier

This library uses Prettier. The configuration used can be seen in the .prettierrc file. More informations about the format options can be found here.

License

MIT License

Copyright (c) 2017 - 2020 digitsensitive [email protected]

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].