Robust Topology Optimization Based on an Aggregated Linear System and Eigenvalue Analysis

  • NII Satoru
    Hiroshima Univ. Dept. of Transportation and Environmental Systems
  • TAKEZAWA Akihiro
    広島大学大学院工学研究院機械システム・応用力学部門
  • KITAMURA Mitsuru
    広島大学大学院工学研究院機械システム・応用力学部門
  • KOGISO Nozomu
    大阪府立大学大学院工学研究科 航空宇宙海洋系専攻航空宇宙工学分野

Bibliographic Information

Other Title
  • 縮約された線形システムを用いた不確定荷重に対するロバストトポロジー最適化

Abstract

This paper proposes a robust topology optimization method for a linear elasticity design problem subjected to an uncertain load. The robust design problem is formulated to minimize a robust compliance that is defined as the maximum compliance induced by the worst load case of an uncertain load set. Since the robust compliance can be formulated as the scalar product of the uncertain input load and output displacement vectors, the idea of “aggregation” used in the field of control research is introduced to evaluate the value of the robust compliance. The aggregation is applied to provide the direct relationship between the uncertain input load and output displacement using a small linear system composed of these vectors and the reduced size of a symmetric matrix in the context of a discretized linear elasticity problem using the finite element method. The robust compliance minimization problem is formulated as the minimization of the maximum eigenvalue of the aggregated symmetric matrix subject to the constraint that the Euclidean norm of the uncertain load set is fixed. Moreover, the worst load case is easily established as the eigenvector corresponding to the maximum eigenvalue of the matrix. The proposed robust structural optimization method is implemented using the topology optimization method, sensitivity analysis and the method of moving asymptotes (MMA). The numerical examples provided illustrate mechanically reasonable structures and establish the worst load cases corresponding to these optimal structures.

Journal

Citations (1)*help

See more

References(6)*help

See more

Related Projects

See more

Details 詳細情報について

Report a problem

Back to top