一种变质心高速旋转炮弹鲁棒姿态控制律

针对采用变质心技术的高速旋转炮弹的姿态控制问题,提出一种基于扩张状态观测器的动态面控制方法。根据由弹体和单滑块组成的多体系统的特点,建立了系统的姿态动力学模型,并对其进行了合理的简化。将系统的滚转通道引起的强耦合、建模误差及外部扰动等视为未知不确定干扰,并且考虑由于炮弹尺寸限制而引起的多体系统控制输入(滑块位移)的有限性,设计了扩张状态观测器和辅助系统,分别对系统的干扰进行观测以及处理控制输入的有限性,综合动态面控制技术设计了姿态控制律,最后基于李雅普诺夫稳定性原理证明了控制器的稳定性。仿真结果表明,该控制器能够在克服干扰的前提下快速稳定地跟踪指令信号,具有良好的控制精度和鲁棒性。     

基于动态窗口的灰色加权填充算法及应用?

为解决复杂系统中单属性缺失数据填充困难问题,提出了基于动态窗口的灰色加权填充算法。该算法通过建立双向灰色预测模型,并采用模型精度评价系数加权填充缺失数据,有效增强了算法的准确性;提出基于灰色模型评价系数反馈的动态伸缩窗口概念,寻找产生最优模型的训练数据序列,使算法具有良好的鲁棒性和适应性。实验结果表明,该方法在RMSE和MA两项指标上均优于传统的双向灰插值、灰插值、多项式插值等方法。     

基于Multi-Agent技术的动态电磁环境建模与仿真

针对传统的电磁环境建模方法难以准确地描述电磁环境动态变化的问题,提出了一种基于Multi-Agent技术的动态电磁环境建模方法。首先分析了电磁环境建模的层次结构;然后建立了通信电台、雷达、侦察站、干扰站的Agent实体模型,建立了Agent行动模型和Multi-Agent系统交互模型,解决了个体Agent模型设计中的感知、动作、决策及实现方法上的问题。最后设置某仿真场景,利用Netlogo仿真平台建立仿真验证系统,仿真结果验证了模型的有效性,表明了应用Multi-Agent建模方法解决电磁环境的动态模拟的可行性。     

基于预设模板的系统动态构建与集成技术

针对动态变化的军事任务保障需求,以及信息系统构建过程中所面临的资源动态聚合、功能动态组合、环境动态适应等问题,基于网络化计算与存储环境,利用资源封装、软件仓储等技术,提出一种基于预设模板的信息系统动态构建与集成方法和过程,并通过构建基础环境和方向联指等应用实例开展试验验证,结果表明该方法可有效支撑军事信息系统的柔性组合,大幅提升系统开设效率。     

Nonlinear pricing with consumer satiation

In various scenarios, consumers may become satiated with products, and the degree of satiation is directly associated with their prior experiences. Confronted with consumer satiation, the seller is unable to either identify consumers who have a higher likelihood of being satiated ex ante or distinguish satiated from non‐satiated consumers ex post. Therefore, the seller should address dynamic selling, valuation uncertainty, and quantity decisions, all of which are important operational issues. We consider a two‐period problem in which consumer types are influenced by their prior consumption experiences. Faced with these consumers, the seller intends to optimize quantities and adjust the prices of the products in each period to maximize revenue. We find that the seller may reduce ex ante production quantity as some consumers become satiated. Moreover, the ex ante quantity is first decreasing and then increasing with regard to the satiation rate. Furthermore, two‐period information asymmetries may provide a rationale for upward distortion in quantity when consumer preferences are highly sensitive to first‐period consumption. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 386–400, 2016     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

Generation and storage dispatch in electricity networks with generator disruptions

We present methods for optimizing generation and storage decisions in an electricity network with multiple unreliable generators, each colocated with one energy storage unit (e.g., battery), and multiple loads under power flow constraints. Our model chooses the amount of energy produced by each generator and the amount of energy stored in each battery in every time period in order to minimize power generation and storage costs when each generator faces stochastic Markovian supply disruptions. This problem cannot be optimized easily using stochastic programming and/or dynamic programming approaches. Therefore, in this study, we present several heuristic methods to find an approximate optimal solution for this system. Each heuristic involves decomposing the network into several single‐generator, single‐battery, multiload systems and solving them optimally using dynamic programming, then obtaining a solution for the original problem by recombining. We discuss the computational performance of the proposed heuristics as well as insights gained from the models. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 493–511, 2015     

随机振动激励下自行火炮的合理车速

自行火炮的悬挂装置,在路面和履带激励下工作。剧烈的振动将影响自行火炮的机动性,根据路面谱的资料,建立了激励频率与车速的关系;利用模态分析的方法,对悬挂装置进行有限元动力分析,得到了悬挂装置的动态特性。从避免共振发生的原理,提出了自行火炮的合理车速。     

按Weibull分布计算滚动轴承的寿命和强度的可靠性

运用weibull分布推导出任意可靠性指标下滚动轴承的寿命和强度计算公式,给出了多列轴承和轴承系统的可靠性计算方法和公式,并按照工程的方法加以简化处理。     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.