manhua-man/subagent-lane-planner
5 stars · Last commit 2026-09-22
Subagent lane planner for Codex/Cursor/Claude Code: split decision, disjoint write scopes, dependency order, and child prompts.
README preview
# subagent-lane-planner [English](README.md) | [简体中文](README.zh-CN.md) Former name: `parallel-subagent-planner`; the former `codex-parallel-subagent-planner` repository URL redirects here. `subagent-lane-planner` is a thin delegation policy for Codex. It helps Codex decide whether subagents are useful, give each subagent a bounded task, and keep final integration in the main thread. ## Core contract ```text Assess → Delegate the minimum useful work → Verify in the main thread ``` - Default to direct execution for small or sequential tasks. - Run independent read-heavy work in parallel; parallelize writes only across disjoint scopes. - Describe each subtask with `Goal`, `Read`, `Write`, and `Acceptance`. - Give every shared contract or concurrently edited file one owner. - Keep subagents from delegating further; the main thread reviews and verifies the result. - Respect user model choices and runtime defaults; use supported overrides when task needs and available capability, speed, or cost evidence justify them. No model names are pinned.