Metraipolis › archive › dc_a3b577421a93

Constrained Goal-directed Planar Graph Generation with Grammar-based Reinforcement Learning — arXiv:2610.06244

Source
arXiv
Original
https://arxiv.org/abs/2610.06244
License (as archived)
CC0-1.0
Archived
2026-10-06T05:31:32.842Z
SHA-256 of the archived text
e232319d6ac41e81ddeb2833bfe15680a79a7b3c08bef10acddde1fc5d9cd704
Stable URL of this page
https://metraipolis.com/documento/dc_a3b577421a93

How to cite

Constrained Goal-directed Planar Graph Generation with Grammar-based Reinforcement Learning — arXiv:2610.06244 — arXiv, https://arxiv.org/abs/2610.06244 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a3b577421a93 (Metraipolis archive dc_a3b577421a93, sha256 e232319d6ac41e81ddeb2833bfe15680a79a7b3c08bef10acddde1fc5d9cd704)
BibTeX
@misc{dca3b577421a93,
  title = {Constrained Goal-directed Planar Graph Generation with Grammar-based Reinforcement Learning — arXiv:2610.06244},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.06244},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a3b577421a93; sha256 e232319d6ac41e81ddeb2833bfe15680a79a7b3c08bef10acddde1fc5d9cd704},
  year = {2026}
}

Archived text

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

Planar graphs are central to applications across science and engineering, yet existing generators provide limited support for goal-directed generation under hard structural and geometric feasibility constraints. We propose a dataset-free method for generating planar graph embeddings by combining parametric graph grammars with safe reinforcement learning to optimize generic task-specific objectives while satisfying constraints during construction. We formulate the generation process as a constrained Markov decision process, where the graph grammar defines the state and action spaces. We further introduce an action projection that maps sampled actions toward state-dependent safe sets, improving constraint satisfaction during training. In contrast to classical graph generators and deep generative models, which typically offer limited goal-directed control or rely on weak constraint satisfaction, our method constructs feasible planar graph embeddings directly during generation. We also introduce a benchmark suite for constrained and goal-directed planar graph generation, together with classical and deep generative baselines. Across all benchmark tasks, our method consistently outperforms baselines while satisfying the formulated constraints.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.06244 — 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-06T05:27:05.870Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).