Oraclaw Pathfind

A* pathfinding and task sequencing for AI agents. Find the optimal path through workflows, dependencies, and decision trees. K-shortest paths via Yen's algor...

Security Scan

The skill's requirements and runtime instructions align with a hosted pathfinding service: it only asks for an ORACLAW_API_KEY and contains no unrelated installs, file access, or broad privileges.

Purpose & Capability

Name/description (A* pathfinding, K-shortest via Yen) align with the declared requirement of a single ORACLAW_API_KEY for a hosted OraClaw service. No unrelated credentials or binaries are requested.

Instruction Scope

SKILL.md is instruction-only and defines a plan_pathfind tool and JSON schema for inputs/outputs. It does not instruct reading arbitrary files, shell history, system config paths, or transmitting data to unexpected endpoints. It does not grant the agent broad discretionary data collection.

Install Mechanism

No install spec and no code files are present (instruction-only), so nothing is written to disk or fetched at install time. Lowest-risk installation footprint.

Credentials

Only one environment variable is required (ORACLAW_API_KEY) and it is declared as the primary credential; that is proportional for a hosted API-backed pathfinding service. There are no other secret-like env vars or config paths requested.

Persistence & Privilege

always is false and the skill is user-invocable; there is no request to modify other skills or system-wide settings. Being instruction-only, it does not persist code or install background services.

Assessment

This skill appears coherent: it represents a hosted pathfinding API and only asks for a single ORACLAW_API_KEY. Before installing, verify the provider (https://oraclaw.dev/pathfind), confirm pricing and rate limits, and do not reuse privileged keys (e.g., don't provide an AWS/GCP key). If you want stronger isolation, create a scoped API key with minimum permissions on OraClaw and review the provider's privacy/data-retention policy since queries will be sent to their service.

OraClaw Pathfind — Workflow Navigation for Agents

You are a pathfinding agent that finds optimal routes through task graphs, dependency networks, and decision trees using A* with configurable heuristics.

When to Use This Skill

Use when the user or agent needs to:

• Find the fastest/cheapest/safest path through a task dependency graph
• Sequence tasks optimally considering time, cost, and risk
• Find K alternative paths (not just the best one)
• Navigate complex workflows with multiple routes to completion
• Plan project execution order with dependency constraints

Tool: plan_pathfind

{
  "nodes": [
    { "id": "start", "cost": 0 },
    { "id": "design", "cost": 5, "time": 3, "risk": 0.1 },
    { "id": "build", "cost": 20, "time": 10, "risk": 0.3 },
    { "id": "test", "cost": 8, "time": 5, "risk": 0.1 },
    { "id": "deploy", "cost": 3, "time": 1, "risk": 0.2 },
    { "id": "done", "cost": 0 }
  ],
  "edges": [
    { "from": "start", "to": "design", "cost": 5 },
    { "from": "design", "to": "build", "cost": 20 },
    { "from": "design", "to": "test", "cost": 8 },
    { "from": "build", "to": "test", "cost": 8 },
    { "from": "build", "to": "deploy", "cost": 3 },
    { "from": "test", "to": "deploy", "cost": 3 },
    { "from": "deploy", "to": "done", "cost": 0 }
  ],
  "start": "start",
  "end": "done",
  "heuristic": "cost",
  "kPaths": 3
}

Returns: optimal path + cost breakdown + K alternative routes.

Heuristics

• cost — Minimize total monetary cost
• time — Minimize total time
• risk — Minimize cumulative risk
• weighted — Balanced (default: equal weight to cost/time/risk)
• zero — Dijkstra (no heuristic, guaranteed shortest)

Rules

1. All edges are directed (A→B doesn't mean B→A unless you add both)
2. Edge costs must be non-negative (A* requires this)
3. K-shortest paths uses Yen's algorithm — set kPaths=1 for just the best path
4. If no path exists between start and end, returns empty path with Infinity cost
5. Risk values should be 0-1 probabilities; they're summed along the path

Pricing

$0.03 per pathfinding query. USDC on Base via x402. Free tier: 3,000 calls/month.