多站时差无源定位传感器网络优化

在可移动无源传感器网络中,观测器与目标的相对几何关系对定位精度有重要影响。为提高对运动目标的定位跟踪精度,提出一种基于时差无源定位几何稀释精度的移动平台实时布站方法。首先推导出二维时差无源定位方法下的带有基线长度和基线偏角的GDOP表达式,将其作为目标优化函数,使用加权离散搜索优化算法求解网内各观测器每一时刻的最佳观测位置,并在此最佳位置对目标进行量测,完成目标运动分析。该方法通估计和优化相结合实现移动平台无源传感器网络的实时优化部署,仿真证明该算法一定程度上解决了时差无源定位算法的定位模糊问题,提高了对运动目标的跟踪精度。     

基于区域收缩和DIRECT算法的运动分割

运动图像序列分割是计算机视觉中的一个重要问题.本文采用基于贝叶斯框架的最大后验边缘概率算法进行运动目标分割.首先,重新定义贝叶斯框架中似然函数的平滑项,并采用区域收缩算法实现迭代过程中运动目标支持区的估计.然后提出一种通过区域中心和主轴表示6参数仿射运动的模型,通过区域主轴像素估计运动参数,提高算法执行速度,将估计问题转化为一个取值有界的最优化问题,采用DIRECT算法估计运动参数.该方法与传统方法相比,提高运动参数估计的准确性和稳定性.通过仿真实验结果证明该方法的有效性.     

基于双层预测机制的传感器网络目标跟踪算法

针对层次型传感器网络的目标跟踪问题,提出了一种基于双层预测机制的目标跟踪算法,由传感器节点执行Bayes估计算法进行目标位置的预测与更新(微观预测);由簇头进行基于曲线运动方程的目标位置预测(宏观预测),并用预测结果对传感器节点所得到的目标位置进行更新,提高了目标位置计算精度.仿真结果表明,算法具有较好的跟踪精度和能量效率.     

无线传感器网络中的线性移动目标运动参数捕获方法

移动目标跟踪即移动目标的运动路径与参数获取在无线传感器网络应用中具有重要的研究价值.采用移动目标节点与信标节点间的TOA测量方法,提出了无线传感器网络中移动目标运动参数的捕获方法.通过建立移动目标运动参数的估计模型,本文首先推导了线性移动目标初始位置及移动速度估计的非约束线性最小二乘(ULLS)和约束线性最小二乘(CLLS)方法.将估计模型松弛为凸优化的半正定规划(SDP)问题,又设计了运动参数捕获的SDP算法.仿真分析结果表明,在3种所设计算法中ULLS算法的估计误差最大,SDP算法其次,CLLS算法的估计误差最小.随着采样周期的增加,初始位置的估计误差亦稍有增大,但速度估计误差却在减少.更多的采样点数量有利于增加测量信息量,可以有效减少位置及速度估计误差.     

模糊聚类粒子滤波的点状交叉多目标跟踪算法

提出了一种新的低信噪比红外序列图像多目标检测跟踪算法,该算法有机地结合了TBD检测算法与模糊聚类粒子滤波跟踪算法。首先通过多帧TBD处理后,检测出运动目标的初始位置、运动速度,然后在跟踪阶段采用粒子滤波算法估计目标运动状态,并在估计位置开一个跟踪窗进行检测、模糊聚类概率融合。对真实红外图像序列进行实验仿真,仿真结果验证了该算法具有良好的实时性与很高的精确性。     

一般相关噪声下线性系统固定延迟平滑算法

针对机动目标跟踪中固定延迟平滑估计算法的精度问题,当具有一般相关过程噪声和量测噪声时,提出了离散线性系统最优固定延迟平滑估计算法.该算法通过将延迟区间内全部量测进行集中式扩维.并对误差传递进行分析,从而精确地给出了误差间的相关性.在线性无偏最小方差意义下对系统状态进行递推估计,新算法在噪声的高斯分布假设下是最优的.仿真实验结果表明了该算法的有效性.     

基于梯度追踪的压缩感知超宽带通信信道估计

针对现有压缩感知超宽带信道估计方法运算复杂度较高的问题,提出了基于梯度追踪算法的压缩感知超宽带信道估计方法.将超宽带信道估计转化为压缩感知的重构问题,并使用梯度追踪算法进行重构得到信道估计值,最终实现信息解调.梯度追踪算法通过每步计算目标函数的负梯度方向和搜索步长,使目标函数沿负梯度方向以此步长搜索得到每步重构值的最优解,从而避免了正交匹配追踪算法中高维度最小二乘运算以及基追踪算法中求解凸优化问题所导致的运算复杂度高的缺点.仿真结果表明该方法相对于正交匹配追踪算法和基追踪算法能够降低运算复杂度,提高运算速度,同时依然能够保证估计效果.     

移动IPv6中的攻击源追踪问题研究*

着重于移动IPv6架构下的攻击源追踪问题研究,给出了IPv6中新的包标记算法和包采样算法,并针对移动环境中不同的攻击模式提出了有针对性的攻击源追踪策略.该方法的结合使用可以有效降低移动IPv6中的攻击源追踪难度.     

无线传感器网络下基于压缩感知的多目标分层贪婪匹配定位

针对基于压缩感知（Compressive sensing,CS）的多目标定位问题,通过分析多目标场景中的隐含结构信息,本文提出一种层级的贪婪匹配追踪定位算法.该算法首先获得多目标在网格化空间中的可能位置作为全局估计层,然后利用该全局估计信息作为稀疏恢复层的输入信息,在网格化空间中重构多目标位置矢量.本文证明了文献中广泛采用的基于正交化的预处理方式实质上降低了信噪比（Signal to noise ratio,SNR）,从而降低了定位性能.本文通过全局估计,预先排除了不可能的位置,等效于从观测子空间中分离出信号子空间,从而降低了观测噪声的影响.通过理论分析与计算机仿真,表明所提算法具有线性复杂度且在相同信噪比下具有更高的定位正确率和定位精度.     

基于核函数法及粒子滤波的煤矿井下定位算法研究

煤矿井下受限空间中,射频信号强度受到多径衰落、阴影效应及人为因素的影响,采用路径损耗模型的定位方法误差较大,提出了基于核函数法及粒子滤波的定位算法。该算法利用指纹匹配技术结合贝叶斯估计,基于核函数法构建模型,搜索训练数据中接近未知节点指纹特征的位置并加权得到初步观测坐标,最后利用粒子滤波将目标运动状态与观测值相融合,平滑位置突变以追踪移动轨迹。实验证明,对于静态目标定位,核函数法效果优于确定型匹配算法和高斯分布模型;对于动态目标定位,所提算法比基于Markov状态转移的算法定位结果更精准。     

Performance evaluation of selective and adaptive heads clustering algorithms over wireless sensor networks

Target tracking in wireless sensor networks can be considered as a milestone of a wide range of applications to permanently report, through network sensors, the positions of a mobile target to the base station during its move across a certain path. While tracking a mobile target, a lot of open challenges arise and need to be investigated and maintained which mainly include energy efficiency and tracking accuracy. In this paper, we propose three algorithms for tracking a mobile target in wireless sensor network utilizing cluster-based architecture, namely adaptive head, static head, and selective static head. Our goal is to achieve a promising tracking accuracy and energy efficiency by choosing the candidate sensor nodes nearby the target to participate in the tracking process while preserving the others in sleep state. Through Matlab simulation, we investigate the performance of the proposed algorithms in terms of energy consumption, tracking error, sensor density, as well as target speed. The results show that the adaptive head is the most efficient algorithm in terms of energy consumption while static and selective static heads algorithms are preferred as far as the tracking error is concerned especially when the target moves rapidly. Furthermore, the effectiveness of our proposed algorithms is verified through comparing their results with those obtained from previous algorithms.     

短道速滑运动中的轨迹建模

为探究在短道速滑比赛视频中检测、跟踪多个运动员目标并重建运动轨迹的问题, 针对目前的技术难以保证在遮挡频繁和位置交错的复杂运动视频中完整地跟踪各个目标并恢复 其运动轨迹,提出了一套完整的算法流程,能够快速并准确地检测、跟踪运动员目标并对其运 动轨迹进行建模。进一步地,提出了一种基于三次 B-样条曲线的轨迹重建算法,利用 B-样条曲 线的非均匀性和连续性,可以在缺失部分跟踪结果的情况下完整地拟合各个目标的光滑运动轨 迹。实验表明,该算法可以检测、跟踪多个运动员目标并重建其运动轨迹,所得结果可进一步 用于实际的技战术分析中。     

A Smooth Path Tracking Algorithm for Wheeled Mobile Robots with Dynamic Constraints

In order to avoid wheel slippage or mechanical damage during the mobile robot navigation, it is necessary tosmoothly change driving velocity or direction of the mobile robot. This means that dynamic constraints of the mobile robotshould be considered in the design of path tracking algorithm. In the study, a path tracking problem is formulated asfollowing a virtual target vehicle which is assumed to move exactly along the path with specified velocity. The drivingvelocity control law is designed basing on bang-bang control considering the acceleration bounds of driving wheels. Thesteering control law is designed by combining the bang-bang control with an intermediate path called the landing curve whichguides the robot to smoothly land on the virtual target's tangential line. The curvature and convergence analyses providesufficient stability conditions for the proposed path tracking controller. A series of path tracking simulations and experimentsconducted for a two-wheel driven mobile robot show the validity of the proposed algorithm.     

Decentralized Coordinated Tracking with Mixed Discrete–Continuous Decisions

In this paper, we study the problem of dynamically positioning a team of mobile robots for target tracking. We treat the coordination of mobile robots for target tracking as a joint team optimization to minimize uncertainty in target state estimates over a fixed horizon. The optimization is inherently a function of both the positioning of robots in continuous space and the assignment of robots to targets in discrete space. Thus, the robot team must make decisions over discrete and continuous variables. In contrast to methods that decouple target assignments and robot positioning, our approach avoids the strong assumption that a robot's utility for observing a target is independent of other robots’ observations. We formulate the optimization as a mixed integer nonlinear program and apply integer relaxation to develop an approximate solution in decentralized form. We demonstrate our coordinated multirobot tracking algorithm both in simulation and using a pair of mobile robotic sensor platforms to track moving pedestrians. Our results show that coupling target assignment and robot positioning realizes coordinated behaviors that are not possible with decoupled methods.     

基于局部敏感直方图的压缩跟踪

压缩跟踪在光照发生剧烈变化和目标姿势变化较大时容易出现漂移甚至跟丢现象。针对此缺陷,提出基于局部敏感直方图的压缩跟踪。通过计算局部敏感直方图,提取光照不变特征,联合压缩跟踪中使用的特征得到更优的特征。对不同视频序列的跟踪结果表明,与压缩跟踪和多示例学习跟踪算法相比,提出的算法在目标姿势发生较大变化和光照变化剧烈的情况下能够实现稳定的跟踪,并且满足实时性要求。     

Dynamic target tracking and observing in a mobile sensor network

This paper presents novel approaches to (1) the problem of flocking control of a mobile sensor network to track and observe a moving target and (2) the problem of sensor splitting/merging to track and observe multiple targets in a dynamic fashion. First, to deal with complex environments when the mobile sensor network has to pass through a narrow space among obstacles, we propose an adaptive flocking control algorithm in which each sensor can cooperatively learn the network’s parameters to decide the network size in a decentralized fashion so that the connectivity, tracking performance and formation can be improved. Second, for multiple dynamic target tracking, a seed growing graph partition (SGGP) algorithm is proposed to solve the splitting/merging problem. To validate the adaptive flocking control we tested it and compared it with the regular flocking control algorithm. For multiple dynamic target tracking, to demonstrate the benefit of the SGGP algorithm in terms of total energy and time consumption when sensors split, we compared it with the random selection (RS) algorithm. Several experimental tests validate our theoretical results.     

基于多行为的移动机器人路径规划

机器人由当前点向目标点运动的过程中,所处环境经常为动态变化且未知的,这使得传统的路径规划算法对于移动机器人避障过程很难建立精确的数学模型.为此,针对环境信息完全未知的情况,为移动机器人设计一种基于模糊控制思想的多行为局部路径规划方法.该方法通过对各种行为之间进行适时合理的切换,以保证机器人安全迅速地躲避静态和动态障碍物,并利用改进的人工势场法实现对变速目标点的追踪.对于模糊避障中常见的U型陷阱问题,提出一种边界追踪的陷阱逃脱策略,使得机器人成功解除死锁状态.另外,设计一个速度模糊控制器,实现了机器人的智能行驶.最后,基于Matlab平台的仿真结果验证了所提出算法的有效性和实时性,与A*势场法的对比结果更突出了该算法的可行性.     

基于消息传递的机载雷达组网航迹融合

机载雷达组网航迹融合需要解决目标跟踪、数据关联与航迹管理3个子问题, 然而这3个子问题相互耦合,采用开环序贯估计算法会导致性能下降. 本文提出了一种基于消息传递的机载雷达组网航迹融合方法, 该方法在联合优化框架下解决目标跟踪、数据关联与航迹管理3个子问题. 首先, 建立机载雷达组网航迹融合的联合概率密度函数, 并将其转换为因子图. 其次, 将因子图分解为置信传播区域与平均场近似区域. 目标运动状态的统计模型服从共轭指数模型, 因此采用平均场近似以获得简单的消息传递更新公式. 数据关联包含一对一约束, 因此采用置信传播. 目标存在状态同样采用置信传播, 以获得更好的近似结果. 最后, 可以通过闭环迭代框架近似估计后验分布, 从而有效处理目标跟踪、数据关联与航迹管理之间的耦合问题. 仿真结果表明, 所提算法的性能优于多假设跟踪算法和联合概率密度关联算法.     

Chance-constrained target tracking using sensors with bounded fan-shaped sensing regions

We present a robust target tracking algorithm for a mobile robot. It is assumed that a mobile robot carries a sensor with a fan-shaped field of view and finite sensing range. The goal of the proposed tracking algorithm is to minimize the probability of losing a target. If the distribution of the next position of a moving target is available as a Gaussian distribution from a motion prediction algorithm, the proposed algorithm can guarantee the tracking success probability. In addition, the proposed method minimizes the moving distance of the mobile robot based on the chosen bound on the tracking success probability. While the considered problem is a non-convex optimization problem, we derive a closed-form solution when the heading is fixed and develop a real-time algorithm for solving the considered target tracking problem. We also present a robust target tracking algorithm for aerial robots in 3D. The performance of the proposed method is evaluated extensively in simulation. The proposed algorithm has been successful applied in field experiments using Pioneer mobile robot with a Microsoft Kinect sensor for following a pedestrian.     

划分交互式箱粒子概率假设密度滤波法

针对现有的多机动目标追踪问题,将交互式多模型(interacting multiple model,IMM)思想与箱粒子概率假设密度滤波器(box probability hypothesis density filter,Box-PHD)相结合,并针对箱粒子在区间密集杂波等复杂环境下箱体偏大,所导致的箱粒子冗余和目标...