Shi, Feng, Soman, Ranjith K, Han, Ji 
ORCID: 0000-0003-3240-4942 and Whyte, Jennifer K
(2020)
Addressing adjacency constraints in rectangular floor plans using Monte-Carlo Tree Search.
Automation in Construction, 115.
p. 103187.
|
Text
An efficient approach to address adjacency constraints.pdf - Author Accepted Manuscript Download (1MB) | Preview |
Abstract
Manually laying out the floor plan for buildings with highly-dense adjacency constraints at the early design stage is a labour-intensive problem. In recent decades, computer-based conventional search algorithms and evolutionary methods have been successfully developed to automatically generate various types of floor plans. However, there is relatively limited work focusing on problems with highly-dense adjacency constraints common in large scale floor plans such as hospitals and schools. This paper proposes an algorithm to generate the early-stage design of floor plans with highly-dense adjacency and non-adjacency constraints using reinforcement learning based on off-policy Monte-Carlo Tree Search. The results show the advantages of the proposed algorithm for the targeted problem of highly-dense adjacency constrained floor plan generation, which is more time-efficient, more lightweight to implement, and having a larger capacity than other approaches such as Evolution strategy and traditional on-policy search.
| Item Type: | Article |
|---|---|
| Depositing User: | Symplectic Admin |
| Date Deposited: | 24 Apr 2020 11:17 |
| Last Modified: | 18 Jan 2023 23:53 |
| DOI: | 10.1016/j.autcon.2020.103187 |
| Related URLs: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3084577 |
Dimensions
Dimensions
