Recursive Planning Tree¶
Planning artifact — instantiates Recursive Problem Decomposition
A tree representation of a goal, its nested subgoals, and the action-ready leaves that execute them, whose edges carry each leaf's completion back up to mark parent goals achieved.
A Recursive Planning Tree is an artifact — a durable, inspectable representation of a goal decomposed into subgoals decomposed into action-ready leaves. It differs from a planning method in that it is the thing produced, not the process, and it differs from a legal issue tree in what its structure is for: every node is a goal measured by how much abstract scope remains between it and executable action, and the tree's defining feature is its edges as a propagation path — when a leaf task is completed, that completion travels up the edges to satisfy its parent subgoal, and when all of a subgoal's children are satisfied, the subgoal is marked achieved, and so on to the root. It is the roll-up structure, not a rule-based recombination, that makes the artifact work: the tree literally shows how doing the small, concrete things adds up to the big, abstract one.
Example¶
A city's climate office holds a mandate: cut municipal emissions 40% by 2030. Too abstract to act on, so it is drawn as a planning tree. The root goal branches into subgoals — electrify the vehicle fleet, retrofit public buildings, shift grid procurement — each still a goal, not yet an action. retrofit public buildings branches into audit the twelve worst buildings, replace their HVAC, install rooftop solar. audit the twelve worst buildings is finally a leaf: an action-ready task a facilities contractor can start on Monday with a scope, a budget, and a deadline — the recursion's base case, requiring no further planning. As leaves complete, the tree's edges carry completion upward: when all three retrofit children are done, retrofit public buildings flips to achieved; when the three top subgoals are achieved, the 40% root goal is met. The progress measure the tree tracks at every node is how much un-planned scope remains — the office watches abstract goals shrink into concrete, funded tasks, which is how it knows the plan is converging rather than sprawling.
How it works¶
- Represent goals as nodes. Each node is a goal or subgoal; edges express "achieved by." The artifact is read top-down to plan and bottom-up to report.
- Descend until action-ready. A branch stops when it reaches a leaf that can be executed directly — owned, scoped, and schedulable with no further decomposition.
- Track remaining scope. Each node records how much abstract, un-actioned scope separates it from executable leaves; the artifact's health is that measure trending toward zero.
- Propagate completion up the edges. A leaf's completion satisfies its parent; a fully-satisfied parent satisfies its own parent, carrying done-ness to the root without re-deciding anything.
Tuning parameters¶
- Leaf-readiness bar — how concrete a node must be to count as a leaf. A high bar yields truly executable tasks but a deep tree; a low bar leaves "tasks" that still need planning.
- Roll-up rule per node — whether a parent needs all children, a quorum, or a weighted share complete to be marked achieved. All-children is safe but brittle; partial roll-up tolerates slack but can declare victory early.
- Branching width — how many subgoals a goal spawns. Wide trees parallelize ownership but strain coordination; narrow trees are legible but slow.
- Progress metric — what "remaining scope" is measured in: open leaves, un-funded budget, calendar distance. The choice changes which stalls the tree surfaces first.
- Refresh cadence — how often completion is propagated and the tree redrawn. Frequent roll-ups keep status honest but add reporting overhead.
When it helps, and when it misleads¶
Its strength is that it makes an overwhelming goal both actionable and trackable in one artifact: the downward read hands people concrete tasks, and the upward read shows, at any moment, how far the whole has progressed toward the root. It is the structure behind means-ends analysis — reducing the distance between where you are and the goal by recursively addressing sub-distances.[n1]
Its failure mode is recombination failure disguised as completion: the roll-up assumes that satisfying every child satisfies the parent, but if the children interact — two retrofits that compete for the same crew, subgoals whose benefits are not additive — then a parent can show "all children done" while the goal is not actually achieved. The classic misuse is treating the tree as a status dashboard where marking leaves green is mistaken for real progress, so a plan looks 90% complete while the hardest integrating goal remains untouched. The guarding discipline is to keep the leaf-readiness bar honest (a leaf that still needs planning is not a leaf) and to reserve explicit integration goals as their own nodes rather than assuming child completion sums to the parent.
How it implements the components¶
base_case— the action-ready leaf: a task concrete enough to execute directly, where decomposition stops.progress_measure— the remaining un-actioned scope tracked at each node, whose trend toward zero shows the plan converging.result_propagation_path— the tree's edges, along which a completed leaf's done-ness travels up to satisfy parent goals to the root.
It does not bound each node by an external standard or validate leaves against a burden of proof (subproblem_boundary, leaf_case_validation), and it recombines by propagating completion rather than by applying a governing rule (recombination_rule) — that evidentiary, rule-bound discipline is Legal Issue Tree's.
Related¶
- Instantiates: Recursive Problem Decomposition — the artifact that holds a goal's recursive breakdown and rolls executed leaves back into it.
- Consumes: Hierarchical Task Decomposition — the downward expansion method that populates the tree with subgoals and leaves.
- Sibling mechanisms: Divide-and-Conquer Algorithm · Legal Issue Tree · Recursive Delegation Protocol · Recursive Design Breakdown · Fault Tree Analysis
Editorial Notes¶
Form Classification¶
Form family: Representation, Specification & Plan
Rationale: Recursive Planning Tree operates as a static representation, map, specification, schema, or prospective plan that externalizes information because it a tree representation of a goal, its nested subgoals, and the action-ready leaves that execute them, whose edges carry each leaf's completion back up to mark parent goals achieved.
Independent corroboration: The frozen evidence defines Recursive Planning Tree as 'A tree representation of a goal, its nested subgoals, and the action-ready leaves that execute them, whose edges carry each leaf's completion back up to mark parent goals achieved', so its operative form is Representation, Specification & Plan.
Review outcome: Independent reviewer agreement; high confidence.
Origin Attribution¶
Primary origin: Computer Science & Software Engineering
Origin pattern: Cross-disciplinary synthesis
Present-day reach: Multi-domain
Rationale: Hierarchical task-network and AI planning explicitly decompose goals into compound subgoals and primitive executable tasks; operations and work-breakdown planning are companion lineages.
Related originating lineages:
- Operations Research — Hierarchical planning and project-network methods independently structure nested goals and completion.
- Organizational & Management Science — The organizational_management lineage materially shaped Recursive Planning Tree through governance, incentives, workload, and coordinated decision practice.
Review resolution: The blind reviewers disagreed on primary lineage. Light authoritative research resolves the defining form in favor of computer_science: Hierarchical task-network and AI planning explicitly decompose goals into compound subgoals and primitive executable tasks; operations and work-breakdown planning are companion lineages. The rejected primary is retained only when it materially shaped the mechanism, and present-day breadth is recorded separately as domain_reach=multi_domain.
Review outcome: Researched adjudication after independent review; high confidence.
Sources consulted:
Notes¶
[n1] Means-ends analysis is the problem-solving strategy formalized in Newell and Simon's General Problem Solver: reduce the difference between the current state and the goal by finding an operator (or subgoal) that shrinks it, recursing on any preconditions. A planning tree is its persisted, inspectable form. ↩