Spatial Assembly: Generative Architecture With Reinforcement Learning, Self Play and Tree Search
Not on the map. Why?
Abstract (arXiv)
With this work, we investigate the use of Reinforcement Learning (RL) for the generation of spatial assemblies, by combining ideas from Procedural Generation algorithms (Wave Function Collapse algorithm (WFC)) and RL for Game Solving. WFC is a Generative Design algorithm, inspired by Constraint Solving. In WFC, one defines a set of tiles/blocks and constraints and the algorithm generates an assembly that satisfies these constraints. Casting the problem of generation of spatial assemblies as a Markov Decision Process whose states transitions are defined by WFC, we propose an algorithm that uses Reinforcement Learning and Self-Play to learn a policy that generates assemblies that maximize objectives set by the designer. Finally, we demonstrate the use of our Spatial Assembly algorithm in Architecture Design.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 2 of its 10 references that are in the map. First posted on arXiv 19 Jan 2021.
Builds on
2 of 10 references.
References · 2
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2019Policy Gradient Search: Online Planning and Expert Iteration without Search Treescited by 11
Built on by
Not cited yet.