检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西北工业大学力学与土木建筑学院振动工程研究所,陕西西安710072
出 处:《西北工业大学学报》2011年第4期581-586,共6页Journal of Northwestern Polytechnical University
基 金:国家自然科学基金(11072197);西北工业大学基础研究基金(JC201033);教育部博士点基金(20096102120024)资助
摘 要:针对区间参数压电智能桁架结构/控制一体化多目标拓扑优化设计问题进行研究。考虑的区间参数有普通杆件、压电作动杆及其连接杆的弹性模量、密度、杆件的截面面积、普通杆件的许用应力、压电作动杆所施加控制电压的限值,基于泰勒展开和区间扩张导出区间参数压电受控结构的开闭环特性,以结构和控制器的信息为设计变量,结构的质量和控制能量的上限为目标,满足结构杆件应力和控制系统电压的区间可能度约束条件,建立考虑拓扑的区间参数压电智能桁架结构/控制一体化多目标优化模型。优化求解策略采用基于Pareto排序的求解有约束的多目标遗传算法。数值算例验证了模型和方法可行性和有效性。Aim. The introduction of the full paper reviews some papers in the open literature and then proposes the research mentioned in the title. Sections 1 through 4 explain our application. The core of sections 1,2 and 3 consists of: (1)through Taylor expansion and interval extension of function, the interval values of the objective func- tions and the constraint functions can be obtained; (2) based on interval possibility degree, the integrated optimization mathematical model with stress and voltage constraints of piezoelectric smart truss is constructed; the upper bound of the structure weight and that of the quadratic objective function are taken as objective functions; the cross sectional areas of bars, nodal topological information, actuator placement, the number of actuators and control gain are regarded as design variables; (3) the Pareto CMOPGA (genetic algorithm for constrained multi-objective optimization problem) on the basis of individual ranking problem. Section 4 gives a numerical example, whose On the basis of the results of the numerical example, is adopted to solve the constraint multi-objective optimization results are presented in Figs. 5,6 and 7 and Tables 1 and 2. section 5 gives four preliminary conclusions.
关 键 词:压电智能桁架 区间可能度 多目标 一体化拓扑优化 遗传算法
分 类 号:O327[理学—一般力学与力学基础]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229