@esengine/pathfinding 1.0.0

package/dist/index.d.ts

@@ -0,0 +1,740 @@
+import { BlueprintNodeTemplate, INodeExecutor, BlueprintNode, ExecutionResult } from '@esengine/blueprint';
+
+/**
+ * @zh 寻路系统核心接口
+ * @en Pathfinding System Core Interfaces
+ */
+/**
+ * @zh 2D 坐标点
+ * @en 2D coordinate point
+ */
+interface IPoint {
+    readonly x: number;
+    readonly y: number;
+}
+/**
+ * @zh 创建点
+ * @en Create a point
+ */
+declare function createPoint(x: number, y: number): IPoint;
+/**
+ * @zh 路径节点
+ * @en Path node
+ */
+interface IPathNode {
+    /** @zh 节点唯一标识 @en Unique node identifier */
+    readonly id: string | number;
+    /** @zh 节点位置 @en Node position */
+    readonly position: IPoint;
+    /** @zh 移动代价 @en Movement cost */
+    readonly cost: number;
+    /** @zh 是否可通行 @en Is walkable */
+    readonly walkable: boolean;
+}
+/**
+ * @zh 路径结果
+ * @en Path result
+ */
+interface IPathResult {
+    /** @zh 是否找到路径 @en Whether path was found */
+    readonly found: boolean;
+    /** @zh 路径点列表 @en List of path points */
+    readonly path: readonly IPoint[];
+    /** @zh 路径总代价 @en Total path cost */
+    readonly cost: number;
+    /** @zh 搜索的节点数 @en Number of nodes searched */
+    readonly nodesSearched: number;
+}
+/**
+ * @zh 空路径结果
+ * @en Empty path result
+ */
+declare const EMPTY_PATH_RESULT: IPathResult;
+/**
+ * @zh 寻路地图接口
+ * @en Pathfinding map interface
+ */
+interface IPathfindingMap {
+    /**
+     * @zh 获取节点的邻居
+     * @en Get neighbors of a node
+     */
+    getNeighbors(node: IPathNode): IPathNode[];
+    /**
+     * @zh 获取指定位置的节点
+     * @en Get node at position
+     */
+    getNodeAt(x: number, y: number): IPathNode | null;
+    /**
+     * @zh 计算两点间的启发式距离
+     * @en Calculate heuristic distance between two points
+     */
+    heuristic(a: IPoint, b: IPoint): number;
+    /**
+     * @zh 计算两个邻居节点间的移动代价
+     * @en Calculate movement cost between two neighbor nodes
+     */
+    getMovementCost(from: IPathNode, to: IPathNode): number;
+    /**
+     * @zh 检查位置是否可通行
+     * @en Check if position is walkable
+     */
+    isWalkable(x: number, y: number): boolean;
+}
+/**
+ * @zh 启发式函数类型
+ * @en Heuristic function type
+ */
+type HeuristicFunction = (a: IPoint, b: IPoint) => number;
+/**
+ * @zh 曼哈顿距离（4方向移动）
+ * @en Manhattan distance (4-directional movement)
+ */
+declare function manhattanDistance(a: IPoint, b: IPoint): number;
+/**
+ * @zh 欧几里得距离（任意方向移动）
+ * @en Euclidean distance (any direction movement)
+ */
+declare function euclideanDistance(a: IPoint, b: IPoint): number;
+/**
+ * @zh 切比雪夫距离（8方向移动）
+ * @en Chebyshev distance (8-directional movement)
+ */
+declare function chebyshevDistance(a: IPoint, b: IPoint): number;
+/**
+ * @zh 八角距离（8方向移动，对角线代价为 √2）
+ * @en Octile distance (8-directional, diagonal cost √2)
+ */
+declare function octileDistance(a: IPoint, b: IPoint): number;
+/**
+ * @zh 寻路配置
+ * @en Pathfinding options
+ */
+interface IPathfindingOptions {
+    /** @zh 最大搜索节点数 @en Maximum nodes to search */
+    maxNodes?: number;
+    /** @zh 启发式权重 (>1 更快但可能非最优) @en Heuristic weight (>1 faster but may be suboptimal) */
+    heuristicWeight?: number;
+    /** @zh 是否允许对角移动 @en Allow diagonal movement */
+    allowDiagonal?: boolean;
+    /** @zh 是否避免穿角 @en Avoid corner cutting */
+    avoidCorners?: boolean;
+}
+/**
+ * @zh 默认寻路配置
+ * @en Default pathfinding options
+ */
+declare const DEFAULT_PATHFINDING_OPTIONS: Required<IPathfindingOptions>;
+/**
+ * @zh 寻路器接口
+ * @en Pathfinder interface
+ */
+interface IPathfinder {
+    /**
+     * @zh 查找路径
+     * @en Find path
+     */
+    findPath(startX: number, startY: number, endX: number, endY: number, options?: IPathfindingOptions): IPathResult;
+    /**
+     * @zh 清理状态（用于重用）
+     * @en Clear state (for reuse)
+     */
+    clear(): void;
+}
+/**
+ * @zh 路径平滑器接口
+ * @en Path smoother interface
+ */
+interface IPathSmoother {
+    /**
+     * @zh 平滑路径
+     * @en Smooth path
+     */
+    smooth(path: readonly IPoint[], map: IPathfindingMap): IPoint[];
+}
+/**
+ * @zh 视线检测函数类型
+ * @en Line of sight check function type
+ */
+type LineOfSightCheck = (x1: number, y1: number, x2: number, y2: number, map: IPathfindingMap) => boolean;
+
+/**
+ * @zh 二叉堆（优先队列）
+ * @en Binary Heap (Priority Queue)
+ *
+ * @zh 用于 A* 算法的高效开放列表
+ * @en Efficient open list for A* algorithm
+ */
+declare class BinaryHeap<T> {
+    private heap;
+    private readonly compare;
+    /**
+     * @zh 创建二叉堆
+     * @en Create binary heap
+     *
+     * @param compare - @zh 比较函数，返回负数表示 a < b @en Compare function, returns negative if a < b
+     */
+    constructor(compare: (a: T, b: T) => number);
+    /**
+     * @zh 堆大小
+     * @en Heap size
+     */
+    get size(): number;
+    /**
+     * @zh 是否为空
+     * @en Is empty
+     */
+    get isEmpty(): boolean;
+    /**
+     * @zh 插入元素
+     * @en Push element
+     */
+    push(item: T): void;
+    /**
+     * @zh 弹出最小元素
+     * @en Pop minimum element
+     */
+    pop(): T | undefined;
+    /**
+     * @zh 查看最小元素（不移除）
+     * @en Peek minimum element (without removing)
+     */
+    peek(): T | undefined;
+    /**
+     * @zh 更新元素（重新排序）
+     * @en Update element (re-sort)
+     */
+    update(item: T): void;
+    /**
+     * @zh 检查是否包含元素
+     * @en Check if contains element
+     */
+    contains(item: T): boolean;
+    /**
+     * @zh 清空堆
+     * @en Clear heap
+     */
+    clear(): void;
+    /**
+     * @zh 上浮操作
+     * @en Bubble up operation
+     */
+    private bubbleUp;
+    /**
+     * @zh 下沉操作
+     * @en Sink down operation
+     */
+    private sinkDown;
+}
+
+/**
+ * @zh A* 寻路算法实现
+ * @en A* Pathfinding Algorithm Implementation
+ */
+
+/**
+ * @zh A* 寻路器
+ * @en A* Pathfinder
+ *
+ * @zh 使用 A* 算法在地图上查找最短路径
+ * @en Uses A* algorithm to find shortest path on a map
+ *
+ * @example
+ * ```typescript
+ * const map = new GridMap(width, height);
+ * const pathfinder = new AStarPathfinder(map);
+ * const result = pathfinder.findPath(0, 0, 10, 10);
+ * if (result.found) {
+ *     console.log('Path:', result.path);
+ * }
+ * ```
+ */
+declare class AStarPathfinder implements IPathfinder {
+    private readonly map;
+    private nodeCache;
+    private openList;
+    constructor(map: IPathfindingMap);
+    /**
+     * @zh 查找路径
+     * @en Find path
+     */
+    findPath(startX: number, startY: number, endX: number, endY: number, options?: IPathfindingOptions): IPathResult;
+    /**
+     * @zh 清理状态
+     * @en Clear state
+     */
+    clear(): void;
+    /**
+     * @zh 获取或创建 A* 节点
+     * @en Get or create A* node
+     */
+    private getOrCreateAStarNode;
+    /**
+     * @zh 构建路径结果
+     * @en Build path result
+     */
+    private buildPath;
+}
+/**
+ * @zh 创建 A* 寻路器
+ * @en Create A* pathfinder
+ */
+declare function createAStarPathfinder(map: IPathfindingMap): AStarPathfinder;
+
+/**
+ * @zh 网格地图实现
+ * @en Grid Map Implementation
+ */
+
+/**
+ * @zh 网格节点
+ * @en Grid node
+ */
+declare class GridNode implements IPathNode {
+    readonly id: string;
+    readonly position: IPoint;
+    readonly x: number;
+    readonly y: number;
+    cost: number;
+    walkable: boolean;
+    constructor(x: number, y: number, walkable?: boolean, cost?: number);
+}
+/**
+ * @zh 4方向偏移 (上下左右)
+ * @en 4-directional offsets (up, down, left, right)
+ */
+declare const DIRECTIONS_4: readonly [{
+    readonly dx: 0;
+    readonly dy: -1;
+}, {
+    readonly dx: 1;
+    readonly dy: 0;
+}, {
+    readonly dx: 0;
+    readonly dy: 1;
+}, {
+    readonly dx: -1;
+    readonly dy: 0;
+}];
+/**
+ * @zh 8方向偏移 (含对角线)
+ * @en 8-directional offsets (including diagonals)
+ */
+declare const DIRECTIONS_8: readonly [{
+    readonly dx: 0;
+    readonly dy: -1;
+}, {
+    readonly dx: 1;
+    readonly dy: -1;
+}, {
+    readonly dx: 1;
+    readonly dy: 0;
+}, {
+    readonly dx: 1;
+    readonly dy: 1;
+}, {
+    readonly dx: 0;
+    readonly dy: 1;
+}, {
+    readonly dx: -1;
+    readonly dy: 1;
+}, {
+    readonly dx: -1;
+    readonly dy: 0;
+}, {
+    readonly dx: -1;
+    readonly dy: -1;
+}];
+/**
+ * @zh 网格地图配置
+ * @en Grid map options
+ */
+interface IGridMapOptions {
+    /** @zh 是否允许对角移动 @en Allow diagonal movement */
+    allowDiagonal?: boolean;
+    /** @zh 对角移动代价 @en Diagonal movement cost */
+    diagonalCost?: number;
+    /** @zh 是否避免穿角 @en Avoid corner cutting */
+    avoidCorners?: boolean;
+    /** @zh 启发式函数 @en Heuristic function */
+    heuristic?: HeuristicFunction;
+}
+/**
+ * @zh 默认网格地图配置
+ * @en Default grid map options
+ */
+declare const DEFAULT_GRID_OPTIONS: Required<IGridMapOptions>;
+/**
+ * @zh 网格地图
+ * @en Grid Map
+ *
+ * @zh 基于二维数组的网格地图实现，支持4方向和8方向移动
+ * @en Grid map implementation based on 2D array, supports 4 and 8 directional movement
+ *
+ * @example
+ * ```typescript
+ * // Create a 10x10 grid
+ * const grid = new GridMap(10, 10);
+ *
+ * // Set some cells as obstacles
+ * grid.setWalkable(5, 5, false);
+ * grid.setWalkable(5, 6, false);
+ *
+ * // Use with pathfinder
+ * const pathfinder = new AStarPathfinder(grid);
+ * const result = pathfinder.findPath(0, 0, 9, 9);
+ * ```
+ */
+declare class GridMap implements IPathfindingMap {
+    readonly width: number;
+    readonly height: number;
+    private readonly nodes;
+    private readonly options;
+    constructor(width: number, height: number, options?: IGridMapOptions);
+    /**
+     * @zh 创建网格节点
+     * @en Create grid nodes
+     */
+    private createNodes;
+    /**
+     * @zh 获取指定位置的节点
+     * @en Get node at position
+     */
+    getNodeAt(x: number, y: number): GridNode | null;
+    /**
+     * @zh 检查坐标是否在边界内
+     * @en Check if coordinates are within bounds
+     */
+    isInBounds(x: number, y: number): boolean;
+    /**
+     * @zh 检查位置是否可通行
+     * @en Check if position is walkable
+     */
+    isWalkable(x: number, y: number): boolean;
+    /**
+     * @zh 设置位置是否可通行
+     * @en Set position walkability
+     */
+    setWalkable(x: number, y: number, walkable: boolean): void;
+    /**
+     * @zh 设置位置的移动代价
+     * @en Set movement cost at position
+     */
+    setCost(x: number, y: number, cost: number): void;
+    /**
+     * @zh 获取节点的邻居
+     * @en Get neighbors of a node
+     */
+    getNeighbors(node: IPathNode): GridNode[];
+    /**
+     * @zh 计算启发式距离
+     * @en Calculate heuristic distance
+     */
+    heuristic(a: IPoint, b: IPoint): number;
+    /**
+     * @zh 计算移动代价
+     * @en Calculate movement cost
+     */
+    getMovementCost(from: IPathNode, to: IPathNode): number;
+    /**
+     * @zh 从二维数组加载地图
+     * @en Load map from 2D array
+     *
+     * @param data - @zh 0=可通行，非0=不可通行 @en 0=walkable, non-0=blocked
+     */
+    loadFromArray(data: number[][]): void;
+    /**
+     * @zh 从字符串加载地图
+     * @en Load map from string
+     *
+     * @param str - @zh 地图字符串，'.'=可通行，'#'=障碍 @en Map string, '.'=walkable, '#'=blocked
+     */
+    loadFromString(str: string): void;
+    /**
+     * @zh 导出为字符串
+     * @en Export to string
+     */
+    toString(): string;
+    /**
+     * @zh 重置所有节点为可通行
+     * @en Reset all nodes to walkable
+     */
+    reset(): void;
+    /**
+     * @zh 设置矩形区域的通行性
+     * @en Set walkability for a rectangle region
+     */
+    setRectWalkable(x: number, y: number, width: number, height: number, walkable: boolean): void;
+}
+/**
+ * @zh 创建网格地图
+ * @en Create grid map
+ */
+declare function createGridMap(width: number, height: number, options?: IGridMapOptions): GridMap;
+
+/**
+ * @zh 导航网格实现
+ * @en NavMesh Implementation
+ */
+
+/**
+ * @zh 导航多边形
+ * @en Navigation polygon
+ */
+interface INavPolygon {
+    /** @zh 多边形ID @en Polygon ID */
+    readonly id: number;
+    /** @zh 顶点列表 @en Vertex list */
+    readonly vertices: readonly IPoint[];
+    /** @zh 中心点 @en Center point */
+    readonly center: IPoint;
+    /** @zh 邻居多边形ID @en Neighbor polygon IDs */
+    readonly neighbors: readonly number[];
+    /** @zh 到邻居的共享边 @en Shared edges to neighbors */
+    readonly portals: ReadonlyMap<number, IPortal>;
+}
+/**
+ * @zh 入口（两个多边形之间的共享边）
+ * @en Portal (shared edge between two polygons)
+ */
+interface IPortal {
+    /** @zh 边的左端点 @en Left endpoint of edge */
+    readonly left: IPoint;
+    /** @zh 边的右端点 @en Right endpoint of edge */
+    readonly right: IPoint;
+}
+/**
+ * @zh 导航网格
+ * @en Navigation Mesh
+ *
+ * @zh 使用凸多边形网格进行高效寻路，适合复杂地形
+ * @en Uses convex polygon mesh for efficient pathfinding, suitable for complex terrain
+ *
+ * @example
+ * ```typescript
+ * const navmesh = new NavMesh();
+ *
+ * // Add polygons
+ * navmesh.addPolygon([
+ *     { x: 0, y: 0 }, { x: 10, y: 0 },
+ *     { x: 10, y: 10 }, { x: 0, y: 10 }
+ * ]);
+ *
+ * // Build connections
+ * navmesh.build();
+ *
+ * // Find path
+ * const result = navmesh.findPath(1, 1, 8, 8);
+ * ```
+ */
+declare class NavMesh implements IPathfindingMap {
+    private polygons;
+    private nodes;
+    private nextId;
+    /**
+     * @zh 添加导航多边形
+     * @en Add navigation polygon
+     *
+     * @returns @zh 多边形ID @en Polygon ID
+     */
+    addPolygon(vertices: IPoint[], neighbors?: number[]): number;
+    /**
+     * @zh 设置两个多边形之间的连接
+     * @en Set connection between two polygons
+     */
+    setConnection(polyA: number, polyB: number, portal: IPortal): void;
+    /**
+     * @zh 自动检测并建立相邻多边形的连接
+     * @en Auto-detect and build connections between adjacent polygons
+     */
+    build(): void;
+    /**
+     * @zh 查找两个多边形的共享边
+     * @en Find shared edge between two polygons
+     */
+    private findSharedEdge;
+    /**
+     * @zh 计算多边形中心
+     * @en Calculate polygon center
+     */
+    private calculateCenter;
+    /**
+     * @zh 查找包含点的多边形
+     * @en Find polygon containing point
+     */
+    findPolygonAt(x: number, y: number): INavPolygon | null;
+    /**
+     * @zh 检查点是否在多边形内
+     * @en Check if point is inside polygon
+     */
+    private isPointInPolygon;
+    getNodeAt(x: number, y: number): IPathNode | null;
+    getNeighbors(node: IPathNode): IPathNode[];
+    heuristic(a: IPoint, b: IPoint): number;
+    getMovementCost(from: IPathNode, to: IPathNode): number;
+    isWalkable(x: number, y: number): boolean;
+    /**
+     * @zh 在导航网格上寻路
+     * @en Find path on navigation mesh
+     */
+    findPath(startX: number, startY: number, endX: number, endY: number, options?: IPathfindingOptions): IPathResult;
+    /**
+     * @zh 在多边形图上寻路
+     * @en Find path on polygon graph
+     */
+    private findPolygonPath;
+    /**
+     * @zh 使用漏斗算法优化路径
+     * @en Optimize path using funnel algorithm
+     */
+    private funnelPath;
+    /**
+     * @zh 计算三角形面积的两倍（用于判断点的相对位置）
+     * @en Calculate twice the triangle area (for point relative position)
+     */
+    private triArea2;
+    /**
+     * @zh 计算路径总长度
+     * @en Calculate total path length
+     */
+    private calculatePathLength;
+    /**
+     * @zh 清空导航网格
+     * @en Clear navigation mesh
+     */
+    clear(): void;
+    /**
+     * @zh 获取所有多边形
+     * @en Get all polygons
+     */
+    getPolygons(): INavPolygon[];
+    /**
+     * @zh 获取多边形数量
+     * @en Get polygon count
+     */
+    get polygonCount(): number;
+}
+/**
+ * @zh 创建导航网格
+ * @en Create navigation mesh
+ */
+declare function createNavMesh(): NavMesh;
+
+/**
+ * @zh 路径平滑算法
+ * @en Path Smoothing Algorithms
+ */
+
+/**
+ * @zh 使用 Bresenham 算法检测视线
+ * @en Line of sight check using Bresenham algorithm
+ */
+declare function bresenhamLineOfSight(x1: number, y1: number, x2: number, y2: number, map: IPathfindingMap): boolean;
+/**
+ * @zh 使用射线投射检测视线（更精确）
+ * @en Line of sight check using ray casting (more precise)
+ */
+declare function raycastLineOfSight(x1: number, y1: number, x2: number, y2: number, map: IPathfindingMap, stepSize?: number): boolean;
+/**
+ * @zh 路径简化器 - 移除不必要的拐点
+ * @en Path Simplifier - Removes unnecessary waypoints
+ *
+ * @zh 使用视线检测移除可以直接到达的中间点
+ * @en Uses line of sight to remove intermediate points that can be reached directly
+ */
+declare class LineOfSightSmoother implements IPathSmoother {
+    private readonly lineOfSight;
+    constructor(lineOfSight?: typeof bresenhamLineOfSight);
+    smooth(path: readonly IPoint[], map: IPathfindingMap): IPoint[];
+}
+/**
+ * @zh Catmull-Rom 样条曲线平滑
+ * @en Catmull-Rom spline smoothing
+ */
+declare class CatmullRomSmoother implements IPathSmoother {
+    private readonly segments;
+    private readonly tension;
+    /**
+     * @param segments - @zh 每段之间的插值点数 @en Number of interpolation points per segment
+     * @param tension - @zh 张力 (0-1) @en Tension (0-1)
+     */
+    constructor(segments?: number, tension?: number);
+    smooth(path: readonly IPoint[], _map: IPathfindingMap): IPoint[];
+    /**
+     * @zh Catmull-Rom 插值
+     * @en Catmull-Rom interpolation
+     */
+    private interpolate;
+}
+/**
+ * @zh 组合路径平滑器
+ * @en Combined path smoother
+ *
+ * @zh 先简化路径，再用曲线平滑
+ * @en First simplify path, then smooth with curves
+ */
+declare class CombinedSmoother implements IPathSmoother {
+    private readonly simplifier;
+    private readonly curveSmoother;
+    constructor(curveSegments?: number, tension?: number);
+    smooth(path: readonly IPoint[], map: IPathfindingMap): IPoint[];
+}
+/**
+ * @zh 创建视线平滑器
+ * @en Create line of sight smoother
+ */
+declare function createLineOfSightSmoother(lineOfSight?: typeof bresenhamLineOfSight): LineOfSightSmoother;
+/**
+ * @zh 创建曲线平滑器
+ * @en Create curve smoother
+ */
+declare function createCatmullRomSmoother(segments?: number, tension?: number): CatmullRomSmoother;
+/**
+ * @zh 创建组合平滑器
+ * @en Create combined smoother
+ */
+declare function createCombinedSmoother(curveSegments?: number, tension?: number): CombinedSmoother;
+
+/**
+ * @zh 寻路系统蓝图节点
+ * @en Pathfinding System Blueprint Nodes
+ */
+
+declare const FindPathTemplate: BlueprintNodeTemplate;
+declare class FindPathExecutor implements INodeExecutor {
+    execute(node: BlueprintNode, context: unknown): ExecutionResult;
+}
+declare const FindPathSmoothTemplate: BlueprintNodeTemplate;
+declare class FindPathSmoothExecutor implements INodeExecutor {
+    execute(node: BlueprintNode, context: unknown): ExecutionResult;
+}
+declare const IsWalkableTemplate: BlueprintNodeTemplate;
+declare class IsWalkableExecutor implements INodeExecutor {
+    execute(node: BlueprintNode, context: unknown): ExecutionResult;
+}
+declare const GetPathLengthTemplate: BlueprintNodeTemplate;
+declare class GetPathLengthExecutor implements INodeExecutor {
+    execute(node: BlueprintNode, context: unknown): ExecutionResult;
+}
+declare const GetPathDistanceTemplate: BlueprintNodeTemplate;
+declare class GetPathDistanceExecutor implements INodeExecutor {
+    execute(node: BlueprintNode, context: unknown): ExecutionResult;
+}
+declare const GetPathPointTemplate: BlueprintNodeTemplate;
+declare class GetPathPointExecutor implements INodeExecutor {
+    execute(node: BlueprintNode, context: unknown): ExecutionResult;
+}
+declare const MoveAlongPathTemplate: BlueprintNodeTemplate;
+declare class MoveAlongPathExecutor implements INodeExecutor {
+    execute(node: BlueprintNode, context: unknown): ExecutionResult;
+}
+declare const HasLineOfSightTemplate: BlueprintNodeTemplate;
+declare class HasLineOfSightExecutor implements INodeExecutor {
+    execute(node: BlueprintNode, context: unknown): ExecutionResult;
+}
+declare const PathfindingNodeDefinitions: {
+    templates: BlueprintNodeTemplate[];
+    executors: Map<string, INodeExecutor>;
+};
+
+export { AStarPathfinder, BinaryHeap, CatmullRomSmoother, CombinedSmoother, DEFAULT_GRID_OPTIONS, DEFAULT_PATHFINDING_OPTIONS, DIRECTIONS_4, DIRECTIONS_8, EMPTY_PATH_RESULT, FindPathExecutor, FindPathSmoothExecutor, FindPathSmoothTemplate, FindPathTemplate, GetPathDistanceExecutor, GetPathDistanceTemplate, GetPathLengthExecutor, GetPathLengthTemplate, GetPathPointExecutor, GetPathPointTemplate, GridMap, GridNode, HasLineOfSightExecutor, HasLineOfSightTemplate, type HeuristicFunction, type IGridMapOptions, type INavPolygon, type IPathNode, type IPathResult, type IPathSmoother, type IPathfinder, type IPathfindingMap, type IPathfindingOptions, type IPoint, type IPortal, IsWalkableExecutor, IsWalkableTemplate, type LineOfSightCheck, LineOfSightSmoother, MoveAlongPathExecutor, MoveAlongPathTemplate, NavMesh, PathfindingNodeDefinitions, bresenhamLineOfSight, chebyshevDistance, createAStarPathfinder, createCatmullRomSmoother, createCombinedSmoother, createGridMap, createLineOfSightSmoother, createNavMesh, createPoint, euclideanDistance, manhattanDistance, octileDistance, raycastLineOfSight };