异构资源类型下多无人机任务分配

针对多无人机在执行侦察、打击任务的过程中携带任务资源的异构性,以及任务对于异构资源的要求,设计了一种改进的基于共识的捆绑算法(consensus-based bundle algorithm, CBBA)。考虑任务价值、任务执行时间窗以及航程代价等条件建立了多无人机对地目标侦察、打击任务分配模型。利用K-medoids聚类分析方法对多无人机进行基于距离和携带资源平衡的聚类,以解决多无人机对于异构资源类型的要求。对打击任务进行子任务生成,并利用改进后的CBBA求解所建立的任务分配模型,通过对比仿真实验验证了算法的可行性和有效性。     

大功率柔性互联设备的有功互济协调控制方法

针对以常规母联开关互联的交流电网线路变压器容量无法合理利用的问题,提出了依靠由背靠背电压源变流器组成的新型大功率柔性互联装置实现两侧交流电网有功功率互济的协调控制方法。介绍了新型柔性互联装置的拓扑结构与基本的控制原理,为实现两侧线路变压器容量合理的目标制定了一种生成有功功率参考的方法,并基于PSCAD/EMTDC搭建了一套仿真算例,对新型柔性互联装置的基本控制与所提出的有功互济的协调控制方法进行了验证。仿真结果表明,在柔性互联装置采用所提方法时能够实现两侧交流线路的有功功率互济,解决了线路变压器容量无法合理分配的问题。     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

New heuristic methods for the capacitated multi‐facility Weber problem

In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?_p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

分层任务网络在UCAV规划中的应用

无人战斗机任务规划对提高它的生存能力、突防能力、作战效能具有重要意义.分层任务网络规划是一个有效的规划方法,HTNP的最大好处在于,搜索受控于细心设计的方法.在某种意义上讲,一个HTN规划器只描述了如何使用操作,给实际使用带来了困难.在HTNP中引入目标协调机制、禁忌表等,将原有"离线"式方法变为"在线"式方法,提高了方法的适应性能.可以根据情况的变化,随时生成新的规划,降低了预先设计方法的数量,从而降低工程实施的难度.     

任务分配问题的对称群方法

探讨了无人飞行器(UAV)编队的任务分配问题。任务分配是UAV协同控制的基础,其解是任务区域内各任务的一个排列。求解UAV任务分配问题的有效方法是能在合理的计算时间内找到近似最优解的启发式算法。用对称群描述UAV任务分配的搜索空间,基于右乘运算构造搜索邻域。仿真结果验证了群论禁忌搜索算法的有效性。     

区域防空导弹反导火力分配研究

分析了传统防空导弹火力分配模型的不足,考虑到编队内各舰艇近程防空作战能力的不同,结合装备性能特点,建立了基于机会约束规划的区域防空导弹火力分配优化模型。给出了基于遗传算法和BP神经网络的混合智能算法,该算法在精度和速度上均能满足防空作战的要求。     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.