重访机制驱动的多无人机协同动目标搜索方法

为实现多无人机高效捕获灰色任务区域内的移动目标,考虑传感器探测概率与虚警概率,提出了重访机制驱动的协同搜索规划（RMD-CSP）方法,以降低目标遗漏与误判概率。考虑无人机飞行性能约束,以最大化任务执行效能为目标建立多无人机协同搜索模型。根据目标先验信息初始化环境搜索信息图（包括目标概率分布图、环境不确定度图与环境搜索状态图）,利用无人机实时探测信息,基于贝叶斯准则持续更新搜索信息图。定制基于环境不确定度更新的重访机制,通过增加长时间未被重访区域的环境不确定度,引导无人机搜索该区域,降低移动目标的遗漏概率;定制基于目标函数权重更新的重访机制,引导无人机快速重访发现新的疑似目标的区域,对疑似目标进行再次确认,减少由于传感器虚警概率造成的目标误判概率。采用滚动时域规划架构,将搜索规划问题分解为一系列短时域规划问题,提升了求解效率。在典型任务想定下,通过数值仿真试验验证了所提方法的有效性。仿真结果表明,RMD-CSP能够在秒级时间内生成每个时域的搜索航迹,相比于光栅式搜索方法与标准的概率启发式搜索方法,能够引导无人机捕获更多的移动目标,同时减少误判次数,有效提升了多无人机协同搜索的任务效能。     

Highly reliable relative navigation for multi-UAV formation flight in urban environments

Formation flight of multiple Unmanned Aerial Vehicles (UAVs) is expected to bring significant benefits to a wide range of applications. Accurate and reliable relative position information is a prerequisite to safely maintain a fairly close distance between UAVs and to achieve inner-system collision avoidance. However, Global Navigation Satellite System (GNSS) measurements are vulnerable to erroneous signals in urban canyons, which could potentially lead to catastrophic consequences. Accordingly, on the basis of performing relative positioning with double differenced pseudoranges, this paper develops an integrity monitoring framework to improve navigation integrity (a measure of reliability) in urban environments. On the one hand, this framework includes a fault detection and exclusion scheme to protect against measurement faults. To accommodate urban scenarios, spatial dependence in the faults are taken into consideration by this scheme. On the other hand, relative protection level is rigorously derived to describe the probabilistic error bound of the navigation output. This indicator can be used to evaluate collision risk and to warn collision danger in real time. The proposed algorithms are validated by both simulations and flight experiments. Simulation results quantitatively reveal the sensitivity of navigation performance to receiver configurations and environmental conditions. And experimental results suggest high efficiency and effectiveness of the new integrity monitoring framework.     

多无人机辅助定位信标的区域导航定位算法

针对卫星导航系统在受到干扰不可用的情况,研究了多无人机（UAV）辅助的区域导航定位算法。以无人机作为空基信号播发平台,向地面用户广播其位置信息及同步时钟信号,地面用户通过接收无人机位置及与无人机的距离计算出其实时位置。以地面战车为例,为解决伪距单点定位算法中的矩阵不可逆问题,消除地面用户接收机的钟差,基于列文伯格-马夸尔特（LM）算法,提出一种地面用户的定位解算模型,同时,为提高一般最小二乘算法的计算精度,提出了两步最小二乘定位算法。在分析2种算法静态定位精度的基础上,设计了基于车载惯性传感器和无人机辅助定位信息的组合导航实现算法,实现了对战车的连续定位。仿真结果表明,在GNSS拒止环境下,利用无人机播发的定位信标信号并结合地面用户战车自带的惯性导航系统,可以实现对地面用户的可靠连续定位,满足一定区域范围内用户的导航定位需求。     

基于决策不确定性的多目标跟踪传感器管理

针对高杂波、电子干扰环境,在量测驱动的多目标滤波框架下提出了一种基于决策不确定性的传感器管理方法。首先,根据部分可观测马尔科夫决策过程的理论,给出了基于Rényi信息增量的传感器管理一般方法。其次,综合考虑决策过程的信息完整性、信息质量、信息的内涵等因素,在量测驱动的自适应滤波框架下,基于目标运动态势评估多目标决策不确定性水平,并选取最大决策不确定性目标。最后,以最大决策不确定性目标的信息增量最大化为准则进行传感器分配方案的求解。仿真实验表明所提方法能够有效抑制电子干扰、杂波对多目标跟踪及传感器分配的影响,与基于威胁的传感器管理方法相比,所提方法的平均最优子模式分配（OSPA）距离及平均计算时长均显著降低,且在高杂波、电子干扰情形下具有较高的可靠性。     

Pop-up threat models for persistent area denial

Pop-up threats usually appear or disappear randomly in a battle field. If the next pop-up threat locations could be predicted it would assist a search or attack team, such as in a persistent area denial (PAD) mission, in getting a team of unmanned air vehicles (UAVs) to the threats sooner. We present a Markov model for predicting pop-up ground threats in military operations. We first introduce a general Markov chain of order n to capture the dependence of the appearance of pop-up threats at previous locations of the pop-up threats over time. We then present an adaptive approach to estimate the stationary transition probabilities of the nth order Markov models. To choose the order of the Markov chain model for a specific application, we suggest using hypothesis tests from statistical inference on historical data of pop-up threat locations. Anticipating intelligent responses from an adversary, which might change its pop-up threat deployment strategy upon observing UAV movements, we present adaptive Markov chain models using a moving horizon approach to estimate possibly abrupt changes in transition probabilities. We combine predicted and actual pop-up target locations to develop efficient cooperative strategies for networked UAVs. A theoretical analysis and simulation results are presented to evaluate the Markov model used for predicting pop-up threats. These results demonstrate the effectiveness of cooperative strategies using the combined information of threats and predicted threats in improving overall mission performance.     

Multisensor deployment using PCRLBS, incorporating sensor deployment and motion uncertainties

Recently, a general framework for sensor resource deployment (Hernandez, et. al. 2004) has been shown to allow efficient and effective utilization of a multisensor system. The basis of this technique is to use the posterior Cramer-Rao lower bound (PCRLB) to quantify and control the optimal achievable accuracy of target state estimation. In the original formulation (Hernandez, et. al. 2004) it was assumed that the sensor locations were known without error. In the current paper, the authors extend this framework by addressing the issues of imperfect sensor placement and uncertain sensor movement (e.g., sensor drift). The crucial consideration is then how these two forms of uncertainty are factored into the sensor management strategy. If unaccounted for, these uncertainties will render the output of the resource manager inaccurate and overoptimistic. The authors adjust the PCRLB to account for sensor location uncertainty, and we also allow for measurement origin uncertainty due to missed detections and false alarms. The work is motivated by the problem of tracking a submarine by adaptively deploying sonobuoys from a helicopter. Simulation results are presented to show the advantages of accounting for sensor location uncertainty within this focal domain of antisubmarine warfare. The authors note that the generic nature of the technique allows it to be utilized within other problem domains, including tracking ground-based targets using unattended ground sensors (UGSs) or unmanned aerial vehicles (UAVs)     

概率推理与影响图

本文讨论了影响图理论在概率推理过程中的应用和要涉及的信息及信息量。提出了虚拟信息滤波过程的概念和方法;讨论了概念网络中的信息溶合和衍殖过程;研究了用虚拟滤波过程表征人们行为中的柔性推理机制;设计了概念网络上的一种柔性推理准则。为决策分析和人工智能领域中的不肯定性信息测度问题提供了一种新的方法。     

基于惯性/激光测距/视觉里程计组合的高空场景尺度误差估计方法

惯性/视觉感知信息融合导航定位技术是目前实现无人机不依赖卫星自主导航的最有效手段。但对于面向高空场景的大型无人机，惯性器件误差与视觉里程计尺度误差耦合且特征平面化导致可观测性下降。针对这一问题，提出了利用惯性/激光测距/视觉里程计组合实现尺度误差估计的方法。通过开展误差模型建立、激光测量点与图像中位置匹配、无人机平飞机动下系统可观测性分析等关键技术研究，实现了高空场景下尺度误差的精确估计。经过300m高度机载试验数据验证，算法精度优于1.5%D，对卫星拒止条件下高空无人机自主导航具有重要意义。     

Bernoulli particle flter with observer altitude for maritime radiation source tracking in the presence of measurement uncertainty

For maritime radiation source target tracking in particular electronic counter measures（ECM）environment,there exists two main problems which can deteriorate the tracking performance of traditional approaches.The frst problem is the poor observability of the radiation source.The second one is the measurement uncertainty which includes the uncertainty of the target appearing/disappearing and the detection uncertainty（false and missed detections）.A novel approach is proposed in this paper for tracking maritime radiation source in the presence of measurement uncertainty.To solve the poor observability of maritime radiation source target,using the radiation source motion restriction,the observer altitude information is incorporated into the bearings-only tracking（BOT）method to obtain the unique target localization.Then the two uncertainties in the ECM environment are modeled by the random fnite set（RFS）theory and the Bernoulli fltering method with the observer altitude is adopted to solve the tracking problem of maritime radiation source in such context.Simulation experiments verify the validity of the proposed approach for tracking maritime radiation source,and also demonstrate the superiority of the method compared with the traditional integrated probabilistic data association（IPDA）method.The tracking performance under different conditions,particularly those involving different duration of radiation source opening and switching-off,indicates that the method to solve our problem is robust and effective.     

Search using multiple UAVs with flight time constraints

We consider a large scale system consisting of multiple unmanned aerial vehicles (UAVs) performing a search and surveillance task, based on the uncertainty map of an unknown region. The search algorithm is based on the k-shortest path algorithm that maximizes the effectiveness of the search in term of searching through the maximum uncertainty region, given a constraint on the endurance time of the UAV and on the location of the base station from which the UAVs operate. These constraints set apart this class of problems from the usual search and surveillance problems. We compare the performance of this algorithm with a random search and a greedy strategy search, We also implement the algorithm for the case of multiple UAVs searching an unknown region. The cases of delayed and partial information are also considered. Simulation results that demonstrate the efficacy of the technique are also presented.     

高空长航时无人机任务设备/飞行综合控制技术

首先对无人机和任务设备的发展作了简要介绍，并介绍了高空长航时无人侦察机的国内外发展现状，着重对高空长航时无人侦察机任务设备／飞行综合控制中综合控制、运动补偿、组合导航、三维定位和目标识别等关键技术进行了分析，说明了目前对高空长航时无人机的任务设备／飞行综合控制进行研究的必要性和可行性。     

Joint probabilistic data association for autonomous navigation

A new autonomous navigation scheme based on the joint probabilistic data association (JPDA) approach that processes landmark detections in the field of view (FOV) of an on-board sensor is developed. These detections-some true, some false-are associated to a set of stored landmarks and used to update the state of the vehicle. The results obtained from Monte Carlo simulations prove the ability of this navigation filter to perform in very high false alarm environments. In the different environmental conditions tested in the simulations, the performance of the JPDA navigation filter (JPDANF) is very close to that of the filter based on perfect data association. The very efficient cluster decomposition algorithm presented for the purpose of the navigation problem can also be used in many multitarget tracking applications     

一种鲁棒Sigma-point滤波算法及其在相对导航中的应用

研究了一种鲁棒Sigma-point滤波方法在无人机编队相对导航问题上的应用。该方法采用Huber估计方法,将Sigma-point滤波量测更新转化为求解线性回归问题,新的Sigma-point滤波方法是一种混合L1、L2范数最小估计,当量测噪声为受污染的高斯白噪声时,该方法具有一定的鲁棒性。给出了编队无人机相对惯导方程和相对视线矢量测量原理,应用鲁棒Sigma-point滤波方法融合相对惯导信息和相对视线矢量信息,估计出无人机之间的相对姿态、相对速度和相对位置。仿真结果表明,与扩展卡尔曼滤波和常规Sigma-point滤波相比,鲁棒Sigma-point滤波可以获得更高的估计精度。     

A class of near optimal JPDA algorithms

The crucial problem in multiple target tracking is the hit-to-track data association. A hit is a received signal from a target or background clutter which provides positional information If an incorrect hit is associated with a track, that track could diverge and prematurely terminate or cause other tracks to also diverge. Most methods for hit-to-track data association fall into two categories: multiple hypothesis tracking (MHT) and joint probabilistic data association (JPDA). Versions of MHT use all or some reasonable hits to update a track and delay the decision on which hit was correct. JPDA uses a weighted sum of the reasonable hits to update a track. These weights are the probability that the hit originated from the target in track. The computational load for the joint probabilities increases exponentially as the number of targets increases and therefore, is not an attractive algorithm when expecting to track many targets. Reviewed here is the JPDA filter and two simple approximations of the joint probabilities which increase linearly in computational load as the number of targets increase. Then a new class of near optimal JPDA algorithms is introduced which run in polynomial time. The power of the polynomial is an input to the algorithm. This algorithm bridges the gap in computational load and accuracy between the very fast simple approximations and the efficient optimal algorithms     

A New Probabilistic Transformation in Generalized Power Space

The mapping from the belief to the probability domain is a controversial issue, whose original purpose is to make (hard) decision, but for contrariwise to erroneous widespread idea/claim, this is not the only interest for using such mappings nowadays. Actually the probabilistic transformations of belief mass assignments are very useful in modern multitarget multisensor tracking systems where one deals with soft decisions, especially when precise belief structures are not always available due to the existence of uncertainty in human being's subjective judgments. Therefore, a new probabilistic transformation of interval-valued belief structure is put forward in the generalized power space, in order to build a subjective probability measure from any basic belief assignment defined on any model of the frame of discernment. Several examples are given to show how the new transformation works and we compare it to the main existing transformations proposed in the literature so far. Results are provided to illustrate the rationality and efficiency of this new proposed method making the decision problem simpler.     

Flight safety measurements of UAVs in congested airspace

Describing spatial safety status is crucial for high-density air traffic involving multiple unmanned aerial vehicles (UAVs) in a complex environment. A probabilistic approach is proposed to measure safety situation in congested airspace. The occupancy distribution of the airspace is represented with conflict probability between spatial positions and UAV. The concept of a safety envelope related to flight performance and response time is presented first instead of the conventional fixed-size protected zones around aircraft. Consequently, the conflict probability is performance-dependent, and effects of various UAVs on safety can be distinguished. The uncer-tainty of a UAV future position is explicitly accounted for as Brownian motion. An analytic approximate algorithm for the conflict probability is developed to decrease the computational consumption. The relationship between safety and flight performance are discussed for different response times and prediction intervals. To illustrate the applications of the approach, an experi-ment of three UAVs in formation flight is performed. In addition, an example of trajectory planning is simulated for one UAV flying over airspace where five UAVs exist. The validation of the approach shows its potential in guaranteeing flight safety in highly dynamic environment.     

水下复杂环境下基于SINS/USBL/DVL多源信息融合的组合导航算法

针对复杂水下声场环境下高精度、长航时导航与定位的需求,构建了捷联惯性导航系统(SINS)/超短基线(USBL)相对测量信息的观测方程和SINS/声学多普勒测速仪(DVL)的观测方程,提出了一种融合SINS/USBL/DVL多源信息的组合定位算法.为解决声学量测信息不确定引起的导航性能下降的问题,充分考虑水声野值所导致的...     

飞行器多任务在线实时航迹规划

 针对不确定环境中的飞行器多任务航迹规划问题展开研究,提出了一种基于飞行路线图的两阶段航迹规划框架,航迹规划分成学习和查询两个阶段,环境信息和飞行器约束条件分阶段体现。在该框架下,通过采用一种混合多任务动态航迹规划方法,分别在稀疏路线图上实时搜索初始航迹和在精细路线图上启发式搜索后备航迹,能够在具有预先未知威胁、可变飞行任务的战场环境中实时生成三维航迹。     

Suboptimal joint probabilistic data association

A significant problem in multiple target tracking is the hit-to-track data association. A hit is a received signal from a target or background clutter which provides positional information. If an incorrect hit is associated with a track, that track could diverge and terminate. Prior methods for this data association problem include various optimal and suboptimal two-dimensional assignment algorithms which make hit-to-track associations. Another method is to assign a weight for the reasonable hits and use a weighted centroid of those hits to update the track. The method of weighting the hits is known as joint probabilistic data association (JPDA). The authors review the JPDA approach and a simple ad hoc approximation and then introduce a new suboptimal JPDA algorithm. Examples which compare an optimal two-dimensional assignment algorithm with the ad hoc and the new suboptimal JPDA formulation are given     

多架无人机协同航路规划方法研究

根据敌方防御区域内雷达，导弹等威胁阵地的具体分布情况，采用划分Voronoi多边形的方法制订初始航路，然后对初始航路进行了合理的离散处理，最后采用动态链类比法调整航路，航程并对航路进行光顺处理，提出了一种协调多架无人机（UAVs）于同一时间到达目标点的航路规划方法，用数字仿真技术对该方法进行了验证，结果表明该方法是可行的。