- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2(+1)
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
VIGOR studies industrial scene-program generation, distinguishing program executability from complete engineering feasibility of the executed layout. The authors construct a controlled benchmark with 1,749 constructible conditions, fixed sets of 11 instances, 94 geometric checks per scene, and additional structural checks. The system combines supervised program generation, local geometric projection, and residual conflict-graph-based joint repair while preserving parent and attachment relations. It achieves 96.86% complete feasibility; ablations support complementary roles for SFT and the two repair stages.
Critical strengths
- A controlled benchmark with explicit constraints and execution-validated references. Each retained condition has a complete reference program checked for execution, save–reload consistency, geometry, and structure. Interpolation and held-out parameter-combination tests provide a useful experimental basis for studying constraint satisfaction under changing layout conditions.
- Substantial empirical gains and evidence of complementary repair stages. Complete feasibility rises from 14.57% with SFT alone to 56.86% with local repair, 81.43% with joint repair, and 96.86% with both. These results support the practical value of staged repair and its complementarity with initial program generation.
Critical weaknesses
- The relative advantage of the proposed joint repair is not established. LayoutVLM jointly optimizes geometry and spatial relations; Procedural Scene Programs coordinates objects through shared parameters and structure-preserving program search; Global Graph-Validated Optimization combines relational verification with global–local optimization. These works are cited but not directly evaluated. The ablations establish that joint repair is useful within VIGOR, but there is no comparison that fixes the paper’s SFT model and local-repair outputs while replacing only the joint-repair module with an existing approach. The advantage of this particular repair strategy therefore remains unclear.
- Limited structural coverage weakens the benchmark’s case as a major contribution. All conditions share a fixed workspace, asset inventory, attachment structure, and reference operation pattern; variation primarily concerns aisle width, equipment clearance, boundary clearance, and aisle orientation. This controlled design is reasonable, but the tests mainly establish parameter generalization within one scene setting. The paper does not sufficiently establish broader diagnostic value or compare against its reference-construction pipeline or an independent constraint solver, leaving the added value of learned generation in this setting unclear.
- The core repair procedure is insufficiently specified for reproduction. Section 3.4 provides an objective and search framework, but does not adequately define successor generation, coordinated multi-object adjustments, or the actual search configuration. Search budgets and runtime are also unreported. These choices directly affect repair success and computational cost, making it difficult to reproduce the main results or assess the practical cost of the feasibility gains.
- Functional-quality evaluation lacks verifiable definitions, weakening the interpretation of the overall performance advantage. Appendix G.2 lists six scoring dimensions and their aggregation, without specifying their scoring rules, thresholds, or engineering basis. Calculated from Table 2 and Eq. (15), functional quality accounts for approximately 69% of the Overall gain over the strongest baseline (about 7.15 of 10.42 points). This omission therefore materially affects the main comparison. The reported LLM–human agreement concerns separate OU/SO visual ratings and does not directly validate these functional scores.
Questions for authors
-
With the paper’s SFT model and local-repair outputs fixed, are results available when only the joint-repair module is replaced by existing multi-object optimization or structure-preserving repair methods? Under the same adapted constraints and comparable computational budgets, what advantage does the proposed repair provide in complete feasibility, structural preservation, or runtime?
-
What diagnostic value and scope of applicability does the fixed-scene parameter benchmark establish? Are comparisons with the reference-construction pipeline or independent constraint solvers available to demonstrate the added value of learned generation in success rate, cost, or functional quality?
-
Please specify how N(z) generates successors, how multi-object adjustments are coordinated, and how the conflict graph is used and updated. What beam width and stopping budgets were used, and what are the per-scene runtime or verifier-call counts? How do feasibility and cost change with the search budget?
-
Please provide the explicit rules, thresholds, and engineering basis for all six functional scores in Appendix G.2, together with evidence of agreement with human functional assessments or practical requirements. Given that functional quality accounts for approximately 69% of the Overall gain, how do these definitions and validation support the interpretation of the overall advantage?
7 comments
Author Response to Reviewer uEmg (Part 2/3)
Q3. Joint-search moves, stopping rules, and computational cost (W3&Q3).
A3: Joint search is invoked only for executable layouts that remain infeasible after local repair (Eq. 4). Across all scenes, the L/J stages averaged 4.132 s per scene, excluding initial generation. On scenes that invoked J, that stage averaged 4.292 s, with a median of 319.5 verifier calls.
(1) Successors. J builds a graph connecting devices involved in residual conflicts and selects at most two connected components per state, prioritizing the most severe conflicts. Single-device translation, pair separation, coordinated displacement, and constrained rotation generate successors. Each successor is re-executed and verified, preserving previously satisfied parent and attachment relations. The graph is rebuilt from the resulting conflicts.
(2) Beam and stopping rules. Each expansion generates at most 60 candidates. The beam retains up to 16 states under Eq. (7), which first ranks layouts by violation count, then total and maximum normalized deficit. Functional score, number of modified devices, displacement, and a deterministic tie-breaker follow. Search stops when it finds a feasible layout, exhausts the candidates, or reaches a limit of 12 levels, 2,000 verifier calls, or 60 s. A replacement must improve the input objective and preserve attachments.
(3) Budget sensitivity. On the same 64 test tasks spanning different task types, raising the cap from 500 to 1,000 calls yielded two additional feasible layouts. Doubling it again yielded one more.
| J Search Budget | Complete Feasibility | Avg. Repair Runtime | Avg. Validator Calls |
|---|---|---|---|
| 500 | 50/64 | 2.680 s | 198.45 |
| 1,000 | 52/64 | 4.104 s | 299.98 |
| 2,000 | 53/64 | 5.658 s | 410.70 |
Across the full budget range, feasibility rose from 50/64 to 53/64 and mean repair time increased by 2.978 s. We will add the move set, stopping rules, and timing breakdown to Section 3.4.
Author Response to Reviewer uEmg (Part 3/3)
Q4. Definition, engineering basis, and sensitivity of the six functional scores (W4&Q4).
A4: Functional Layout averages six distance-based scores. We checked the Process Chain score against an obstacle-avoiding route length and tested all six scores for sensitivity to their thresholds.
(1) Scoring rules. All distances are horizontal and measured in metres. For process, tool, rack, container, and sign placement, the evaluator assigns full credit on a target interval and tapers linearly on either side.
\begin{cases} 0, & d\le a\\ \text{or}\\ d\ge e, \\\\ (d-a)/(b-a), & a<d<b, \\\\ 1, & b\le d\le c, \\\\ (e-d)/(e-c), & c<d<e. \end{cases}$$ With $C(d)=\operatorname{clip}((d-1.5)/1.5,0,1)$, the six scores are given by $$S_{\mathrm{process}} = 100T(d_p;1.2,1.5,2.0,3.0)$$ $$S_{\mathrm{tool}} = 100T(d_t;1.2,1.5,1.9,2.4)$$ $$S_{\mathrm{rack}} = 100T(d_r;0,2.0,3.0,4.0)$$ $$S_{\mathrm{container}} = 100T(d_c;0,1.0,2.0,3.0)$$ $$S_{\mathrm{desk}} = 50[C(d_{D1})+C(d_{D2})]$$ $$S_{\mathrm{sign}} = 50[T(d_{S1};0,1.5,3.0,4.5)+T(d_{S2};0,1.5,3.0,4.5)]$$ Here d_p measures the distance from the combined bounding region of the kit-tray station and automated guided vehicle (AGV) to the assembly table. d_t is the distance from the tool cart to the kit-tray station. d_r and d_c measure rack and container distances to the assembly table. The desk and sign each have two distances, one to the AGV and one to the robot proxy. The per-task score is the arithmetic mean of the six scores. Invalid or unscorable tasks receive zero and remain in the method average (Eq. 14). (2) **Engineering basis and route-length check.** CCOHS guidance on materials flow and workspace layout motivates short transfers and adequate operating space. OSHA 1910.176(a) addresses aisle clearance, HSE guidance addresses pedestrian–vehicle separation, and Directive 92/58/EEC addresses sign placement near hazards and in visible locations. These principles motivate the choice of measures. The numerical breakpoints are benchmark parameters, and sign distance measures proximity alone. On tasks where both methods produced feasible layouts, the mean obstacle-avoiding process-chain path was **2.360 m for VIGOR and 3.522 m for DeepSeek-V4.1-Flash + L/J**. Route length is measured separately from the six horizontal-distance scores. (3) **Contribution to Overall and robustness.** Eq. (15) gives one quarter of Overall to Q, the mean of Functional Layout, BQ-FQ, Interp-FQ, Comp-FQ, and Tight-FQ. Against the original Table 2 baseline, DeepSeek-V4.1-Flash without L/J, VIGOR gains **28.600 points on Q**. This contributes **7.150 of its 10.416-point Overall gain (68.64%)**. We varied each score’s thresholds by ±10% separately, then all six together, giving 14 perturbations. | **Metric** | **Original Improvement** | **Improvement under 14 Perturbations** | | ------------ | -----------------------: | -------------------------------------: | | Overall | +10.416 | **+9.083 \~ +11.075** | | Functional Q | +28.600 | **+23.268 \~ +31.235** | VIGOR retained an Overall lead of at least **9.083 points** across all 14 settings. We will add the score definitions, route-length check, and sensitivity results to Appendix G. We would be grateful if you would **reconsider your evaluation** in light of the controlled optimizer comparison and the robustness of the functional-quality results.
Author Response to Reviewer uEmg (Part 1/3)
We thank you for your detailed feedback on joint repair, the scope of the fixed-scene benchmark, search reproducibility, and the validity of the functional-quality evaluation.
Q1. Joint repair with a fixed generator and local-repair stage (W1&Q1).
A1: Joint repair raises Complete Feasibility by 10.00 percentage points over LayoutVLM, the strongest alternative in this comparison. All four pipelines start from the same fine-tuned generator and local-repair outputs. When local repair leaves a conflict, we replace only J with LayoutVLM, Procedural Scene Programs, or the graph-validated optimizer (GPFS).
All four methods used the same structural constraints and preserved the required structure in 99.71% of cases. The gain over LayoutVLM cost 1.581 s of additional mean repair time (4.292 vs. 2.711 s).
Q2. Diagnostic value of a fixed workspace under varying layout constraints (W2&Q2).
A2: Fixing the 7.5 × 7.0 m workspace and 11 required instances lets us test whether a generated program can satisfy all 94 geometric checks while preserving the required structure. The compositional split holds out combinations of aisle width and equipment clearance while retaining their individual values in training (Appendix C). In Table 3, the fine-tuned generator scores 92.79 on Geometry but achieves only 14.57% Complete Feasibility. With local and joint repair, feasibility reaches 96.86%.
(1) Reference constructor. Of 2,754 candidate conditions, the benchmark retained the 1,749 for which the constructor produced a verified layout. Its 100% test feasibility follows from this selection. Functional Layout measures the quality of the arrangement on those same conditions.
The constructor is faster and solves every retained test condition. VIGOR solves 96.86% and scores 1.46 points higher on mean Functional Layout (72.39 vs. 70.93).
(2) Variation within the workspace. We evaluated 24 conditions varying aisle width, equipment clearance, boundary clearance, and aisle orientation.
Both methods satisfied all constraints on all 24 conditions. VIGOR led by 16.79 points on Process Chain (58.18 vs. 41.39) and 0.87 on Functional Layout. This experiment tests the arrangement of the same equipment under different spatial requirements. Transfer to different factory footprints and asset inventories remains open.