All Projects → eXo-OpenSource → ml_pathfind

eXo-OpenSource / ml_pathfind

Licence: MIT license
Pathfind module for MTA:SA-Server

Programming Languages

C++
36643 projects - #6 most used programming language
c
50402 projects - #5 most used programming language
lua
6591 projects

Projects that are alternatives of or similar to ml pathfind

Visualizer
A single-page website aiming to provide innovative and intuitive visualizations of common and AI algorithms.
Stars: ✭ 163 (+552%)
Mutual labels:  pathfinding
FyWorld
FyWorld - Base-Building / Simulation Game & Tutorial in Unity
Stars: ✭ 207 (+728%)
Mutual labels:  pathfinding
Pathfinding Visualization
A ReactJS project visualizes the path-finding algorithms with additional cool features like speed adjustment, maze generation, mobile support, etc.
Stars: ✭ 14 (-44%)
Mutual labels:  pathfinding
04 battletank
An open-world head-to-head tank fight with simple AI, terrain, and advanced control system in Unreal 4. (ref: BT_URC) http://gdev.tv/urcgithub
Stars: ✭ 172 (+588%)
Mutual labels:  pathfinding
Pathfinder.vim
Vim plugin to suggest better movements
Stars: ✭ 228 (+812%)
Mutual labels:  pathfinding
php-a-star
A* (A Star) search algorithm for PHP
Stars: ✭ 61 (+144%)
Mutual labels:  pathfinding
Ecs
ECS for Unity with full game state automatic rollbacks
Stars: ✭ 151 (+504%)
Mutual labels:  pathfinding
EvOLuTIoN
A simple simulation in Unity, which uses genetic algorithm to optimize forces applied to cubes
Stars: ✭ 44 (+76%)
Mutual labels:  pathfinding
Cupoch
Robotics with GPU computing
Stars: ✭ 225 (+800%)
Mutual labels:  pathfinding
cepathfind
a path find for tilebase game in unity
Stars: ✭ 30 (+20%)
Mutual labels:  pathfinding
Navmesh
A plugin for path-finding in JS using navmeshes, with wrappers for Phaser 3 and Phaser 2
Stars: ✭ 186 (+644%)
Mutual labels:  pathfinding
Astar
A fast 2D path finding library based on the A* algorithm. Works with both grids and graphs. Supports any .NET variant that supports .NETStandard 2.0 or higher. This library has no external dependencies. The library is licensed under the MIT license.
Stars: ✭ 215 (+760%)
Mutual labels:  pathfinding
circular-obstacle-pathfinding
Pathfinding around a set of circular obstacles
Stars: ✭ 26 (+4%)
Mutual labels:  pathfinding
Pathfinding
Visual explanation of pathfinding algorithms and how a*, Dijkstra and BFS can be seen as the same algorithm with different parameter/data structures used under the hood
Stars: ✭ 165 (+560%)
Mutual labels:  pathfinding
The-Kraken-Pathfinding
A tentacle-based pathfinding library for nonholonomic robotic vehicles
Stars: ✭ 24 (-4%)
Mutual labels:  pathfinding
Simple Optimized A Pathfinder
An simple and optimized grid pathfinding
Stars: ✭ 157 (+528%)
Mutual labels:  pathfinding
hedit
Handling Editor - to get the resource, press the "releases" link below
Stars: ✭ 17 (-32%)
Mutual labels:  multi-theft-auto
path planning GAN
Path Planning using Generative Adversarial Network (GAN)
Stars: ✭ 36 (+44%)
Mutual labels:  pathfinding
mtasa-php-sdk
The official PHP SDK for the Multi Theft Auto Web Interface.
Stars: ✭ 19 (-24%)
Mutual labels:  multi-theft-auto
pathfinding-visualizer
Website built using React Framework for visualizing Pathfinding and Maze Generation Algorithms.
Stars: ✭ 33 (+32%)
Mutual labels:  pathfinding

Pathfind Server Module for MTA:SA

Build Status Build Status

Developing

  1. Download and install the EditorConfig plugin for Visual Studio: https://github.com/editorconfig/editorconfig-visualstudio#readme
  2. Launch premake.bat
  3. Open Build/Pathfind.sln

Installing

  1. Put the resulting Bin/ml_gps.dll/.so into your MTA:SA server modules folder.
  2. Add <module src="ml_gps.dll"/> (or .so for Linux) to your mtaserver.conf.
  3. Start the server

API

Function: loadPathGraph

int loadPathGraph(string path)
  • path: The path to the graph definition file (relative to the resource directory)

Returns graphId if everything went fine, false otherwise.

Function: unloadPathGraph

bool unloadPathGraph(int graphId)
  • graphId: The id of the graph

Returns true if the graph has been unloaded, false otherwise.

Function: findShortestPathBetween

bool findShortestPathBetween(int graphId, float startX, float startY, float startZ, float endX, float endY, float endZ, function callback)
  • graphId: The id of the graph
  • startX, startY, startZ: The start position
  • endX, endY, endZ: The end position
  • callback: The callback function (parameters: table nodes)

Returns true if the route calculation has been scheduled successfully, false otherwise.

Function: isGraphLoaded

bool isGraphLoaded(int graphId)
  • graphId: The id of the graph

Returns true if the graph is already loaded, false otherwise.

Function: findNodeAt

int, float, float, float findNodeAt(int graphId, float positionX, float positionY, float positionZ)
  • graphId: The id of the graph
  • positionX, positionY, positionZ: The postion where to search for a node

Returns 4 integers representing nodeId and his position if a node was found, false otherwise.

Function: getNodeNeighbors

table getNodeNeighbors(int graphId, int nodeId, int depth)
  • graphId: The id of the graph
  • nodeId: The id of the start node
  • depth: The depth of the node neighbors

Returns a table with all neighbors of the node, false otherwise.

Contributors

  • Justus H.
  • Stefan K.
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].