VIGOR: Verifiable Industrial Geometry Optimization and Repair in Scene Programs
Organizations: Qilu University of Technology, Jinan, China · Tianjin University, Tianjin, China · Shandong University, Jinan, China · Qilu University of Technology (Shandong Academy of Sciences), Jinan, China ·
Abstract
Large language models (LLMs) increasingly generate structured layouts and executable scene programs from natural-language instructions. However, executability does not imply engineering feasibility: an industrial scene program may execute successfully while its final state still violates coupled boundary, collision, clearance, aisle, or structural constraints. We identify this mismatch as the executability-engineering-feasibility gap, where locally plausible placements can remain globally infeasible because corrections to one device may introduce violations elsewhere. To make this gap measurable in a controlled setting, we construct an execution-grounded industrial scene-program dataset with 1,749 constructible scenarios, complete executable programs, and 94 final-state geometric checks per scenario. We further propose VIGOR, which combines supervised scene-program generation with execution-grounded verification and staged geometric refinement. Supervised fine-tuning establishes complete program generation, local projection resolves independently correctable violations, and joint conflict-graph repair coordinates residual multi-object conflicts while preserving structural relations. Experiments show that VIGOR achieves 96.86% Complete Feasibility and an Overall score of 91.20, outperforming the strongest evaluated baseline by 10.42 points in Overall. These results show that, under controlled industrial layout conditions, reliable scene-program generation requires not only executable programs, but also explicit verification and coordinated resolution of coupled engineering constraints.
Figures & tables
| Dataset statistics | Generation statistics | ||
| Statistic | Count | Statistic | Count |
| Candidate conditions | 2,754 | Scene instances | 19,239 |
| Final scenarios | 1,749 | Scene programs | 1,749 |
| Train / I / C | 1,399 / 175 / 175 | Program operations | 43,725 |
| Reference layouts | 1,749 | Geometric checks | 164,406 |
| Validated scenarios | 1,749 | Verified programs | 1,749 |
| Method | GVB | BG | Feas. | Func. | BQ-FQ | Interp-FQ | Comp-FQ | Tight-FQ | Overall | LLMJudge |
| Open-weight Models | ||||||||||
| GLM-4-9B-0414 ( Z.ai, 2025 ) | 11.30 | 34.96 | 0.00 | 53.28 | 24.53 | 54.56 | 52.00 | 49.72 | 27.07 | 1.975 |
| Qwen3-14B ( Yang et al., 2025 ) | 15.47 | 44.48 | 0.00 | 40.78 | 24.15 | 42.81 | 38.75 | 42.74 | 25.46 | 3.225 |
| Gemma-3-12B-IT ( Gemma Team et al., 2025 ) | 38.21 | 0.65 | 0.00 | 29.87 | 6.25 | 29.71 | 30.03 | 19.45 | 13.27 | 0.325 |
| DeepSeek-Coder-V2-Lite-Instruct ( DeepSeek-AI, 2024 ) | 80.84 | 0.00 | 0.00 | 2.65 | 0.00 | 3.06 | 2.23 | 3.46 | 2.32 | 0.300 |
| Granite-3.3-8B-Instruct ( IBM Granite Team, 2025 ) | 44.25 | 11.01 | 0.00 | 11.58 | 0.00 | 11.68 | 11.47 | 15.61 | 10.51 | 1.225 |
| Method | Geometry | Functional | Feasibility | Overall | LLMJudge |
| Base | 24.78 | 11.02 | 0.00 | 8.95 | 1.23 |
| Base + | 68.42 | 22.11 | 0.00 | 24.03 | 1.98 |
| VIGOR-SFT | 92.79 | 70.31 | 14.57 | 69.34 | 4.15 |
| VIGOR-SFT + | 97.76 | 70.37 | 56.86 | 81.18 | 4.10 |
| VIGOR-SFT + | 98.88 | 68.40 | 81.43 | 87.11 | 4.13 |
| VIGOR | 99.59 | 68.62 | 96.86 | 91.20 | 4.05 |
Appendix figures & tables3 assets
Supplementary material from the paper’s appendix.
Appendix
| Parameter | Values | Count |
| Main-aisle width | – m | 17 |
| Equipment clearance | – m | 9 |
| Boundary clearance | – m | 9 |
| Aisle orientation | , | 2 |
3D Scene Layout Generation
3D scene layout generation arranges objects and structures into coherent, controllable scenes from text, images, plans, or functional goals.
See all 80 papersGlobal Graph-Validated Optimization for VLM-based 3D Indoor Scene Generation
Roomer: Reflective Object-Grounded Model Editing and Repair for 3D Indoor Layout Synthesis
RoState'' and uses RoReview'' to bind measured violations to implicated objects. A geometry-conditioned vision-language model planner proposes a structured local edit, while a deterministic solver validates it and generates a finite set of candidate edits when needed. Each candidate is committed only if full-scene verification confirms that it resolves the target violation without new hard violations or broken protected constraints. We train the planner on Roomer-CC, a controlled-corruption dataset that pairs faulty layouts with object-grounded violation evidence and known-feasible inverse StatePatches. Since existing benchmarks rarely assess whether physically valid layouts are usable, we introduce Roomer-Eval to assess distributional quality, physical validity, and practical usability. Experiments show that Roomer repairs residual violations while preserving valid regions, improves physical validity and usability, and transfers across external generators.