The spatial layout design of sensory gardens involves the collaborative optimization of multiple design decisions. Traditional methods rely on manual experience and are inefficient in scheme exploration. This study proposes a diffusion generation model that integrates design grammar rules and conditional constraints to achieve end‑to‑end generation from land‑use conditions to complete layout schemes. A multi‑scale spatial feature encoder is designed to capture the spatial skeleton and element combination patterns of the garden through global‑ and local‑scale hierarchical coding and cross‑scale attention fusion. A conditional embedding module is constructed, in which hard constraints such as the land‑use red line and setback distance are encoded as differentiable vectors, and soft constraints such as visual permeability and spatial enclosure are encoded as differentiable vectors. A graph convolutional network is used to explicitly model the adjacency, inclusion, and axis relationships among design elements, and the topological prior is injected into the denoising process. The U‑Net backbone is improved, and a dual‑channel attention mechanism and a progressive refinement strategy are introduced to enhance structural awareness and boundary accuracy. Experiments are carried out on a dataset containing 200 cases, and ten indicators such as hard constraint violation rate, Fréchet distance, and spatial enclosure are used for evaluation. The results show that the hard constraint violation rate of this model is 2.3%, which is 84% lower than that of the standard diffusion model. The Fréchet distance is 8.7, and the spatial enclosure is 59.3%. All ten indicators outperform the four baseline methods such as LayoutGAN and LayoutVAE. The ablation experiment confirms the independent contribution of each core component, and the cross‑shape generalization and small‑sample experiments verify the adaptability and data efficiency of the model, which provided an effective method support for generative landscape design.
Jing Zhang· Journal of Discovery Core· 0 citations
In view of the urgent demand for rapid assembly and disassembly of temporary modular structures, this paper proposes a parametric generation algorithm that places disassembly feasibility as a core constraint of scheme generation, prior to the verification stage at the end of design. A linkage representation system for geometric, interface, and logic parameters is established, and the feasible region of parameters is defined by the non‑interference disassembly criterion and the connection reuse threshold as hard constraints. On this basis, a hierarchical cooperative strategy for macro‑topology generation and micro‑parameter optimization is proposed, and two‑way information transfer between the two levels is realized via a differentiable surrogate model. A reversibility‑guided reinforcement learning reward function is designed to enable the generator to evaluate the blocking risk of an action on the subsequent disassembly path in real time during the module‑by‑module addition process. A dynamic connector adapter is developed to adaptively match connector parameters according to local stress distribution. Experiments show that, compared with the standard GNN benchmark in three typical temporary scenarios, the algorithm reduces disassembly time by 24.2%-27.2%, the constraint satisfaction rate reaches 93.2%, and the connection reuse rate increases to 86.4%, and the structural safety margin is maintained in the range of 0.38-0.52. The significant advantages of the proposed mechanism in the co‑optimization of disassembly efficiency and structural performance are verified.
Jing Zhang· Journal of Digital Frontier· 0 citations