navigate_guided
Find a guided path between start and goal nodes in a cognitive diagram using distance, reward, or semantic similarity heuristics.
Instructions
Find guided path from start to goal node.
Uses shortest-path algorithm for optimal traversal.
Args: diagram_id: ID of diagram start_node: Starting node ID goal_node: Target node ID heuristic: 'distance' (default), 'reward', or 'semantic_similarity'
Returns: dict with path, cost, num_steps, found flag
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| goal_node | Yes | ||
| heuristic | No | distance | |
| diagram_id | Yes | ||
| start_node | Yes | ||
| expand_composites | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||