qiao/PathFinding.js
PathFinding.js
PathFinding.js is a grid-based pathfinding library that implements multiple search algorithms for computing optimal routes on 2D maps. It provides implementations of A*, Dijkstra, Breadth-First Search, and Jump Point Search, each designed to find the shortest path between two points on a grid while avoiding obstacles.
The library is built around a pluggable architecture where each pathfinding strategy shares a common interface, allowing algorithms to be selected at runtime without modifying core logic. It includes a configurable diagonal movement rule engine that controls diagonal traversal based on adjacent obstacle counts, and supports heuristic-driven search to balance optimality and performance. Jump Point Search optimization is available for uniform-cost grids, pruning symmetric paths to reduce node expansions in open areas.
The system represents the search space as a 2D grid of walkable and blocked cells, with support for defining obstacles at individual coordinates or across entire matrices. It offers algorithm selection from multiple strategies, diagonal movement control with configurable rules, movement restriction to cardinal directions only, and grid cloning to preserve original maps after pathfinding operations. Node pooling is used to reuse objects across searches, reducing memory allocation overhead in repeated calls.
Features
- Grid Pathfinding - A library that computes shortest routes on 2D grids using multiple search algorithms like A* and Dijkstra.
- Jump Point Search Pathfinding - Accelerates pathfinding on uniform-cost grids by skipping large open areas with Jump Point Search.
- Obstacle Definitions - Allows marking cells as blocked or walkable to define the navigable space for pathfinding.
- Grid-Based State Representations - Represents the search space as a 2D grid of walkable and blocked cells for pathfinding.
- Pathfinding Algorithm Selection - Allows selection from multiple pathfinding strategies including A*, Dijkstra, Breadth-First, and Jump Point Search.
- Grid Pathfinding - Implements Breadth-First Search for finding shortest paths on unweighted grid maps.
- Dijkstra Implementations - Implements Dijkstra's algorithm for finding shortest paths on weighted or unweighted grids.
- Diagonal Movement Rules - Controls diagonal movement based on configurable rules evaluating adjacent obstacle counts.
- Grid Obstacle Definitions - Provides the core mechanism for defining navigable space by marking grid cells as obstacles.
- Heuristic Graph Search Algorithms - Uses cost-plus-heuristic evaluation functions to guide node expansion in pathfinding algorithms.
- Jump Point Search Optimizations - Implements Jump Point Search to prune symmetric paths and reduce node expansions on uniform-cost grids.
- A-Star Search - Implements the A* search algorithm for finding optimal paths on grid-based maps.
- Pathfinding Algorithms - Implements Dijkstra's algorithm for finding shortest paths by exploring cells in order of increasing distance.
- Jump Point Search Pathfinding - Speeds up A* by skipping large open areas on uniform-cost grids using Jump Point Search.
- Cardinal - Disables diagonal traversal so the pathfinder only moves in cardinal directions on the grid.
- Plugin-Based Architectures - Implements a pluggable architecture where each pathfinding strategy is a swappable module sharing a common interface.
- Grid Diagonal Movement Rules - Provides a configurable diagonal movement rule engine that controls traversal based on adjacent obstacle counts.
