多UCAV协同作战自主任务规划系统

在分析未来多UCAV协同作战任务的基础上,构建了一个多UCAV协同作战的自主任务规划系统结构,探讨了其运行机制。提出这个系统的核心是自主规划器,它应该具有任务分解、智能信息处理和机载任务规划与重规划能力。设计了自主规划器的初步方案。指出了这个系统下一步研究的任务和方向。     

基于运输问题的国防动员任务规划模型研究

国防动员任务规划为执行动员保障任务提供明确的方案计划,是高效有序开展国防动员协同保障的重要前提和关键环节,既要综合考虑各类影响因素,又要确保对接结果适时、适量、适地、适度.本文分析了动员任务规划的现实问题,通过梳理实际开展动员任务规划的阶段步骤,明确了动员任务规划模型的研究内涵和边界;在此基础上,建立了国防动员任务规划...     

禁忌单亲遗传算法的某指挥控制舱协同任务规划

指挥控制舱是武器系统中指挥控制的功能核心,通过多人协同交互完成指控任务。为提高人员协同效率和操控效率。建立了以完成所有任务的时间最短为目标函数的多人协同任务规划模型。在求解模型时,采用禁忌单亲遗传混合优化算法,通过无性繁殖的方法,减少了在子代中产生无效染色体的情况,提升了算法的效率,通过禁忌算法有效避免陷入局部极小值。通过实例分析,算法使总任务执行时间减少了12豫。本模型以及求解算法在解决指挥控制舱多人协同任务规划时具有可行性,对指挥控制舱任务流程设计具有一定参考价值。     

Capacitated selection problem

Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types, and limits (capacity) are imposed on the number of each type that can be selected. The objective is to minimize the sum of penalty costs and resource costs. This problem has several practical applications including production planning, new product design, menu selection and inventory management. We develop a branch‐and‐bound algorithm to find exact solutions to the problem. To generate bounds, we utilize a dual ascent procedure which exploits the special structure of the problem. Information from the dual and recovered primal solutions are used to select branching variables. We generate strong valid inequalities and use them to fix other variables at each branching step. Results of tests performed on reasonably sized problems are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 19–37, 1999     

An approximate planning model for distributed computing networks

We develop an approximate planning model for a distributed computing network in which a control system oversees the assignment of information flows and tasks to a pool of shared computers, and describe several optimization applications using the model. We assume that the computers are multithreaded, and have differing architectures leading to varying and inconsistent processing rates. The model is based on a discrete‐time, continuous flow model developed by Graves [Oper Res 34 (1986), 522–533] which provides the steady‐state moments of production and work‐in‐queue quantities. We make several extensions to Graves' model to represent distributed computing networks. First, we approximately model control rules that are nonlinear functions of the work‐in‐queue at multiple stations through a linearization approach. Second, we introduce an additional noise term on production and show its use in modeling the discretization of jobs. Third, we model groups of heterogeneous computers as aggregate, “virtual computing cells” that process multiple tasks simultaneously, using a judiciously selected control rule. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

卫星对地观测任务全周期规划模型

为解决应急条件下卫星对地观测任务时间紧迫的问题,从卫星执行对地观测任务的全过程出发,提出了卫星对地观测任务全周期规划模型,综合考虑卫星完成任务的各个阶段,缩短整个任务的执行时间,使其满足应急条件下的时间需求。采用启发式算法求解,并研究了基于冲突队列的解的调整优化策略。实验验证所提的模型和算法能够较好地解决卫星对地观测任务规划问题,在时间紧迫的条件下与传统的各阶段的独立任务规划相比,能够提高任务的完成率,具有实际的应用价值。     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

公安边防部队遂行边境封控任务探究

边境封控行动事关国家安全和社会稳定大局,已成为新的历史条件下公安边防部队重要的职能和任务。分析公安边防部队边境封控行动的主要任务,探讨边境封控行动的特点和原则,提出公安边防部队边境封控行动的主要方法。     

基于改进快速扩展随机树的机械臂路径规划

针对机械臂路径规划问题,提出一种基于改进RRT算法的路径规划方法。改进RRT结合了目标偏置策略和贪婪生长策略的优点,在随机采样时,以一定概率使采样点偏置为目标节点,降低随机采样的盲目性,在目标节点方向上采用贪婪式扩展策略,增加随机树局部方向上的生长速度。RRT法规划路径结果并非最优,提出改进GPP法删除多余路径节点,优化机械臂运动路径。通过与Biased-RRT和Greedy-RRT数值仿真结果对比,证明了改进RRT在计算时间、迭代次数、扩展节点数上均优于以上方法。在机械臂两种典型工作环境中的仿真结果表明,使用该方法可以较好解决排爆机械臂避障路径规划问题。     

‘LAYERED RESPONSE’ TO AN AFRICAN CONFLICT

It is almost universally accepted that security is achieved by having a strong mititary. South African defence policy and practice is based squarely on such thinking. Yet this thinking can be challenged at a number of levels. In particular, it is not consistent with new thinking about security, in which territorial security is far less important, for example, than poverty and inequality; it is not consistent with present or conceivable future threats faced by the nation; and military expenditure hinders economic growth and thereby development. The article presents a number of alternative ways of achieving security that are, arguably, less costly and more effective than a conventional military. It concludes by sketching some or the broad features of a demilitarised society and some of the major tasks of demilitarisation. Chief among these will be to change the way people think about the military and security.     

快速部署机场指挥决策关键技术

针对快速部署机场指挥决策问题,分析了美军指挥决策技术发展现状,重点研究了快速部署机场指挥决策需要的态势感知、决策模型设计与优化、知识表示与存储、案例推理、综合业务信息查询、任务流程规划、模拟推演与效能评估、行动监视与动态干预、软硬件系统综合集成等9项关键技术及其相互之间的关系,指出任务规划是指挥决策过程的核心任务。最后分析了模型设计、案例推理、推演评估、3S技术等四个方面存在的主要技术应用难点。     

均衡聚类市场拍卖机制的异构无人机集群任务规划方法

针对大规模异构无人机集群的全局任务规划问题,提出一种基于均衡聚类市场拍卖机制的任务规划方法。对无人机群协同合作完成任务的场景进行分析,综合任务聚类和无人机联盟的优势,建立了通用性较高的任务规划模型。考虑到对无人机群负载均衡的需求,融合和改进了K-means聚类算法和市场拍卖机制,形成一种综合考虑路程消耗和任务消耗的均衡聚类市场拍卖算法。在拍卖过程中引入平衡参数,通过计算旅行商问题来修正平衡参数,保证无人机群在负载均衡的同时整体成本不断降低。仿真结果表明,使用均衡聚类市场拍卖机制的任务规划方法能够在较短时间内完成异构无人机群的复杂任务规划,保证无人机群负载均衡的同时,整体成本和总时间上也有较好表现,具有一定的实际应用价值。     

也谈期刊编辑选题策划

期刊编辑选题策划是编辑在信息传播过程中所从事的决策与设计性工作 ,它具有显著的特征 ,应遵循内在的原则。     

‘The People are Revolting’: An Anatomy of Authoritarian Counterinsurgency

Rather than win hearts and minds, authoritarian counterinsurgency is said to rely heavily on coercion. It has a reputation for effectiveness, if also for its amorality. Still, the research into authoritarian counterinsurgency is surprisingly lacking. By distilling common features from key cases, this article concludes that this approach goes beyond the indiscriminate violence that typically captures the imagination. Like their democratic counterparts but differently, authoritarian regimes also engage in mobilisation, create narratives, and turn military advantage into political gain. The analysis explains how these tasks are undertaken and, by contradistinction, sheds light on more liberal approaches as well.     

面向信息整合的军用数据中心研究

针对未来多样化军事任务对数据服务需求,在充分研究军用数据异构、分散存储、服务方式多样等现状的基础上,分析了数据应用的能力需求,提出了面向信息整合的军用数据中心技术架构与组成,阐述了该架构的特点以及关键技术,很好地解决了现有数据服务存在的问题,为未来军用数据工程建设奠定基础。     

卫星任务调度问题的约束规划模型

卫星任务规划与调度是空间资源管理的重要内容之一,其目的在于为卫星系统的任务计划编制提供科学合理的决策手段与依据。卫星任务调度问题的重要特点在于,调度任务存在可见时间窗口约束。只有在可见时间窗口内,调度任务才可能执行并完成。在进行合理假设的基础上,建立卫星任务调度问题的约束规划模型。对基本禁忌搜索算法进行改进,提出了模型求解的变邻域禁忌搜索算法。应用结果表明,约束规划模型的建立与求解是合理的。     

Risk‐sensitive sizing of responsive facilities

We develop a risk‐sensitive strategic facility sizing model that makes use of readily obtainable data and addresses both capacity and responsiveness considerations. We focus on facilities whose original size cannot be adjusted over time and limits the total production equipment they can hold, which is added sequentially during a finite planning horizon. The model is parsimonious by design for compatibility with the nature of available data during early planning stages. We model demand via a univariate random variable with arbitrary forecast profiles for equipment expansion, and assume the supporting equipment additions are continuous and decided ex‐post. Under constant absolute risk aversion, operating profits are the closed‐form solution to a nontrivial linear program, thus characterizing the sizing decision via a single first‐order condition. This solution has several desired features, including the optimal facility size being eventually decreasing in forecast uncertainty and decreasing in risk aversion, as well as being generally robust to demand forecast uncertainty and cost errors. We provide structural results and show that ignoring risk considerations can lead to poor facility sizing decisions that deteriorate with increased forecast uncertainty. Existing models ignore risk considerations and assume the facility size can be adjusted over time, effectively shortening the planning horizon. Our main contribution is in addressing the problem that arises when that assumption is relaxed and, as a result, risk sensitivity and the challenges introduced by longer planning horizons and higher uncertainty must be considered. Finally, we derive accurate spreadsheet‐implementable approximations to the optimal solution, which make this model a practical capacity planning tool.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling of stochastic tasks on two parallel processors

We consider the problem of scheduling n tasks on two identical parallel processors. We show both in the case when the processing times for the n tasks are independent exponential random variables, and when they are independent hyperexponentials which are mixtures of two fixed exponentials, that the policy of performing tasks with longest expected processing time (LEPT) first minimizes the expected makespan, and that in the hyperexponential case the policy of performing tasks with shortest expected processing time (SEPT) first minimizes the expected flow time. The approach is simpler than the dynamic programming approach recently employed by Bruno and Downey.     

基于扩展HTN规划的作战任务分析方法

任务分析是一个认识和了解任务本质的过程,作为作战计划拟制过程中的一个核心环节,作战任务分析的结论是否准确决定着作战计划的好与坏,并影响战争的结局。为了解决目前任务分析没有统一的标准及合适方法的问题,分析了层级任务网络(HTN)在任务分析中的不足之处,给出了OOR框架进行任务细化的方法和步骤,将其作为领域知识引入HTN规划,为任务分析提供了一个有效的方法,并设计了图元素用于表示任务树中任务之间的层级关系以及时序逻辑关系。最后以空间信息支援作战为例,验证了方法的可行性和有效性。     

基于效果驱动和探索性分析的作战能力需求生成方法

针对基于威胁和基于能力的作战能力需求研究存在的不足,在描述作战能力需求要素的基础上,提出了基于效果驱动和探索性分析的作战能力需求生成方法:通过作战目标及效果、作战行动及效果双重驱动,依次探索生成逻辑作战任务、作战能力、物理作战任务、任务条件和任务标准,将多元不确定威胁转化生成作战能力需求。此方法能有效综合作战指挥人员和军事需求人员的观点,其分析结果在实际应用中具有良好的适应性和健壮性。