分物问题的分法数计算

r个物品分配到n个盒子中,在不同的条件下会有不同的分法数。本文讨论了不同条件下,分法数的计算方法。     

任务分配方式优化问题研究

从军事指挥与管理工作的实际需求出发,利用概率论和军事运筹学理论,描述了统一、自主、混合等任务分配方式的概念、特点及其相互关系,论述了任务分配方式定量分析的基本方法、主要依据和基本指标,建立了完成任务效果的评估模型,在对多种任务分配方式进行定量比较的基础上,揭示了任务分配过程中具有普遍意义的、潜在的实用规则。     

地面目标特征识别与无人飞行器位姿估计

针对小型无人飞行器位置姿态估计问题,提出了一种基于视觉图像目标特征的相对位姿估计算法。应用Camshift算法获取目标初始位置,利用非线性尺度空间下的KAZE特征进行跟踪区域特征点提取,与源目标特征点进行匹配,得到精确的目标位置信息,实现了在图像平面内的目标快速跟踪,并得到机体轴系下无人飞行器与目标间相对位置和姿态角的估计值。对算法进行了实验验证,具有优良的跟踪性和实时性。     

无人机规避或跟踪空中目标的自适应运动导引方法

无人机规避或跟踪空中目标可以看作是一个非线性运动导引控制问题。针对这类任务中无人机和目标存在高机动性、高时敏性等特点,提出了一种基于Lyapunov稳定性理论的无人机规避或跟踪目标运动导引方法。构建了基于精细时间运动导引方法的无人机规避或跟踪空中目标问题求解框架,并将无人机碰撞规避和机动目标跟踪问题分别转化为到达虚拟目标点和与虚拟目标点交会的问题。针对碰撞规避问题,将其转化为实现平行导引的控制问题,基于Lyapunov稳定性理论设计了无人机碰撞规避导引律。针对机动目标跟踪问题,在碰撞规避基础上,根据目标点交会的要求设计了相应的目标跟踪导引律。在Gazebo平台上开展了仿真验证实验,实验结果表明:所提方法能够有效避免大过载情况的出现,并具有较强的时变和参数适应性。     

考虑浮绳联结的双无人船艇系统协同控制策略研究

针对青岛等海域浒苔泛滥成灾的问题,开展了由浮绳柔性连接两艘水面无人船艇构成的双无人船艇系统协同控制策略研究,通过双无人船艇系统清扫浒苔,并将其拖运至海岸.考虑系统中的无人船艇动力、浮绳力矩和水流产生的干扰力矩,建立了欠驱动无人船艇三自由度动力学模型,提出了基于距离的包含编队和跟踪两个模式的协同控制策略.双无人船艇系统作...     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014     

基于马尔科夫决策的目标选择策略

目标选择是军事计划的关键要素之一。基于马尔科夫决策方法,解决具有复杂目标间关联的多阶段目标选择问题。使用与或树描述目标体系各层状态间的影响关联,并以目标体系整体失效为求解目的,建立了基于离散时间MDP的多阶段打击目标选择模型。在LRTDP算法基础上提出一种启发式方法,通过判断从当前目标体系状态到达体系失效状态的演化过程中的可能资源消耗和失败概率,来提供对当前状态的评估值,该方法能有效排除问题搜索空间中不能到达体系失效目的的中间状态,压缩了由于目标间复杂关联而增长的巨大状态空间。用实验验证了该方法有效性,实验结果表明,该方法直观实用,对目标间具有复杂关联关系的目标打击决策有一定参考价值。     

Limiting behavior of the stochastic sequential assignment problem

The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

基于改进TOPSIS法和蚁群算法的反TBM目标群目标分配研究

基于改进的TOPSIS法和蚁群算法,以弹道导弹目标群为研究对象,研究了反导指控系统对目标群的目标分配问题。首先通过改进的TOPSIS法确定TBM目标群威胁排序并基于拦截排序准则确定拦截排序;其次使作战效能最大化,基于蚁群算法确定目标的最优分配方案;最后通过仿真实例验证了在考虑目标威胁值排序前提下采用此算法,可使目标群分配方案更加科学有效和符合反导作战实际。     

基于改进TOPSIS法和蚁群算法的反TBM 目标群目标分配研究*

基于改进的TOPSIS法和蚁群算法,以弹道导弹目标群为研究对象,研究了反导指控系统对目标群的目标分配问题。首先通过改进的TOPSIS法确定TBM目标群威胁排序并基于拦截排序准则确定拦截排序;其次使作战效能最大化,基于蚁群算法确定目标的最优分配方案;最后通过仿真实例验证了在考虑目标威胁值排序前提下采用此算法,可使目标群分配方案更加科学有效和符合反导作战实际。