Abstract
Traditional aerodynamic shape optimization methods usually suffer from difficulties in optimization and modeling for high-dimensional aerodynamic optimization problems. To overcome these difficulties, a new high-dimensional aerodynamic shape optimization framework is proposed from the perspectives of geometric domain decomposition for dimensionality reduction and a data-driven model support strategy for changing the role of surrogate model and assisting the optimizer. Geometric domain decomposition uses proper orthogonal decomposition to transform the high-dimensional Class-Shape Function Transformation method into low-dimensional geometric modes to reduce design dimensions for parameterizing the geometric shape, which reduces optimization and modeling difficulties. Also, a data-driven support strategy is proposed to improve the effectiveness and efficiency of the optimizer by learning from historical aerodynamic data; this strategy modifies the role of surrogate model in the optimization framework to assist the optimizer; the surrogate model, serving as an auxiliary role, can reduce the dependence on model accuracy, which overcomes the difficulty of high-dimensional modeling to some extent. We applied the developed framework to transonic drag reduction of wings to validate its performance. The optimization results show that the developed framework converges faster and offers better designs compared to direct optimization and state-of-the-art surrogate-based optimization frameworks for high-dimensional aerodynamic shape optimization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.