plan_pathfind
Calculate optimal routes using A* pathfinding with k-shortest paths (Yen's algorithm) for graph-based navigation problems.
Instructions
A* pathfinding with k-shortest paths (Yen's algorithm). Optimal routing.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| nodes | Yes | [{id, x?, y?}] | |
| edges | Yes | [{source, target, cost}] | |
| start | Yes | Start node ID | |
| goal | Yes | Goal node ID | |
| k | No | Number of paths (default: 1) |