Prune-Then-Plan: A Decision Pipeline Pattern

• Prune-Then-Plan is a decision-making pipeline that first filters out infeasible, redundant, or low-value candidates before applying downstream planning or execution.
• It is applied across diverse domains such as hierarchical robotics, embodied question answering, public transport routing, and model compression, achieving measurable efficiency gains.
• Its effectiveness relies on well-justified, monotone pruning rules that drastically reduce the search space, enabling more focused and cost-effective planning.

Prune-Then-Plan denotes a family of decision-making pipelines in which a system first removes infeasible, low-value, redundant, or unsafe candidates and only then applies expensive planning, reasoning, or control to the remaining set. In the literature, this pattern appears in hierarchical robot manipulation, embodied question answering, tool-integrated reasoning, public-transport routing, embodied autonomous driving, structured pruning of vision-LLMs, and agricultural robotics. The pruning signal varies by domain—prefix-closed infeasibility, calibrated frontier rejection, transfer-duration bounds, hard token limits, or cut-target selection—but the recurring structure is a separation between a filtering stage and a downstream planner or executor (Noseworthy et al., 2021, Frahm et al., 24 Nov 2025, Rohovyi et al., 13 Mar 2026).

1. Core structure of the paradigm

Across the cited works, pruning precedes a second-stage procedure that is costlier, more brittle, or both. In manipulation, candidate abstract action sequences are filtered before motion planning and execution; in embodied exploration, implausible frontiers are rejected before a coverage-based planner selects a navigation target; in transit routing, outgoing transfers are scanned in sorted order and the remainder of the scan is terminated once they cannot improve the current target bound; in tool-integrated reasoning, failed tool-interaction segments are deleted before the model resumes reasoning; and in model compression, pruning is performed before or during adaptation so that the resulting policy reasons or plans more effectively under resource limits (Noseworthy et al., 2021, Frahm et al., 24 Nov 2025, Zhang et al., 11 May 2026, Rohovyi et al., 13 Mar 2026, Benfenati et al., 29 May 2026).

Domain	Pruning stage	Downstream stage
Abstract stacking (Noseworthy et al., 2021)	ISP and learned APF filter candidate plans and prefixes	PDDLStream/BiRRT motion planning and execution
EQA frontier exploration (Frahm et al., 24 Nov 2025)	Holm–Bonferroni inspired pruning rejects implausible frontiers	Nearest-frontier geodesic planner selects action
Public transport routing (Rohovyi et al., 13 Mar 2026)	Early stopping in sorted transfer scans discards longer transfers	RAPTOR-style route planning continues on survivors
Tool-integrated reasoning (Zhang et al., 11 May 2026)	STP, STPR, and RTTS prune failed tool traces	LLM resumes reasoning from a cleaned trajectory
Autonomous driving controllers (Benfenati et al., 29 May 2026)	RL-time structured pruning compresses controller modules	Closed-loop DecisionxR1→MPCxR1 planning proceeds with the pruned model
Orchard robotics (Liu et al., 14 Oct 2025)	Cut targets are fixed from labels and an AdTree model	Redundancy-aware motion planning executes the cuts

This suggests that Prune-Then-Plan is best understood not as a single algorithm but as an architectural pattern. The first stage imposes a structural constraint on what will be considered; the second stage spends computation only where the first stage predicts value or feasibility.

2. Hierarchical task-and-motion planning and abstract feasibility

In “Active Learning of Abstract Plan Feasibility,” an abstract plan is a finite sequence of abstract actions $a=(a_1,\ldots,a_n)$, and feasibility is a binary label $\phi \in \{0,1\}$ indicating whether the sequence can be realized by the low-level planner and executed successfully in the real world, including stability of each prefix tower. The core learned quantity is an APF predictor,

$p_\theta(\phi=1\mid a),$

implemented as an ensemble of GNN-based classifiers with

$$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$

The paper exploits the infeasible subsequence property,

$$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$

so that any candidate plan with a tested or predicted-infeasible prefix can be pruned before longer extensions are considered. It further introduces a sequential-subsequence model,

$$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$

which mirrors the prefix structure of stacking and supports ISP-aware active learning (Noseworthy et al., 2021).

The experimentation phase uses Bayesian Active Learning by Disagreement. With an ensemble approximation, the acquisition score is

$$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$

Among the candidate-generation strategies studied—Complete, Greedy, Sequential, and Incremental—the Sequential strategy explicitly weights later-step information by the probability that earlier steps remain feasible and therefore attempted. The downstream task-planning objective is

$$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$

and APF is used both to prune sequences below a threshold and to order promising candidates before invoking PDDLStream with BiRRT in PyBullet (Noseworthy et al., 2021).

Empirically, the paper evaluates the system in simulation and on a Franka Emika Panda robot with integrated perception, experimentation, planning, and execution. In simulation, Sequential $(\Theta_{ss})$ performs best and most consistently, reaching low regret on Tallest Tower after about 200 towers, while Complete performs worst and needs approximately 800 towers to reach decent performance for Tallest. On the real robot, 400 towers were built over approximately 55 hours using the Sequential strategy; the ensemble was initialized with 40 2-block towers labeled in simulation. In held-out evaluation, the learned model achieved Tallest Tower regret $0.15$ with $\phi \in \{0,1\}$0 stable towers, compared with $\phi \in \{0,1\}$1 and $\phi \in \{0,1\}$2 for the analytical model; Longest Overhang regret $\phi \in \{0,1\}$3 with $\phi \in \{0,1\}$4 stable towers, compared with $\phi \in \{0,1\}$5 and $\phi \in \{0,1\}$6 for the analytical model; and Maximum Unsupported Area regret $\phi \in \{0,1\}$7 with $\phi \in \{0,1\}$8 stable towers, compared with $\phi \in \{0,1\}$9 and $p_\theta(\phi=1\mid a),$0 for the analytical model. The paper states that the learned model captures real-world phenomena and generalizes across tasks, while also noting that no formal bounds on pruning efficiency or sample complexity are provided (Noseworthy et al., 2021).

3. Step-level pruning in embodied exploration and tool use

In embodied question answering, “Prune-Then-Plan: Step-Level Calibration for Stable Frontier Exploration in Embodied Question Answering” treats frontier choice as a calibrated multiple-testing problem. At step $p_\theta(\phi=1\mid a),$1, the agent observes frontier candidates $p_\theta(\phi=1\mid a),$2, computes token-level frontier confidences

$p_\theta(\phi=1\mid a),$3

normalizes them within the step,

$p_\theta(\phi=1\mid a),$4

maps them to p-values through an ECDF fitted on human-labeled bad frontiers,

$p_\theta(\phi=1\mid a),$5

and applies a Holm–Bonferroni step-down rule to keep only frontiers judged “not bad.” Final action selection ignores the VLM preference among the retained set and instead chooses

$p_\theta(\phi=1\mid a),$6

by geodesic distance on the occupancy grid. Integrated into 3D-Mem, this procedure improved OpenEQA/EXPRESS-Bench SPL from $p_\theta(\phi=1\mid a),$7 to $p_\theta(\phi=1\mid a),$8, LLM-Match/EAC from $p_\theta(\phi=1\mid a),$9 to $$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$0, coverage AUC from $$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$1 to $$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$2, and reduced curvature from $$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$3 to $$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$4. The paper reports relative improvements of up to $$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$5 and $$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$6 in visually grounded SPL and LLM-Match metrics over baselines, with approximately 5,500 labeled frontiers used for calibration and $$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$7 as the best overall strictness level on the EXPRESS-Bench tuning set (Frahm et al., 24 Nov 2025).

PruneTIR applies the same architectural idea to tool-integrated reasoning by editing the trajectory itself. A TIR trajectory is a sequence of reasoning, tool calls, and tool feedback, and erroneous tool calls are detected by a binary flag $$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$8. Three deterministic mechanisms are used. Success-Triggered Pruning retains the first successful resolution after an error while discarding intermediate failed repair turns; Stuck-Triggered Pruning and Resampling deletes a failed segment after a short turn limit and resamples a fresh tool call from the pre-error context; Retry-Triggered Tool Suspension appends a Manual Reasoning Prompt and disables tool use for one step after repeated stuck events. The paper uses a Turn Limit of $$\widehat{p}(\phi{=}1 \mid a; \Theta)=\frac{1}{N}\sum_{i=1}^{N} p(\phi{=}1 \mid a;\theta_i).$$9, Retry Limit of $$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$0, and decoding parameters temperature $$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$1, top-$$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$2 $$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$3, top-$$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$4 $$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$5. On AIME24 with Qwen3-8B, incorrect samples had mean erroneous calls $$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$6 versus $$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$7 for correct ones, and PruneTIR improved Pass@1 from $$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$8 to $$s \sqsubseteq \pi,\; s \notin F \Rightarrow \pi \notin F,$$9, reduced average tool calls from $$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$0 to $$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$1, reduced working context from $$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$2K to $$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$3K, and cut the Qwen3-8B P95 total tool-call count from $$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$4 to $$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$5. Comparable gains are reported on AIME25, BeyondAIME, and GPQA-diamond (Zhang et al., 11 May 2026).

A common feature of these two systems is that pruning is not the final decision rule. In EQA it produces a conservative frontier set for a coverage-based planner; in TIR it reconstructs a shorter, higher-signal trajectory from which the model resumes reasoning. The separation localizes error: a bad frontier that survives pruning incurs only a short detour if it is nearest, and a failed tool segment can be replaced without preserving the failure loop (Frahm et al., 24 Nov 2025, Zhang et al., 11 May 2026).

4. Budgeted reasoning and pruning-aware controller compression

ThinkPrune formulates long chain-of-thought compression as reinforcement learning under a hard token limit. For a trajectory $$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$6 and limit $$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$7, the reward is

$$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$8

so any unfinished thought or answer beyond the limit yields zero reward. The paper emphasizes that this differs from budget forcing: rather than truncating a long chain at test time, it trains the model to consolidate reasoning so that “the model can bypass unnecessary steps while keeping the core reasoning process complete.” Using an iterative pruning schedule such as $$\Pr(\Phi_{1:n}\mid a,\Theta_{ss})=\prod_{i=2}^{n}\Pr(\Phi_i\mid a_{1:i},\Phi_{1:i-1}=\mathbf{1};\Theta_{ss}),$$9, ThinkPrune reduced DeepSeek-R1-Distill-Qwen-1.5B AIME24 accuracy from $$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$0 to $$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$1 while reducing average tokens from $$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$2 to $$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$3, and reduced the average length across MATH500/AIME24/AMC23/OlympiadBench from $$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$4 to $$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$5 while slightly improving average accuracy from $$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$6 to $$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$7 (Hou et al., 2 Apr 2025).

Before Parc Fermé moves pruning into the SFT→RL pipeline of embodied LLM controllers for autonomous driving. BPF-RL prunes iteratively during RL after a warm-up; BPF-SFT/RL first prunes partially during SFT and then continues iterative pruning during RL. The implementation uses LLM-Pruner in structured mode with Taylor importance,

$$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$8

and evaluates compression by control adaptability, end-to-end latency, throughput, and memory footprint. On RobotxR1, BPF-SFT/RL achieved a size–performance trade-off of $$\mathrm{bald}(a;\Theta)=H\big(\widehat{p}(\phi{=}1\mid a;\Theta)\big)-\frac{1}{N}\sum_{i=1}^{N}H\big(p(\phi{=}1\mid a;\theta_i)\big).$$9B removed parameters per lost percentage point of adaptability at $$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$0, compared with $$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$1B for choosing the dense 1.5B model, which the paper summarizes as a $$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$2 better trade-off. On Jetson AGX Orin, pruning DecisionxR1 to $$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$3 reduced memory from $$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$4GB to $$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$5GB and improved decode throughput from $$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$6 to $$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$7 tok/s, or $$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$8. The paper also notes a central caveat: token-length increase after pruning can negate raw speed and memory gains in the cascade latency metric (Benfenati et al., 29 May 2026).

HiPP-Prune places the pruning decision itself at the level of a single global plan. A policy conditioned on a preference vector $$a^*=\arg\max_{a\in A}\mathbb{E}_{\Pr(\phi\mid a,\Theta)}[V(a)],$$9 outputs a global sparsity controller and a layer-wise allocation, yielding a pruning blueprint $(\Theta_{ss})$0 before any weights are removed. The policy state includes a visual sensitivity signal

$(\Theta_{ss})$1

derived from language-to-vision attention flow, and the plan is optimized by plan-level GRPO under a scalarized return combining hallucination robustness, task utility, and compression, with a SynFlow-inspired stability gate. Under matched sparsity and matched recovery, HiPP-Prune improved LLaVA-1.5-7B at sparsity $(\Theta_{ss})$2 from POPE balanced accuracy $(\Theta_{ss})$3 and ScienceQA $(\Theta_{ss})$4 for SliceGPT to $(\Theta_{ss})$5 and $(\Theta_{ss})$6; on Qwen2.5-VL-3B at approximately $(\Theta_{ss})$7 sparsity it achieved $(\Theta_{ss})$8 POPE and $(\Theta_{ss})$9 ScienceQA. The same trained policy can be queried with different preferences, for example $0.15$0 or $0.15$1, to shift the robustness–utility trade-off (Bai et al., 6 Mar 2026).

5. Search-space pruning in routing and repeated computation

“Learning to Prune: Speeding up Repeated Computations” gives a formal repeated-computation model in which a function $0.15$2 is solved over a sequence of instances, each instance has a unique smallest essential set $0.15$3, and the algorithm alternates between exploration on the full universe $0.15$4 and exploitation on the accumulated pruned set $0.15$5. With exploration probability schedule $0.15$6, the expected mistake bound is

$0.15$7

while the expected average subset size satisfies

$0.15$8

The paper also proves a lower bound showing that, in its model, the trade-off between inspections and mistakes is optimal up to constant factors. The framework is instantiated for shortest-path routing, string search, and linear programming; on real-map routing, the average nodes explored are reported as up to $0.15$9 smaller than Dijkstra on the full graph, with incorrect path rate $\phi \in \{0,1\}$00 over $\phi \in \{0,1\}$01 rounds, while on linear programming the incorrect-solution fraction is $\phi \in \{0,1\}$02 over $\phi \in \{0,1\}$03 rounds (Alabi et al., 2019).

“Early Pruning for Public Transport Routing” specializes the same idea to RAPTOR-style transfer relaxation. For each stop $\phi \in \{0,1\}$04, outgoing transfer edges are sorted by duration, and the scan is terminated as soon as

$\phi \in \{0,1\}$05

because all later transfers are at least as long and therefore cannot beat the current best arrival time at the target. The paper extends the rule to multicriteria labels $\phi \in \{0,1\}$06 by observing that arrival time, walking duration, and number of transfers are monotone non-decreasing under longer transfers. Early Pruning requires only one-time sorting of adjacency lists and a single if plus break inside the transfer loop. Across Switzerland and London, average query-time reductions over 1,000 random queries include RAPTOR on transitive graphs from $\phi \in \{0,1\}$07 to $\phi \in \{0,1\}$08 ms in Switzerland and $\phi \in \{0,1\}$09 to $\phi \in \{0,1\}$10 ms in London, McRAPTOR from $\phi \in \{0,1\}$11 to $\phi \in \{0,1\}$12 ms in Switzerland and $\phi \in \{0,1\}$13 to $\phi \in \{0,1\}$14 ms in London, and ULTRA-RAPTOR from $\phi \in \{0,1\}$15 to $\phi \in \{0,1\}$16 ms in Switzerland and $\phi \in \{0,1\}$17 to $\phi \in \{0,1\}$18 ms in London. The maximum reported speedup is $\phi \in \{0,1\}$19, and improvements correlate with transfer-graph density with Pearson $\phi \in \{0,1\}$20 and $\phi \in \{0,1\}$21 (Rohovyi et al., 13 Mar 2026).

These two works make explicit a recurring condition under which Prune-Then-Plan is exact rather than heuristic: the pruning rule must be monotone with respect to the downstream objective. In repeated computation the essential set only expands through exploration; in transit routing the sorted transfer list ensures that once the bound is crossed, all remaining candidates are provably worse (Alabi et al., 2019, Rohovyi et al., 13 Mar 2026).

6. Agricultural pruning as decision selection followed by motion planning

Autonomous orchard pruning uses the phrase in both a biological and a robotic sense. “Uncovering implementable dormant pruning decisions from three different stakeholder perspectives” separates a decision stage from an execution stage. Based on six stakeholders—two horticulturists, two growers, and two pruners—across Bing Cherries, Envy Apples, and Jazz Apples, the paper extracts a validated terminology set, three horticultural contexts, and seven pruning heuristics. The contexts are environmental management, crop-load management, and replacement wood. The reported heuristics include, for example, removing Bing Cherry branches growing Into the Interior or Out of the Row with thinning cuts at the base, prioritizing lateral branches longer than approximately 6 inches in Bing, using approximately 4-inch bud spacing in Envy apples, heading Jazz laterals to 4–6 inches with the bottom wire sometimes allowing approximately 8 inches, tipping Jazz spurs to achieve approximately 3-inch spacing, and removing Jazz secondary branches above 1.2 inches diameter while maintaining an approximately 6-inch no-prune zone for replacement wood. The dataset contains $\phi \in \{0,1\}$22 analyzed cuts across cultivars, and the tagged-tree study used 28 Jazz Apple trees with red, green, white, and orange markers to encode compactness, bud spacing, replacement removal, and no-prune zones respectively (Flynn et al., 2024).

“Automated Behavior Planning for Fruit Tree Pruning via Redundant Robot Manipulators” instantiates the second stage. Cut labels are derived from labeled point clouds, AdTree reconstructs a graph $\phi \in \{0,1\}$23 with cylindrical branch primitives, and cuts are generated by detecting transitions from “keep” to “remove” labels along the graph. Motion execution is then decomposed into a moving stage and an approaching stage. For each cut, the system samples a ring of approach and cut poses,

$\phi \in \{0,1\}$24

uses IKFlow to generate diverse inverse-kinematics solutions, evaluates them with

$\phi \in \{0,1\}$25

plans the approach with VAMP or RRT-Connect, and performs final insertion by position-based servoing,

$\phi \in \{0,1\}$26

On a Franka Emika arm, the real-world study reports 94 attempted cuts, planning success ratio $\phi \in \{0,1\}$27 ($\phi \in \{0,1\}$28), overall success ratio $\phi \in \{0,1\}$29 ($\phi \in \{0,1\}$30), and a failure breakdown of 25 planning failures, 15 execution collisions, 3 joint-limit violations, and 1 joint-velocity limit event. The paper attributes the main execution failures to AdTree modeling imperfections, especially missed or occluded small offshoots near the cut (Liu et al., 14 Oct 2025).

Taken together, these studies define an agricultural Prune-Then-Plan pipeline in which cut selection may be derived from stakeholder heuristics or labeled point clouds, while motion planning remains a separate redundancy-aware optimization problem. The first stage answers what to cut; the second stage answers how to cut it (Flynn et al., 2024, Liu et al., 14 Oct 2025).

7. Assumptions, limitations, and conceptual boundaries

Several formulations rely on a monotonicity-like assumption. In stacking, ISP is safe only in domains where feasibility is prefix-closed; if later actions can “fix” earlier instability, pruning can remove viable plans. In transit routing, correctness depends on sorted transfer durations and on the monotonicity of arrival, walking duration, and transfer count under longer transfer edges. In EQA, aggressive $\phi \in \{0,1\}$31 can over-filter viable frontiers, while conservative $\phi \in \{0,1\}$32 can retain too many options and leave most of the burden to the planner. The stacking paper also states that no theoretical bounds are given for pruning efficiency or sample complexity, and the EQA paper notes that a single ECDF across question types leaves room for category-specific calibration (Noseworthy et al., 2021, Rohovyi et al., 13 Mar 2026, Frahm et al., 24 Nov 2025).

In training-time pruning, compression can improve the performance–cost trade-off without guaranteeing a monotone latency reduction. ThinkPrune warns that an overly small token limit risks zero-reward collapse and performance loss, particularly when extensive derivations are required. BPF shows that token-length changes after pruning can dominate end-to-end cascade latency even when decode throughput improves. HiPP-Prune reports a remaining performance gap at extreme sparsity and does not provide ablations that remove the visual sensitivity cue or the SynFlow gate. In agricultural robotics, both the stakeholder study and the behavior-planning paper emphasize that perception and modeling errors remain central failure modes, whether in the form of unquantified qualitative vigor cues or missed small branches that cause collisions during approach (Hou et al., 2 Apr 2025, Benfenati et al., 29 May 2026, Bai et al., 6 Mar 2026, Flynn et al., 2024, Liu et al., 14 Oct 2025).

This suggests that Prune-Then-Plan is strongest when three conditions hold simultaneously: the pruning rule is structurally justified or calibratable, the downstream planner is materially more expensive than the pruning stage, and errors introduced by pruning are either safely bounded or recoverable. The cited literature spans exact pruning with formal guarantees, calibrated pruning with human-labeled supervision, and learned pruning embedded in RL or active learning, but in each case the central idea is the same: reduce the effective search or action space first, then allocate planning effort to the remainder (Alabi et al., 2019, Noseworthy et al., 2021, Frahm et al., 24 Nov 2025).