基于MILP的多无人机对敌防空火力压制

建立了基于混合整数线性规划（Mixed Integer LinearProgram,MILP）的多无人机编队对敌防空火力压制协同任务分配模型,以0-1决策变量表征无人机一任务指派关系,引入连续时间决策变量来表示任务的执行时间,并通过对决策变量之间的线性等式和不等式的数学描述,建立无人机之间和无人机执行任务之间合理的协同约束关系。采用商用软件CPLEX对模型求解,仿真验证了模型的合理性。     

多基地多无人机协同侦察问题研究

 充分考虑侦察目标的侦察分辨率要求和侦察时间窗约束，以及位于不同基地的无人机(UAV)的侦察性能和可用数目，首次建立了更加贴近军事应用实际的多基地多UAV协同侦察问题(M-MUCRP)的数学模型，并提出了解决该模型的多基地多UAV协同侦察进化算法(M-MUCREA)。M-MUCREA的染色体数据结构有效地表达了问题的解，有利于交叉、变异等进化操作；充分利用与目标侦察分辨率要求以及目标位置和时间窗约束相关的启发信息，构造初始种群,避免进化过程收敛太慢；基于Pareto最优概念的选择算子确保解在多个目标上的有效优化；精英策略避免了丢失进化过程中产生的非劣解，加快算法收敛；变异和交叉算子在保证有效解的前提下，实现了解的多样性，避免了算法陷入局部最优。仿真实验验证了算法能够有效解决M-MUCRP。     

Satellite range scheduling with the priority constraint: An improved genetic algorithm using a station ID encoding method

Satellite range scheduling with the priority constraint is one of the most important problems in the field of satellite operation.This paper proposes a station coding based genetic algorithm to solve this problem,which adopts a new chromosome encoding method that arranges tasks according to the ground station ID.The new encoding method contributes to reducing the complexity in conflict checking and resolving,and helps to improve the ability to find optimal resolutions.Three different selection operators are designed to match the new encoding strategy,namely random selection,greedy selection,and roulette selection.To demonstrate the benefits of the improved genetic algorithm,a basic genetic algorithm is designed in which two cross operators are presented,a single-point crossover and a multi-point crossover.For the purpose of algorithm test and analysis,a problem-generating program is designed,which can simulate problems by modeling features encountered in real-world problems.Based on the problem generator,computational results and analysis are made and illustrated for the scheduling of multiple ground stations.     

考虑协同航路规划的多无人机任务分配

针对多无人机任务分配与协同航路规划问题，以分布式合同网拍卖算法为基础，构建无人机集群任务拍卖架构与拍卖收益函数，结合模拟退火算法协调任务执行次序，采用A^*算法完成两任务点间航程预估，在任务分配阶段同步完成多无人机间协同航路的初规划，确定最佳任务执行次序，实现任务分配与协同航路规划的紧耦合。仿真结果表明，在考虑禁飞区、障碍威胁情况下，该算法能够有效完成多架无人机不同类型任务的分配，且目标分配、执行次序合理，总执行代价小，各机间负载均衡；在任务分配阶段考虑协同航路规划具有明显的效果，能够有效提高任务分配的合理性。     

A hybrid genetic approach for airborne sensor vehicle routing in real-time reconnaissance missions

Past initiatives to address surveillance and reconnaissance mission planning mainly focused on low-level control aspects such as real-time path planning and collision avoidance algorithms in limited environment. However, few efforts have been spent on high-level real-time task allocation. It is believed that automated decision capabilities supporting real-time resource allocation for sensor control and interactions might significantly reduce user workload, focusing attention on alternate tasks and objectives while assigning hard computational tasks to artificial agents. In this paper, we propose a new hybrid genetic algorithm to solve the dynamic vehicle routing problem with time windows, in which a group of airborne sensors are engaged in a reconnaissance mission evolving in a dynamic uncertain environment involving known and unknown targets/threats. In that context, visiting a target may consist in carrying out a collection of subtasks such as search, detect, recognize and confirm suspected targets, discover and confirm new ones. The approach consists in concurrently evolving two populations of solutions to minimize total travel time and temporal constraint violation using genetic operators combining variations of key concepts inspired from routing techniques and search strategies. A least commitment principle in servicing scheduled customers is also exploited to potentially improve solution quality.     

Multi-UAV reconnaissance task allocation for heterogeneous targets using an opposition-based genetic algorithm with double-chromosome encoding

This paper presents a novel multiple Unmanned Aerial Vehicles (UAVs) reconnaissance task allocation model for heterogeneous targets and an effective genetic algorithm to optimize UAVs’ task sequence. Heterogeneous targets are classified into point targets, line targets and area targets according to features of target geometry and sensor’s field of view. Each UAV is regarded as a Dubins vehicle to consider the kinematic constraints. And the objective of task allocation is to minimize the task execution time and UAVs’ total consumptions. Then, multi-UAV reconnaissance task allocation is formulated as an extended Multiple Dubins Travelling Salesmen Problem (MDTSP), where visit paths to the heterogeneous targets must meet specific constraints due to the targets’ feature. As a complex combinatorial optimization problem, the dimensions of MDTSP are further increased due to the heterogeneity of targets. To efficiently solve this computationally expensive problem, the Opposition-based Genetic Algorithm using Double-chromosomes Encoding and Multiple Mutation Operators (OGA-DEMMO) is developed to improve the population variety for enhancing the global exploration capability. The simulation results demonstrate that OGA-DEMMO outperforms the ordinary genetic algorithm, ant colony optimization and random search in terms of optimality of the allocation results, especially for large scale reconnaissance task allocation problems.     

多类异构对地观测平台协同任务规划方法

目前,不同类型的对地观测平台之间缺乏有效的协同交互机制。这种孤立的资源管控模式难以应对多样且大量的对地观测需求。特别是在一些紧急情况下,如地震、武装冲突、洪涝灾害和森林火灾等,这种模式的弊端尤为突出。研究了多类异构观测资源,包括卫星、飞艇及无人机(UAV)的协同规划问题。首先,提出一种基于多Agent的分层协同规划框架,整合不同观测资源构成一个分布式和松耦合的对地观测系统。其次,将异构对地观测平台的协同规划问题转化为不同子规划中心间的任务分配问题。第三,针对该任务分配问题,提出一种结合禁忌列表模拟退火(SA-TL)算法,在该算法中融合了禁忌表策略,有效提高了算法的性能。仿真实验验证了多Agent协同框架的优越性和SA-TL算法的效率。     

Dynamically adaptable m-best 2-D assignment algorithm andmultilevel parallelization

In recent years, there has been considerable interest within the tracking community in an approach to data association based on the m-best two-dimensional (2D) assignment algorithm. Much of the interest has been spurred by its ability to provide various efficient data association solutions, including joint probabilistic data association (JPDA) and multiple hypothesis tracking (MHT). The focus of this work is to describe several recent improvements to the m-best 2D assignment algorithm. One improvement is to utilize a nonintrusive 2D assignment algorithm switching mechanism, based on a problem sparsity threshold. Dynamic switching between two different 2D assignment algorithms, highly suited for sparse and dense problems, respectively, enables more efficient solutions to the numerous 2D assignment problems generated in the m-best 2D assignment framework. Another improvement is to utilize a multilevel parallelization enabling many independent and highly parallelizable tasks to be executed concurrently, including 1) solving the multiple 2D assignment problems via a parallelization of the m-best partitioning task, and 2) calculating the numerous gating tests, state estimates, covariance calculations, and likelihood function evaluations (used as cost coefficients in the 2D assignment problem) via a parallelization of the data association interface task. Using both simulated data and an air traffic surveillance (ATS) problem based on data from two Federal Aviation Administration (FAA) air traffic control radars, we demonstrate that efficient solutions to the data association problem are obtainable using our improvements in the m-best 2D assignment algorithm     

Tracking multiple objects with particle filtering

We address the problem of multitarget tracking (MTT) encountered in many situations in signal or image processing. We consider stochastic dynamic systems detected by observation processes. The difficulty lies in the fact that the estimation of the states requires the assignment of the observations to the multiple targets. We propose an extension of the classical particle filter where the stochastic vector of assignment is estimated by a Gibbs sampler. This algorithm is used to estimate the trajectories of multiple targets from their noisy bearings, thus showing its ability to solve the data association problem. Moreover this algorithm is easily extended to multireceiver observations where the receivers can produce measurements of various nature with different frequencies.     

Precision large scale air traffic surveillance using IMM/assignmentestimators

We present the development and implementation of a multisensor-multitarget tracking algorithm for large scale air traffic surveillance based on interacting multiple model (IMM) state estimation combined with a 2-dimensional assignment for data association. The algorithm can be used to track a large number of targets from measurements obtained with a large number of radars. The use of the algorithm is illustrated on measurements obtained from 5 FAA radars, which are asynchronous, heterogeneous, and geographically distributed over a large area. Both secondary radar data (beacon returns from cooperative targets) as well as primary radar data (skin returns from noncooperative targets) are used. The target IDs from the beacon returns are not used in the data association. The surveillance region includes about 800 targets that exhibit different types of motion. The performance of an IMM estimator with linear motion models is compared with that of the Kalman filter (KF). A number of performance measures that can be used on real data without knowledge of the ground truth are presented for this purpose. It is shown that the IMM estimator performs better than the KF. The advantage of fusing multisensor data is quantified. It is also shown that the computational requirements in the multisensor case are lower than in single sensor case, Finally, an IMM estimator with a nonlinear motion model (coordinated turn) is shown to further improve the performance during the maneuvering periods over the IMM with linear models     

Tracking of Spawning Targets with Multiple Finite Resolution Sensors

In this paper the problem of tracking multiple spawning targets with multiple finite-resolution sensors is considered and a new algorithm for measurement-to-track association with possibly unresolved measurements is presented. The goal is to initialize new tracks of spawned targets before they are resolved from the mother platform so that one has the ability to carry out early discrimination when they become resolved. The multiple scan data association problem is first formulated as a multidimensional assignment problem with explicit new constraints for the unresolved measurements. Then the top M hypotheses tracking (TMHT) is presented where the state estimates and their covariances are modified based on the M best hypotheses through the assignment solutions. A modification to the assignment problem is developed that leads to a linear programming (LP) where the optimal solution can be a noninteger in [0,1]. The fractional optimal solution is interpreted as (pseudo) probabilities over the N - 1 frame sliding window. The best hard (binary) decision assignment solution and the M best via TMHT are compared with the soft decision solution for 2-D tracking scenarios with various sensor configurations. Based on the simulation results, the soft assignment approach has better track maintenance capability than the single best hard assignment and a performance nearly as good as the TMHT. Its computational load is slightly higher than the single best hard assignment but much lighter than TMHT.     

复合打击下具有多次拦截时机的火力分配问题

针对传统火力分配模型容易造成资源浪费的问题,将火力单元以组为单位,以最大化杀伤概率为目标,构建一种具有多次拦截时机的动态火力分配模型;考虑到组内火力单元复合打击的情况,使用Kuhn-Munkres算法,优先将目标分配给复合打击效果大的目标;在此基础之上,设计了一种基于遗传算法（GA）的Anytime算法,引入了元级控制,提出一种任意时刻算法停机时刻的判定方法;仿真实验验证了模型优越性以及算法的合理性,对火力分配任意时刻算法使用元级控制可以有效提高解的效用。     

运用混合遗传算法的多机编队重构优化方法

多机编队重构优化除了要考虑终端状态约束、控制作用能量约束之外,还必须考虑安全防撞距离与通信保障距离的约束。在满足这些约束的前提下,提出了一种新的结合控制作用参数化与时间离散化(CPTD)方法和遗传算法(GA)的混合算法,将编队重构最优时间控制问题进行控制作用参数化和时间离散化处理,转化为带自由终端状态约束的离散型优化问题,并通过对传统遗传操作算子的改进,采用改进的遗传算法进行寻优,得到最优解。算例结果表明了该混合算法的有效性,其适用于编队重构最优时间控制问题。     

一种基于模糊遗传算法的多传感器多目标跟踪数据关联算法

基于模糊遗传算法发展了一种新的数据关联算法。数据关联的静态部分靠一个模糊遗传算法来得出量测组合序列和S-D分配的m个最优解。在数据关联的动态部分，将得到的S-D分配的m个最优解在一个基于多种群模糊遗传算法的动态2D分配算法中依靠一个卡尔曼滤波估计器估计出移动目标各个时刻的状态。这一基于分配的数据关联算法的仿真试验内容为被动式传感器的航迹形成和维持的问题。仿真试验的结果表明该算法在多传感器多目标跟踪中应用的可行性。另外，对算法发展和实时性问题进行了简单讨论。     

多无人机系统协同多任务分配模型与仿真

针对多约束条件下的多无人机系统协同多任务分配问题(CMTAP),提出了利用多约束条件下的多车场车辆路径问题(MDVRPMC)对协同多任务分配问题进行建模,在设计基于Pareto最优的遗传模拟退火算法的基础上,对存在任务点动态时间窗口约束、任务类型约束、无人机任务能力约束等条件下的协同多任务分配问题进行了求解.实例仿真表...     

微动目标跟踪成像一体化的雷达资源优化调度算法

相控阵雷达可以同时担负搜索、跟踪、识别与成像等多种雷达任务。为了提高雷达对战场环境的感知能力并减轻雷达资源分配的冲突,提出一种微动目标跟踪成像一体化的雷达资源优化调度算法。该算法建立了包含微动目标成像任务的雷达优化调度模型并利用启发式算法求解,利用跟踪脉冲与调度剩余的空闲时间资源,动态地构造感知矩阵并采用正交匹配追踪（OMP）算法对微动目标进行特征提取并成像。仿真结果表明：该算法可以实现稀疏孔径条件下的微动目标成像,并具有良好的鲁棒性,同时进一步提高了雷达系统的资源利用率。     

Operator scheduling strategies in supervisory control of multiple UAVs

The application of network centric operations to time-constrained command and control environments will mean that human operators will be increasingly responsible for multiple simultaneous supervisory control tasks. One such futuristic application will be the control of multiple unmanned aerial vehicles (UAVs) by a single operator. To achieve such performance in complex, time critical, and high risk settings, automated systems will be required both to guarantee rapid system response, as well as manageable workload for operators. Through the development of a simulation test bed for human supervisory control of multiple independent UAVs by a single operator, this paper presents recent efforts to investigate workload mitigation strategies as a function of increasing automation. A human-in-the-loop experiment revealed that under low workload conditions, operators' cognitive strategies were relatively robust across increasing levels of automated decision support. However, when provided with explicit automated recommendations and with the ability to negotiate with external agencies for delays in arrival times for targets, operators inappropriately fixated on the need to globally optimize their schedules. In addition, without explicit visual representation of uncertainty, operators tended to treated all probabilities uniformly. This study also revealed that operators who reached cognitive saturation adapted two very distinct management strategies, which led to varying degrees of success. Lastly, operators with management-by-exception decision support exhibited evidence of automation bias.     

A memetic algorithm for path planning of curvature-constrained UAVs performing surveillance of multiple ground targets

The problem of generating optimal paths for curvature-constrained unmanned aerial vehicles （UAVs） performing surveillance of multiple ground targets is addressed in this paper. UAVs are modeled as Dubins vehicles so that the constraints of UAVs＇ minimal turning radius can be taken into account. In view of the effective surveillance range of the sensors equipped on UAVs, the problem is formulated as a Dubins traveling salesman problem with neighborhood （DTSPN）. Considering its prohibitively high computational complexity, the Dubins paths in the sense of terminal heading relaxation are introduced to simplify the calculation of the Dubins distance, and a boundary-based encoding scheme is proposed to determine the visiting point of every target neighborhood. Then, an evolutionary algorithm is used to derive the optimal Dubins tour. To further enhance the quality of the solutions, a local search strategy based on approximate gradient is employed to improve the visiting points of target neighborhoods. Finally, by a minor modification to the individual encoding, the algorithm is easily extended to deal with other two more sophisticated DTSPN variants （multi-UAV scenario and multiple groups of targets scenario）. The performance of the algorithm is demonstrated through comparative experiments with other two state-of-the-art DTSPN algorithms identified in literature. Numerical simulations exhibit that the algorithm proposed in this paper can find high-quality solutions to the DTSPN with lower computational cost and produce significantly improved performance over the other algorithms.     

基于SA-DPSO混合优化算法的协同空战火力分配

针对超视距(BVR)多机协同空战中,火力单元采用一次性完全分配原则容易造成资源浪费的问题,提出了一种新的火力分配数学模型。该模型带有毁伤概率门限,能够保证在满足毁伤概率门限的前提下,优先保证威胁度大的目标被分配且选择对各目标相对贡献较大的火力单元,使其对目标的毁伤概率平均值达到最大且尽量少地消耗火力单元,从而节省和充分利用火力资源。在此基础上,提出采用模拟退火(SA)-离散粒子群(DPSO)混合优化算法求解协同空战火力分配,提高了算法收敛速度、精度以及全局搜索能力,避免陷入局部极小。仿真算例验证了新模型的优点以及SA-DPSO混合优化算法的有效性。     

基于最大一致容积Kalman滤波器的多机器人协同定位CSCD

机器人位置信息是多机器人系统执行任务的前提,单个机器人因传感器载荷和作用范围的限制,难以完成复杂环境中的定位任务,多个机器人通过协作可实现大范围下的位置确定。将配置多个传感器的同构机器人群替换为配置单个或少量传感器的异构机器人可降低硬件成本,并且通过设计协同算法,不会降低定位精度。提出了一种将容积Kalman滤波器与最大一致思想融合后的新型滤波算法,并将该算法应用于麦克纳姆轮机器人系统。通过仿真和实物验证了最大一致容积Kalman滤波器的协同定位效果。