Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Exploring a wide range of design options is crucial for every sound conceptual design process. In the conventional structural design workflow, optimization techniques are generally employed to generate well-performing design options. However, focusing only on performative criteria may result in a lack of design exploration and diversity, narrowing down the design brief too early and neglecting essential aspects beyond pure performance. In response, this paper introduces a new method for the generation of structural forms that emphasizes both performance and the exploration of a diverse set of design briefs. The method employs layout optimization in a new way and aims to find close-to-optimal yet diverse structures. First, a parametric ground structure is generated. Second, this ground structure is used to produce a structure in equilibrium based on different user-defined goals. By varying ground structures and balancing the different goals, the method produces a series of designs that are both diverse and well-performing. The applicability of the method is demonstrated through several case studies. Results show that this method allows for the real-time generation of multiple design options, including both well-known and less well-known, but not less valid, typologies. Using this approach, designers can move beyond the limitations of established typologies and explore a new variety of structural forms.
Romain Christophe Rémy Fleury, Haoye Qin, Zhe Zhang, Ji Zhou, Bo Li