返回顶部
o

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 algorithm. Cost/time/risk breakdown.

作者: admin | 来源: ClawHub
源自
ClawHub
版本
V 1.0.0
安全检测
已通过
67
下载量
0
收藏
概述
安装方式
版本历史

oraclaw-pathfind

# 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` ```json { "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.

标签

skill ai

通过对话安装

该技能支持在以下平台通过对话安装:

OpenClaw WorkBuddy QClaw Kimi Claude

方式一:安装 SkillHub 和技能

帮我安装 SkillHub 和 oraclaw-pathfind-1775978588 技能

方式二:设置 SkillHub 为优先技能安装源

设置 SkillHub 为我的优先技能安装源,然后帮我安装 oraclaw-pathfind-1775978588 技能

通过命令行安装

skillhub install oraclaw-pathfind-1775978588

下载 Zip 包

⬇ 下载 oraclaw-pathfind v1.0.0

文件大小: 1.86 KB | 发布时间: 2026-4-13 11:22

v1.0.0 最新 2026-4-13 11:22
- Initial release of OraClaw Pathfind: A* pathfinding and task sequencing for AI agents.
- Supports optimal pathfinding through workflows, dependency networks, and decision trees.
- Provides K-shortest paths via Yen's algorithm with configurable heuristics (cost, time, risk, weighted).
- Returns full cost, time, and risk breakdowns for each route.
- Free tier (3,000 calls/month); pricing set at $0.03 per query.

Archiver·手机版·闲社网·闲社论坛·羊毛社区· 多链控股集团有限公司 · 苏ICP备2025199260号-1

Powered by Discuz! X5.0   © 2024-2025 闲社网·线报更新论坛·羊毛分享社区·http://xianshe.com

p2p_official_large
返回顶部