采用PWPF调节器的再入飞行器最优控制分配方法

针对具有反作用控制系统(Reaction Control System,RCS)和气动舵两类控制机构的再入飞行器,提出一种基于脉宽脉频(Pulse-Width Pulse-Frequency,PWPF)调节器的最优控制分配方法。将RCS的输入信号转化为连续变化量,RCS与气动舵的控制分配问题被描述为二次规划问题,并采用有效集方法对其求解。采用离散法和PWPF调节器将优化结果转化为RCS的开关机状态。与混合整数规划问题相比,连续二次规划问题更容易求解,计算速度更快。通过对二次规划问题的重构,该算法能有效地应对故障情况。     

一种新的基于粗糙集的连续属性离散化算法

粗糙集理论作为一种新的处理含糊和不确定性问题的数学工具,已成为国际学术界的一个前沿的研究领域.传统的粗糙集理论只能对数据库中的离散属性进行处理,而绝大多数现实的数据库既包含了离散属性,又包含了连续属性.针对传统粗糙集理论的这一缺陷,提出了一种改进的基于断点重要性的属性离散化方法.最后,通过实例分析说明该方法是有效的.     

基于前景理论的CGF Agent决策建模研究

前景理论(Prospect Theory,PT)描述了个体在不确定条件下的决策规律,较好地刻画了决策者的风险偏好。分析表明,PT在作战决策建模中具有一定的适用性和可行性。提出了一种基于PT的计算机生成兵力(Computer Generated Forces,CGF)Agent决策建模方法,给出了CGF Agent的建模框架,对CGF Agent决策过程中方案选择的具体步骤和算法进行了详细阐述。实验表明,所提出的方法在一定程度上提高了CGF Agent决策行为的真实性,证明了所提出方法的有效性。     

基于效能分析的工程建设投资分配模型研究

分析了基数滚动切块和层次分析-目标规划(AnalyticHierarchyProcessandGoalProgramming)投资分配模型的利弊,探讨了工程建设投资效能的估计方法,研究建立了基于效能分析的投资分配优化模型.该模型经实际算例分析证明,模型的思路清晰,便于理解和操作,具有较好的实用性.     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

MADM中不同属性的规范化研究

不同属性值的规范化是多属性决策问题中的重要过程.提出了一种属性值作为点到优区间和劣区间的距离的定义,依据该定义得到了属性值规范化新方法,并通过实例证明了新规范化方法的有效性.     

适用于认知无线传感器网络的高效频谱分配方法

广泛工作在ISM(Industrial,Scientific and Medical)频段的无线传感器网络面临严重的频谱稀缺问题。在无线通信中,动态频谱分配被认为是提高频谱效能的重要途径。针对典型集中式管理的认知无线传感器网络设计了基于图着色结合负载强度的高效频谱分配算法。首先在协议干扰模型下确保频谱资源在空间上充分利用,随后综合考虑节点负载强度与公平性建立优化模型并按照乘子法加拟牛顿法框架求解最优值。仿真实验表明算法与固定频谱分配方式和传统自适应频谱分配算法相比,在系统吞吐量和节点缓冲区队列长度两个关键性能指标上具有显著优势。     

基于OLAP技术的武警财务辅助决策系统构建探索

武警财务辅助决策系统是武警部队财务信息化建设的重要内容，在优化财务决策中发挥着不可估量的作用。OLAP技术具有为数据使用对象提供多维度视角和分析的特征，为财务辅助决策系统提供了重要的技术保障。通过对武警财务辅助决策系统的功能分析，提出运用OLAP技术构建武警部队财务决策系统的初步构想。     

基于改进遗传算法的油料调拨优化

为实现油料快速调拨运输，利用改进的遗传算法求解油料调拨优化问题，采用了一种受贪婪算法启发的新的交叉算子和变异算子，对比模拟退火算法等其他算法而言，具有较好的鲁棒性，能很好地解决油料调拨运输过程中多任务多地点的油料调拨运输问题。