滑模变结构控制的月球着陆舱姿态控制系统设计

在我国的探月计划中,要实现月球探测器软着陆于月球表面.在分析月球着陆舱软着陆段的飞行任务对于姿态控制要求的基础上,基于滑模变结构控制方法,根据实际姿态角和期望姿态角的偏差,给出了线性滑动模态面的切换方程,采用指数趋近律和边界层削抖的方法,推导出期望控制力矩的计算公式.并研究了姿控发动机的配置特点和点火逻辑.给出了由期望力矩计算实际控制力矩的方法.仿真结果表明,该姿态控制系统能迅速地将着陆舱跟踪到期望姿态.着陆舱经过514s飞行,在距月面2 km处将速度减为零,将姿态调整到垂直向下,完成了飞行任务.飞行轨迹比较平滑,具有较好的鲁棒性和自适应性.     

化学实验废液的危害及其处理方法

通过对不同化学实验产生的废液的分析研究,提出了一些简单易行的化学实验废液的处理方法,便于学生实际操作,可减少对环境的污染,有助提高学生的环保意识。     

单航天器无需变轨与Walker星座多星交会的充分条件及特性分析

以Walker星座为研究对象,对单航天器无需变轨实现多星交会的问题展开研究。从Walker星座相位同构特性出发,得到了单航天器无需变轨能够对多颗星座卫星交会的充分条件,对交会的星座卫星的数目和星座卫星组合等问题进行了研究。在此基础上,提出了利用解析法求解交会轨道的轨道设计方法,并对交会轨道的特性进行了分析。对交会更多星座卫星(大于3颗)的可能性展开了讨论。研究结果可为单航天器无需变轨对星座多星交会提供理论依据。     

Capacity investment decisions under risk aversion

This article studies the optimal capacity investment problem for a risk‐averse decision maker. The capacity can be either purchased or salvaged, whereas both involve a fixed cost and a proportional cost/revenue. We incorporate risk preference and use a consumption model to capture the decision maker's risk sensitivity in a multiperiod capacity investment model. We show that, in each period, capacity and consumption decisions can be separately determined. In addition, we characterize the structure of the optimal capacity strategy. When the parameters are stationary, we present certain conditions under which the optimal capacity strategy could be easily characterized by a static two‐sided (s, S) policy, whereby, the capacity is determined only at the beginning of period one, and held constant during the entire planning horizon. It is purchased up to B when the initial capacity is below b, salvaged down to Σ when it is above σ, and remains constant otherwise. Numerical tests are presented to investigate the impact of demand volatility on the optimal capacity strategy. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 218–235, 2016     

党的十六大与第四次机遇

社会发展需要社会成员的共同努力 ,同时也需要一定的历史机遇 ,回顾中国近代历史 ,机遇总是在不经意间错失。面对新的历史时期 ,机遇再次不期而至 ,要想抓住这次重要战略机遇 ,必须以史为鉴 ,与时俱进 ,开拓创新     

基于模型参考的SINS/GPS制导炸弹俯仰偏航控制

由于SINS/GPS制导炸弹俯仰偏航要进行大空域的机动飞行,导致了其作为被控对象的状态方程参数变化剧烈,就要求飞控系统具有更强的适应能力和鲁棒性.因此.设计了基于模型参考变结构控制方法的鲁棒自动驾驶仪,具有良好的瞬态性能和抗参数大范围变化能力强等优点.以某型SlNS/GPS制导炸弹为例.选取典型的气动恶劣条件,进行了按给定制导指令飞行的六自由度全弹道飞行控制仿真,仿真结果表明,该自动驾驶仪能对制导炸弹实现鲁棒自适应控制,为飞控系统设计提供了重要参考.     

多输出模型确认中的混合矩指标

在不确定性条件下,同时考虑到多维输出之间的相关关系和单输出的均值,构建由多输出数学期望列阵和协方差矩阵组成的多输出模型确认局部混合矩指标和全局混合矩指标。其中局部混合矩指标包括绝对指标(LA-3M)和相对指标(LR-3M),它们适合单点位置的多输出局部模型确认;全局混合矩指标也包括绝对指标(GA-3M)和相对指标(GR-3M),它们适合多点位置的多输出全局模型确认。通过数字算例和工程算例,所提指标可行有效,能够方便地度量计算模型和物理实验之间的差异程度。     

基于混合矩的多输出模型确认指标研究

针对随机不确定性条件下多输出计算模型与物理实验数据之间一致性难以量化度量这一问题,本文提出一组新的基于混合矩的多输出模型确认指标。在不确定情况下,同时考虑到多维输出之间的相关关系和单输出的均值,构建了由多输出数学期望列阵和协方差矩阵组成的多输出模型确认局部混合矩指标和全局混合矩指标。其中局部混合矩指标包括绝对指标(LA-3M)和相对指标(LR-3M),它们适合固定位置的多输出局部模型确认;全局混合矩指标也包括绝对指标(GA-3M)和相对指标(GR-3M),它们适合多点位置的多输出全局模型确认。通过数字算例和工程算例,并与PIT和t-pooling 面积指标进行对比,结果表明本文所提指标可行有效,能够方便地度量计算模型和物理实验之间的差异程度。     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017