检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:邓扬晨[1] 陈华[1] 章怡宁[2] 马明亮[3]
机构地区:[1]西北工业大学中法并行工程联合实验室,陕西西安710072 [2]沈阳飞机设计研究所,辽宁沈阳110035 [3]江西九江学院材料科学与工程学院,江西九江332005
出 处:《航空计算技术》2005年第2期1-5,共5页Aeronautical Computing Technique
基 金:航空科学基金(03B53003);辽宁省科学技术航空专项基金(20044007)
摘 要:旨在探讨新一代飞机翼面结构概念设计方法,并提供一种基于现代集成设计技术的、具有良好操作性的、用于飞机结构方案论证的新方法,本文采用模块化策略和三种手段相结合的思想作为技术途径,体现为将CAD、CAE和结构拓扑优化组合使用,以UG作为几何造型CAD平台,以AN-SYS作为CAE建模平台,利用作者提出的敏度阀值概念和约束补偿措施构造出一种拓扑优化新算法。以实际飞机型号作算例,结合“功能构件”与“非功能构件”概念,使得优化结果与真实的结构布局形式具有很好的一致性,这既验证了本文所建优化模型的合理性,又考核了该优化算法的有效性,也说明了文中提出的“概念设计方法”具有一定的实用性。从该方法的良好操作性可以预示出它对未来飞机翼面结构设计会具有较好的指导作用。In order to explore the conceptual design method about the new generation aircraft wing structure and to provide a based modern integrated design method with good operation for determining structural layout, authors utilized modular strategy and integrated thought with three means as technical way, which included CAD and CAE as well as structural topology optimization. Here we used UG as CAD platform, ANSYS as CAE platform. We presented a new algorithm through gradient threshold concept and a sort of constraint compensation technique. A practical aircraft wing was used as an example and optimal results were near the same as that of the practical one. The good results were partly due to utilization of 'functional component' and 'non-functional component' concepts. This phenomenon can be easily found from fig.9 and fig.11. By fig.9 and fig.15, we can reveal that this proposed model is reasonable. By fig.10 and fig.16, we can say that the new algorithm is effective and reliable. Through the research work above mentioned, we can draw a conclusion that this 'conceptual design method' has a kind of direction for aircraft wing structure designer.
关 键 词:飞机 机翼结构 概念设计 CAD/CAE 拓扑优化
分 类 号:V224[航空宇航科学与技术—飞行器设计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229