[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6CXEV8RJ1QP4G2T167CGCW3":3,"skill-same:01M6CXEV8RJ1QP4G2T167CGCW3":53},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":25,"linkOnly":26,"markdownContent":27,"markdownBody":28,"frontMatter":29,"refName":33,"commitSha":34,"skillDirectory":5,"forksCount":35,"repositoryHtmlUrl":36,"repositoryHomepageUrl":6,"ownerHtmlUrl":37,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":38,"install":39,"resources":52},"01M6CXEV8RJ1QP4G2T167CGCW3","planning-ai",null,"AI planning and scheduling","ffsshhttiikk\u002Fopencode-agents-skills","ffsshhttiikk","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F226346827?v=4","01M6CWD9RR3Y7VRQX3MXYC8FYH","01M6CWD9WVPYAZW0J82G1VKGHY",3,"MIT","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fplanning-ai\u002FSKILL.md",[],[18,19,20,21,22,23,24],"planning","planning ai","machine-learning","learning","opencode","scheduling","intelligence","2026-11-10 10:12:30",false,"---\nname: planning-ai\ndescription: AI planning and scheduling\nlicense: MIT\ncompatibility: opencode\nmetadata:\n  audience: machine-learning-engineers\n  category: artificial-intelligence\n---\n\n## What I do\n\n- Design AI planning systems\n- Implement classical planning\n- Build hierarchical task networks\n- Handle temporal planning\n- Create scheduling systems\n- Solve planning under constraints\n\n## When to use me\n\nUse me when:\n- Building autonomous agents\n- Task automation and orchestration\n- Robotics planning\n- Resource scheduling\n\n## Key Concepts\n\n### Planning Paradigms\n- **Classical**: Fully observable, deterministic\n- **Stochastic**: Partially observable, probabilistic\n- **Temporal**: Time constraints\n- **Hierarchical**: HTN decomposition\n- **Preference-based**: Soft constraints\n\n### Planning Example (PDDL)\n```pddl\n;; Domain definition\n(define (domain robot-navigation)\n  (:requirements :strips :typing)\n  (:types location robot)\n  (:predicates\n    (at ?r - robot ?l - location)\n    (connected ?l1 ?l2 - location)\n    (holding ?r - robot))\n  \n  (:action move\n    :parameters (?r - robot ?from ?to - location)\n    :precondition (and (at ?r ?from) (connected ?from ?to))\n    :effect (and (not (at ?r ?from)) (at ?r ?to)))\n  \n  (:action pick\n    :parameters (?r - robot ?l - location)\n    :precondition (at ?r ?l)\n    :effect (holding ?r)))\n\n;; Problem\n(define (problem robot-prob1)\n  (:domain robot-navigation)\n  (:objects r1 - robot loc1 loc2 loc3 - location)\n  (:init (at r1 loc1) (connected loc1 loc2) (connected loc2 loc3))\n  (:goal (at r1 loc3)))\n```\n\n### Python Planning (pyplan)\n```python\nfrom pyplan import planning\n\n# A* Search Planning\ndef plan(start, goal, successors, heuristic):\n    frontier = [(0, start)]\n    came_from = {start: None}\n    cost_so_far = {start: 0}\n    \n    while frontier:\n        _, current = heapq.heappop(frontier)\n        \n        if current == goal:\n            return reconstruct_path(came_from, current)\n        \n        for next_state in successors(current):\n            new_cost = cost_so_far[current] + 1\n            if next_state not in cost_so_far or new_cost \u003C cost_so_far[next_state]:\n                cost_so_far[next_state] = new_cost\n                priority = new_cost + heuristic(next_state, goal)\n                heapq.heappush(frontier, (priority, next_state))\n                came_from[next_state] = current\n    \n    return None\n```\n","## What I do\n\n- Design AI planning systems\n- Implement classical planning\n- Build hierarchical task networks\n- Handle temporal planning\n- Create scheduling systems\n- Solve planning under constraints\n\n## When to use me\n\nUse me when:\n- Building autonomous agents\n- Task automation and orchestration\n- Robotics planning\n- Resource scheduling\n\n## Key Concepts\n\n### Planning Paradigms\n- **Classical**: Fully observable, deterministic\n- **Stochastic**: Partially observable, probabilistic\n- **Temporal**: Time constraints\n- **Hierarchical**: HTN decomposition\n- **Preference-based**: Soft constraints\n\n### Planning Example (PDDL)\n```pddl\n;; Domain definition\n(define (domain robot-navigation)\n  (:requirements :strips :typing)\n  (:types location robot)\n  (:predicates\n    (at ?r - robot ?l - location)\n    (connected ?l1 ?l2 - location)\n    (holding ?r - robot))\n  \n  (:action move\n    :parameters (?r - robot ?from ?to - location)\n    :precondition (and (at ?r ?from) (connected ?from ?to))\n    :effect (and (not (at ?r ?from)) (at ?r ?to)))\n  \n  (:action pick\n    :parameters (?r - robot ?l - location)\n    :precondition (at ?r ?l)\n    :effect (holding ?r)))\n\n;; Problem\n(define (problem robot-prob1)\n  (:domain robot-navigation)\n  (:objects r1 - robot loc1 loc2 loc3 - location)\n  (:init (at r1 loc1) (connected loc1 loc2) (connected loc2 loc3))\n  (:goal (at r1 loc3)))\n```\n\n### Python Planning (pyplan)\n```python\nfrom pyplan import planning\n\n# A* Search Planning\ndef plan(start, goal, successors, heuristic):\n    frontier = [(0, start)]\n    came_from = {start: None}\n    cost_so_far = {start: 0}\n    \n    while frontier:\n        _, current = heapq.heappop(frontier)\n        \n        if current == goal:\n            return reconstruct_path(came_from, current)\n        \n        for next_state in successors(current):\n            new_cost = cost_so_far[current] + 1\n            if next_state not in cost_so_far or new_cost \u003C cost_so_far[next_state]:\n                cost_so_far[next_state] = new_cost\n                priority = new_cost + heuristic(next_state, goal)\n                heapq.heappush(frontier, (priority, next_state))\n                came_from[next_state] = current\n    \n    return None\n```\n",{"name":5,"license":14,"metadata":30,"description":7,"compatibility":22},{"audience":31,"category":32},"machine-learning-engineers","artificial-intelligence","main","5f7a3e453c98261f93d19a6a7de44ad8f7b72d41",2,"https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk","2026-03-01 06:55:40",{"source":8,"skillName":5,"commands":40,"prompt":50,"zipAvailable":51},[41,44,47],{"tool":42,"command":43},"npx","npx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill planning-ai",{"tool":45,"command":46},"bunx","bunx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill planning-ai",{"tool":48,"command":49},"pnpm","pnpm dlx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill planning-ai","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fplanning-ai\u002FSKILL.md",true,[],[54,65,75,84,94,103],{"skillNo":55,"name":56,"nameZh":6,"description":57,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":58,"categories":59,"keywords":60,"publishedAt":25},"01M6CXT9TXDF79BWJTMQAPB49G","xamarin","Xamarin cross-platform development","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fxamarin\u002FSKILL.md",[],[56,61,62,63,22,64],"platform","cross-platform","mobile","development",{"skillNo":66,"name":67,"nameZh":6,"description":68,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":69,"categories":70,"keywords":71,"publishedAt":25},"01M6CXT8AD04MFYDA32VW3FKAG","wrangling","Data wrangling fundamentals","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwrangling\u002FSKILL.md",[],[67,72,22,73,74],"data wrangling","science","data",{"skillNo":76,"name":77,"nameZh":6,"description":78,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":79,"categories":80,"keywords":81,"publishedAt":25},"01M6CXT717GCN7SRRNPBDP4508","windows","Windows operating system administration and scripting","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwindows\u002FSKILL.md",[],[77,82,22,83],"system","scripting",{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":25},"01M6CXT54K794NMEM3XAPZZDKT","wide-column","Wide-column data model","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwide-column\u002FSKILL.md",[],[91,92,22,93,74],"wide column","databases","model",{"skillNo":95,"name":96,"nameZh":6,"description":97,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":98,"categories":99,"keywords":100,"publishedAt":25},"01M6CXT28FMT2P4V9GZE67WA8E","wide-column-stores","Wide-column database stores","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwide-column-stores\u002FSKILL.md",[],[101,92,22,102],"wide column stores","database",{"skillNo":104,"name":105,"nameZh":6,"description":106,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":107,"categories":108,"keywords":109,"publishedAt":25},"01M6CXT0D0M0Q4T2N7C2RX7DSN","websockets","WebSocket implementation and best practices","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwebsockets\u002FSKILL.md",[],[105,110,111,112,22,113,114],"websocket","real-time","time","best practices","implementation"]