多旋翼无人机减振分析与实验

针对多旋翼无人机机身系统振动过大导致飞行状态不稳的问题,基于有限元仿真技术与实验方法,进行了减振分析。通过频率分析,确定系统振动过大的原因为固有频率与激励频率耦合导致的共振现象,且共振频点的模态振型包含一阶挥舞、一阶摆振和二阶摆振振型。提出了优化机身壳体截面形状的设计方案,在不增加额外质量的情况下,将一阶挥舞、一阶摆振和二阶摆振振型对应的频点分别提高37.23%、22.47%和18.43%,有效规避了机身共振现象。仿真实验证明,提出的有限元仿真与实验结合的减振分析思〖BHDWG8,WK10YQ,DK1*2,WK1*2D〗〖XCMWL.TIF;%129%129〗听语音 聊科研与作者互动 路及优化设计方法,可为旋翼无人机减振设计提供参考依据。     

太阳电池阵组合基板模态参数分析的半解析模型

基于分布参数系统传递函数方法的基本理论,针对空间结构太阳电池阵的特殊结构形式,通过将太阳电池阵基板划分为条形单元,将基板间连接铰链副简化为均匀梁单元,并利用条形单元与梁单元公共结点间位移连续与力平衡条件,建立了空间结构太阳电池阵动力学特性分析的半解析计算模型。得到了太阳电池阵单块基板和多块组合基板的模态参数计算值,并将其计算结果与有限元结果进行了比较。     

基于邻域最优控制理论的中制导弹道簇生成

针对临近空间高超声速目标飞行速度快,跟踪预测难的特点,提出了在中制导阶段进行最优弹道设计与弹道簇生成用于对目标预测命中区域进行有效覆盖的方法。首先,通过分析临近空间高超声速目标对现有防空体系带来的挑战,阐明了在中制导段进行弹道簇设计与生成的必要性,其次,将中制导段的弹道规划问题视为求解满足多种约束条件下的最优控制问题,应用最优化理论方法得到了基准的最优弹道,再次,应用邻域最优控制理论,针对终端约束条件进行调整,设计了邻域最优弹道簇的生成算法。最后,通过仿真验证了所提方法的有效性。     

支板喷射超声速燃烧流场三维大涡模拟

利用火焰面模型和混合LES/RANS方法对某支板构型超燃冲压发动机进行模拟,讨论了化学反应对湍流流场的影响,并比较了3D和2D模拟的差别.结果表明,不考虑化学反应时剪切层中的大尺度结构控制着整个混合过程,且剪切层具有明显的三维特性;2D模拟能捕捉到涡的配对与合并现象,而3D模拟中涡的拉伸、扭曲及破碎特性更加显著;考虑化...     

降落伞主充气阶段数值模拟

建立了降落伞主充气模型。前体、伞绳及伞衣离散为一系列弹性连接的质量节点,伞衣内部流场为二维无粘、不可压流。利用模型计算了主充气阶段伞衣形状变化、伞衣投影面积变化及伞绳张力。计算结果与试验结果进行了比较,相当吻合。     

一种三自由度模型姿态调整机构的正反解分析

提出了一种三自由度模型姿态调整机构。采用回转矩阵方法分析了模型姿态与输入角度的关系,给出了机构的正解,结果表明模型姿态的三个自由度之间存在耦合关系,且表现出非线性。利用机构的运动特点,采用几何方法给出了反解,避免了数值解法的缺陷。     

A search game on a cyclic graph

There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Bivariate models from univariate life distributions: A characterization cum modeling approach

Bivariate life distribution models are of importance for studying interdependent components. We present a generic approach by introducing a new concept of characterized model in stead of a characterized distribution. It strikes a balance between characterization and modeling approaches to eliminate their individual limitations and incorporate their respective strengths. The proposed model, being a characterized one, admits many important properties irrespective of the choice of marginal distributions. The retention of univariate IFR, DFR, IFRA, DFRA, NBU, and NWU class properties in the bivariate setup has been ensured along with some results on series combinations and convolution. No other models, available in the literature, can ensure simultaneous retention of these fundamental and extremely important class properties. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Higher‐order Markov chain models for categorical data sequences*

In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004