instantiated in the interactions between agents and the environment. In the context of generative design, agent-based models can enable decentralized geometric modelling, provide partial information about the generative process, and enable fine-grained interaction. However , the existing agent-based models originate from non-architectural problems and it is not straight-forward to adapt them for spatial design. To address this, we introduce a method to create custom spatial agents that can satisfy architectural requirements and support fine-grained interaction using multi-agent deep reinforcement learning (MADRL). We focus on a proof of concept where agents control spatial partitions and interact in an environment (represented as a grid) to satisfy custom goals (shape, area, adjacency, etc.). This approach uses double deep Q-network (DDQN) combined with a dynamic convolutional neural-network (DCNN).
| Authors | Pedro Veloso and Ramesh Krishnamurti |
|---|---|
| Year | 2020 |
| Venue | Proceedings of the International Conference on Education and Research in Computer Aided Architectural Design in Europe |
| DOI | 10.52842/CONF.ECAADE.2020.2.191 |
| Source Database | Seed (CumInCAD) |
| Bridge-to-GNN | Category Seed |
| GNN Architecture | Not yet extracted from PDF |
| Graph Encoding | 2D Drawing Graph (inferred from title) |
| AEC Task | Not yet extracted from PDF |
| Cohort | Early Infrastructure (2020–2021) |
| Key Hyperparameters | 26 hidden units (heuristic — verify) |
|---|---|
| Key Finding | method to create custom spatial agents that can satisfy architectural requirements and support fine-grained interaction using multi-agent deep reinforcement learning (MADRL) (heuristic — verify) |
| GNN architectures detected | Knowledge Graph Embedding (TransE/RotatE/DistMult) |
|---|---|
| Hyperparameters (regex-detected) | hidden_units=26 |
| Quality (heuristic, 6-flag) | 0/6 · rigor: Low Code/Data: —Benchmark: —Baseline: —CV/Split: —Ablation: —Reproducible: — |
Part of the GML/GNN in AEC Systematic Review (PRISMA 2020) — 112 papers, 2020–2026