共查询到20条相似文献,搜索用时 78 毫秒
1.
2.
3.
基于BP神经网络的U型电热微致动器仿真分析 总被引:1,自引:1,他引:1
以BP神经网络、随机有限元法为基础,对u型电热微致动器进行了仿真分析.首先利用有限元分析软件ANSYS对u型电热微致动器进行有限元分析得到具体结构尺寸对微致动器最大位移的影响,然后通过建立的BP神经网络来拟合响应与输入之间的关系,根据蒙特卡罗模拟原理获得足够多的样本值对训练后的网络进行误差分析,结果证明本文提出的分析方法是可行有效的. 相似文献
4.
5.
为实现微隔振平台的自适应控制,设计了具有驱动和传感功能的第三代压电致动器,针对其直接应用于微隔振系统隔振效果不是很理想的现状.从理论上分析了导致结果不理想的原因,提出一种改进方法,通过理论建模分析和试验研究,结果表明:该方法虽然降低了致动器位移增益.但具有较好的隔振效果. 相似文献
6.
7.
提出了一种锆钛酸铅(PZT)薄膜微致动器的结构模型。该致动器采用高d33特性的压电陶瓷材料,用于对空间谐振式微光机电(MOEMS)陀螺微镜进行位移和角度的精确定位。建立了该致动器的简化模型并利用有限元方法分析其驱动能力。结果显示,当采用双层结构的PZT薄膜微致动器时,在外加电压50V作用下,环形PZT位移控制器中心位移可达到0.345μm;十字形角度控制器偏转角度可达3.29″,增加PZT薄膜的层数可以进一步增加致动器对微镜位移和角度的控制能力。通过对仿真结果进行分析可以得出结论,选用多层PZT薄膜材料制成的微致动器能够满足调整微镜位移和角度所需的范围和精度要求。 相似文献
8.
9.
设计了一种基于模糊PID控制器和超磁致伸缩致动器的车削振动主动控制系统,推导了超磁致伸缩致动器和专用刀架的数学模型,并在Matlab环境下进行建模仿真,当振动频率在50~100Hz时,仿真结果表明该控制系统能抑制振幅达50%以上;在现场车削试验中,以普通45#钢为车削工件,分别在转速1 500r/min、车削深度为0.07mm和转速3 000r/min,车削深度为0.04mm下,对车削振动进行主动控制,结果证明所设计的车削振动控制系统能够抑制振动幅度达30%以上。 相似文献
10.
11.
设计了一种电热微驱动器,根据几何关系、泰勒公式和材料力学求得偏置层结构末端的位移公式,并验证了采用镍作为偏置层材料的合理性.通过Coventorware软件中的有限元模块进行仿真分析,得出施加驱动电压为5 V,响应时间为5 ms,驱动器的初始温度为300 K时,得出偏置层宽度W1与驱动器位移d的曲线关系.通过验证驱动器的最大应力为235 MPa,小于镍的许用应力,确定驱动器在W1=20μm可以进行可靠的工作.分析偏置层厚度和宽度的加工误差对驱动器末端位移的影响,可得在对偏置层进行加工时要严格控制偏置层厚度H1的加工误差. 相似文献
12.
Chun‐Wen Paul Huang Atef Z. Elsherbeni Charles E. Smith Po‐Leng Chin 《国际射频与微波计算机辅助工程杂志》2002,12(2):148-158
Ribbon cables have been widely used as subsystem interconnections in a large number of digital systems, because they can convey numerous bits of a digital signal simultaneously. In this article, finite difference and finite difference time domain (FDTD) methods are used to analyze and optimize the electrostatic analysis design of ribbon cables, and measurements are used to verify the numerical results. © 2002 Wiley Periodicals, Inc. Int J RF and Microwave CAE 12: 148–158, 2002. 相似文献
13.
In the high-performance IC design with increasing design complexity,it is a very important design content to efficiently analyze IC parameters.Thus,the electro-thermal (ET) analyses including power/ground (P/G) analysis and thermal analysis are hot topics in today’s IC research.Since ET analysis equation has a sparse,positive definite and strictly diagonally dominant coefficient-matrix,we prove that the ET analysis has the advantage of locality.Owing to this advantage,localized relaxation method is formally proposed,which has the same accuracy as the global relaxation done with the constraint of the same truncation error limitation.Based on the localized relaxation theory,an efficient and practical localized successive over-relaxation algorithm (LSOR2) is introduced and applied to solve the following three ET analysis problems.(1) Single-node statistical voltage analysis for over-IR-drop nodes in P/G networks;(2) single-node statistical temperature analysis for hot spots in 3D thermal analysis;(3) fast single open-defect analysis for P/G networks.A large amount of experimental data demonstrates that compared with the global successive over-relaxation (SOR) algorithm,LSOR2 can speed up 1-2 orders of magnitudes with the same accuracy in ET analyses. 相似文献
14.
15.
在复杂度日益增高的高性能集成电路设计中,高效的性能分析是一项重要的设计内容,其中由电源线/地线网络(P/G)分析与芯片热分析构成的电热分析则是目前研究的热点问题.针对电热分析方程所具有的大规模稀疏(电导或热导)系数矩阵,根据该系数矩阵所具有的对称正定严格对角占优等特性,本文从理论上证明了电热分析具有局部性,在相同的截断误差限松弛结束条件下,局部松弛和全局松弛具有相同的松弛精度.基于局部松弛理论,本文提出了一个高效实用的局部过松弛(SOR)算法(LSOR2),并在文章最后将其用于如下的3个具体的电热分析问题研究:(1)P/G网中的过压降点电压变化统计分析;(2)3D热分析中的过热点温度变化统计分析;(3)单开路故障下的P/G网快速分析.实验数据表明:与全局SOR算法相比,在保证精度的前提下,LSOR2算法可以将电热分析的求解速度提高1-2个数量级. 相似文献
16.
Giuseppe C. Calafiore Fabrizio Dabbene 《Structural and Multidisciplinary Optimization》2008,35(3):189-200
Many real-world engineering design problems are naturally cast in the form of optimization programs with uncertainty-contaminated
data. In this context, a reliable design must be able to cope in some way with the presence of uncertainty. In this paper,
we consider two standard philosophies for finding optimal solutions for uncertain convex optimization problems. In the first
approach, classical in the stochastic optimization literature, the optimal design should minimize the expected value of the
objective function with respect to uncertainty (average approach), while in the second one it should minimize the worst-case objective (worst-case or min–max approach). Both approaches are briefly reviewed in this paper and are shown to lead to exact and numerically efficient
solution schemes when the uncertainty enters the data in simple form. For general uncertainty dependence however, the problems
are numerically hard. In this paper, we present two techniques based on uncertainty randomization that permit to solve efficiently
some suitable probabilistic relaxation of the indicated problems, with full generality with respect to the way in which the
uncertainty enters the problem data. In the specific context of truss topology design, uncertainty in the problem arises,
for instance, from imprecise knowledge of material characteristics and/or loading configurations. In this paper, we show how
reliable structural design can be obtained using the proposed techniques based on the interplay of convex optimization and
randomization. 相似文献
17.
The design, fabrication, and testing of a compact displacement accumulation device is presented in this paper. The piezoelectric device provides both large displacement (mm) and large force (100 N). The device is based on conventional inchworm motor design that produces large displacement. The device integrates piezoelectric stacks for large force output and high-speed operation with MEMS ridges as a new clamping system. The device should be able to push and pull 450 N at 11 mm/s in a relatively compact size. FEM analysis is used for the design, EDM is used for the fabrication of a prototype, and conventional test techniques are used to evaluate performance. Stress and modal analysis are used to confirm that the device has an infinite fatigue life and a first modal frequency at 1309 Hz. Experimental data for clamping strength of the ridges and blocking force of the device validate that the device transfers the required load of 450 N. The device is successfully tested over a wide range of operating conditions at speeds up to 11 mm/s using open loop control. The stall load of the device is measured to be exceeding 2250 N. For the dynamic loading test, the device pushes test weights up to 50 N with the open loop control approach. 相似文献
18.
Network-on-chip (NoC) is a paradigm shift for communication between cores in multi-processor systems. It has emerged as a solution for addressing the limitations of bus-based communication in multi-processor system design. The use of MPSoC (Multi-Processor System on Chip) based design of real-time safety-critical embedded systems (such as, Avionics, Automotive etc.) is really a challenge because of the requirement of time predictability and reliability of highest degree. Task mapping and flow priority assignment are two crucial steps for real-time NoC design. Most of the earlier work on priority assignment for on-chip communications are either based on exhaustive search or are heuristic in nature.In this paper, a search based explorative solution to the priority assignment problem has been proposed with a Genetic Algorithm (GA) based formulation that uses experimentally determined heuristics to converge faster with a better solution. Unlike other works in the area, proposed work considers the task execution time while assigning flow priorities. The paper proposes a combined priority assignment and task mapping solution. The approach has been validated with two real-time industrial applications - one from automotive domain, while the other one is from avionics. 相似文献
19.
20.
Joachim Pistorius & Michel Minoux 《International Transactions in Operational Research》2003,10(1):1-11
Algorithms described so far to solve the maximum flow problem on hypergraphs first necessitate the transformation of these hypergraphs into directed graphs. The resulting maximum flow problem is then solved by standard algorithms. This paper describes a new method that solves the maximum flow problem directly on hypergraphs, leading to both reduced run time and lower memory requirements. We compare our approach with a state–of–the–art algorithm that uses a transformation of the hypergraph into a directed graph and an augmenting path algorithm to compute the maximum flow on this directed graph: the run–time complexity as well as the memory space complexity are reduced by a constant factor. Experimental results on large hypergraphs from VLSI applications show that the run time is reduced, on average, by a factor approximately 2, while memory occupation is reduced, on average, by a factor of 10. This improvement is particularly interesting for very large instances, to be solved in practical applications. 相似文献