Metraipolis › archive › dc_7f817cd657d8

Real-to-Sim Generation: Synthesizing Scenario Programs from Real-World Data via Constraint Solving — arXiv:2609.23342

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.23342
License (as archived)
CC0-1.0
Archived
2026-10-09T22:41:49.046Z
SHA-256 of the archived text
ae622c298e05de47b2b8ae78d23847391579fee3ec57d1c66d7bb692c0ffcefc
Stable URL of this page
https://metraipolis.com/documento/dc_7f817cd657d8

How to cite

Real-to-Sim Generation: Synthesizing Scenario Programs from Real-World Data via Constraint Solving — arXiv:2609.23342 — arXiv (en), https://arxiv.org/abs/2609.23342 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7f817cd657d8 (Metraipolis archive dc_7f817cd657d8, sha256 ae622c298e05de47b2b8ae78d23847391579fee3ec57d1c66d7bb692c0ffcefc)
BibTeX
@misc{dc7f817cd657d8,
  title = {Real-to-Sim Generation: Synthesizing Scenario Programs from Real-World Data via Constraint Solving — arXiv:2609.23342},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.23342},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7f817cd657d8; sha256 ae622c298e05de47b2b8ae78d23847391579fee3ec57d1c66d7bb692c0ffcefc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23342. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The demand for synthetic training data is hindered by the sim-to-real gap, as current data-driven and LLM-based generators often produce physically implausible scenarios. To address this, we propose R2SGEN, a Real-to-Sim framework that synthesizes structured scenario programs from real-world data. To overcome the combinatorial explosion and intractability of monolithic Satisfiability Modulo Theories (SMT) encoding, we introduce a decoupled synthesis strategy. This approach separates the discrete structural program search from continuous geometric resolution using lightweight, atomic SMT constraints. Furthermore, we significantly accelerate the search process by integrating two tailored pruning mechanisms: Common Prefix Abstraction-based pruning for Breadth-First Search and Branch-and-Bound for Depth-First Search. We evaluate R2SGEN on 20 real-world scenes of varying complexity from the nuScenes dataset. Experimental results show that our method guarantees consistency with the input scene and produces substantially lower-cost programs than the LLM-based baselines under the evaluated inputs. Both proposed search paradigms exhibit complementary advantages, proving highly efficient and scalable for high-complexity synthetic data generation.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-22 in cs.PL).
Categorie arXiv: Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2609.23342 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T22:25:03.978Z dalla pagina https://arxiv.org/catchup/cs.PL/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).