Obstacle Avoidance and Multitarget Tracking of a Super Redundant Modular Manipulator Based on Bezier Curve and Particle Swarm Optimization

A super redundant serpentine manipulator has slender structure and multiple degrees of freedom.It can travel through narrow spaces and move in complex spaces.This manipulator is composed of many modules that can form different lengths of robot arms for different application sites.The increase in degrees of freedom causes the inverse kinematics of redundant manipulator to be typical and immensely increases the calculation load in the joint space.This paper presents an integrated optimization method to solve the path planning for obstacle avoidance and discrete trajectory tracking of a super redundant manipulator.In this integrated optimization,path planning is established on a Bezier curve,and particle swarm optimization is adopted to adjust the control points of the Bezier curve with the kinematic constraints of manipulator.A feasible obstacle avoidance path is obtained along with a discrete trajectory tracking by using a follow-the-leader strategy.The relative distance between each two discrete path points is limited to reduce the fitting error of the connecting rigid links to the smooth curve.Simulation results show that this integrated optimization method can rapidly search for the appropriate trajectory to guide the manipulator in obtaining the target while achieving obstacle avoidance and meeting joint constraints.The proposed algorithm is suitable for 3D space obstacle avoidance and multitarget path tracking.

Multi-target tracking algorithm based on PHD filter against multi-range-false-target jamming

Multi-range-false-target(MRFT) jamming is particularly challenging for tracking radar due to the dense clutter and the repeated multiple false targets. The conventional association-based multi-target tracking(MTT) methods suffer from high computational complexity and limited usage in the presence of MRFT jamming.In order to solve the above problems, an efficient and adaptable probability hypothesis density(PHD) filter is proposed. Based on the gating strategy, the obtained measurements are firstly classified into the generalized newborn target and the existing target measurements. The two categories of measurements are independently used in the decomposed form of the PHD filter. Meanwhile,an amplitude feature is used to suppress the dense clutter. In addition, an MRFT jamming suppression algorithm is introduced to the filter. Target amplitude information and phase quantization information are jointly used to deal with MRFT jamming and the clutter by modifying the particle weights of the generalized newborn targets. Simulations demonstrate the proposed algorithm can obtain superior correct discrimination rate of MRFT, and high-accuracy tracking performance with high computational efficiency in the presence of MRFT jamming in the dense clutter.

METHOD OF MULTI-TARGET TRACKING IN WIDE AREA SURVEILLANCE AIRBORNE RADAR SYSTEM BASING ON CLUSTERING ANALYSIS

This paper proposed a robust method based on the definition of Mahalanobis distance to track ground moving target. The feature and the geometry of airborne ground moving target tracking systems are studied at first. Based on this feature, the assignment relation of time-nearby target is calculated via Mahalanobis distance, and then the corresponding transformation formula is deduced. The simulation results show the correctness and effectiveness of the proposed method.

Modified joint probabilistic data association with classification-aided for multitarget tracking

Joint probabilistic data association is an effective method for tracking multiple targets in clutter, but only the target kinematic information is used in measure-to-track association. If the kinematic likelihoods are similar for different closely spaced targets, there is ambiguity in using the kinematic information alone; the correct association probability will decrease in conventional joint probabilistic data association algorithm and track coalescence will occur easily. A modified algorithm of joint probabilistic data association with classification-aided is presented, which avoids track coalescence when tracking multiple neighboring targets. Firstly, an identification matrix is defined, which is used to simplify validation matrix to decrease computational complexity. Then, target class information is integrated into the data association process. Performance comparisons with and without the use of class information in JPDA are presented on multiple closely spaced maneuvering targets tracking problem. Simulation results quantify the benefits of classification-aided JPDA for improved multiple targets tracking, especially in the presence of association uncertainty in the kinematic measurement and target maneuvering. Simulation results indicate that the algorithm is valid.

FGAs-Based Data Association Algorithm for Multi-sensor Multi-target Tracking

A novel data association algorithm is developed based on fuzzy geneticalgorithms (FGAs). The static part of data association uses one FGA to determine both the lists ofcomposite measurements and the solutions of m-best S-D assignment. In the dynamic part of dataassociation, the results of the m-best S-D assignment are then used in turn, with a Kalman filterstate estimator, in a multi-population FGA-based dynamic 2D assignment algorithm to estimate thestates of the moving targets over time. Such an assignment-based data association algorithm isdemonstrated on a simulated passive sensor track formation and maintenance problem. The simulationresults show its feasibility in multi-sensor multi-target tracking. Moreover, algorithm developmentand real-time problems are briefly discussed.

Target Tracking and Obstacle Avoidance for Multi-agent Systems

This paper considers the problems of target tracking and obstacle avoidance for multi-agent systems. To solve the problem that multiple agents cannot effectively track the target while avoiding obstacle in dynamic environment, a novel control algorithm based on potential function and behavior rules is proposed. Meanwhile, the interactions among agents are also considered. According to the state whether an agent is within the area of its neighbors＇ influence, two kinds of potential functions are presented. Meanwhile, the distributed control input of each agent is determined by relative velocities as well as relative positions among agents, target and obstacle. The maximum linear speed of the agents is also discussed. Finally, simulation studies are given to demonstrate the performance of the proposed algorithm.

面向非线性MTT的多模型泊松多伯努利混合滤波算法

在多目标跟踪(Multi-target Tracking,MTT)的非线性特性与低检测概率情况下,针对多伯努利滤波算法的高斯混合(Gaussian Mixture,GM)实现难以精确估计目标的势与运动状态的实际问题,本文提出了一种适用于非线性系统的泊松多伯努利混合滤波(Poisson Multi-Bernoulli Mixture Filter,PMBM)算法.首先,推导出多模型泊松多伯努利混合滤波的高斯混合(GM Multi-model PMBM,GM-MM-PMBM)实现过程.然后,分别对GM-MM-PMBM的伯努利高斯分量进行预测与更新,实现了基于非线性系统的MTT.为提升系统稳定性,基于平方根协方差矩阵推导出GM-MM-PMBM均方根容积卡尔曼滤波算法的实现过程.最后,仿真实验综合验证了本文算法的跟踪性能.

Augmented input estimation in multiple maneuvering target tracking

This paper presents augmented input estimation(AIE)for multiple maneuvering target tracking.Multi-target tracking(MTT)is based on two main parts,data association and estimation.In data association(DA),the best observations are assigned to the considered tracks.In real conditions,the number of observations is more than targets and also locations of observations are often so scattered that the association between targets and observations cannot be done simply.In this case,for general MTT problems with unknown numbers of targets,we present a Markov chain Monte-Carlo DA(MCMCDA)algorithm that approximates the optimal Bayesian filter with low complexity in computations.After DA,estimation and tracking should be done.Since in general cases,many targets can have maneuvering motions,then AIE is proposed to cover both the non-maneuvering and maneuvering parts of motion and the maneuver detection procedure is eliminated.This model with an input estimation(IE)approach is a special augmentation in the state space model which considers both the state vector and the unknown input vector as a new augmented state vector.Some comparisons based on the Monte-Carlo simulations are also made to evaluate the performances of the proposed method and other older methods in MTT.

A new algorithm of bearings-only multi-target tracking of bistatic system

Much research mainly focuses on the batch processing method （e.g. maximum likelihood method） when bearings-only multiple targets tracking of bistatic sonar system is considered. In this paper, the idea of recursive processing method is presented and employed, and corresponding data association algorithms, i.e. a multi-objective ant-colony-based optimization algorithm and an easy fast assignment algorithm are developed to solve the measurements-to-measurements and measurements-to-tracks data association problems of bistatic sonar system, respectively. Monte-Carlo simulations are induced to evaluate the effectiveness of the proposed methods.

Target Tracking and Obstacle Avoidance for Multi-agent Networks with Input Constraints

In this paper, the problems of target tracking and obstacle avoidance for multi-agent networks with input constraints are investigated. When there is a moving obstacle, the control objectives are to make the agents track a moving target and to avoid collisions among agents. First, without considering the input constraints, a novel distributed controller can be obtained based on the potential function. Second, at each sampling time, the control algorithm is optimized. Furthermore, to solve the problem that agents cannot effectively avoid the obstacles in dynamic environment where the obstacles are moving, a new velocity repulsive potential is designed. One advantage of the designed control algorithm is that each agent only requires local knowledge of its neighboring agents. Finally, simulation results are provided to verify the effectiveness of the proposed approach.

MULTI-TARGET VISUAL TRACKING AND OCCLUSION DETECTION BY COMBINING BHATTACHARYYA COEFFICIENT AND KALMAN FILTER INNOVATION

This paper introduces an approach for visual tracking of multi-target with occlusion occurrence. Based on the author's previous work in which the Overlap Coefficient (OC) is used to detect the occlusion, in this paper a method of combining Bhattacharyya Coefficient (BC) and Kalman filter innovation term is proposed as the criteria for jointly detecting the occlusion occurrence. Fragmentation of target is introduced in order to closely monitor the occlusion development. In the course of occlusion, the Kalman predictor is applied to determine the location of the occluded target, and the criterion for checking the re-appearance of the occluded target is also presented. The proposed approach is put to test on a standard video sequence, suggesting the satisfactory performance in multi-target tracking.

Research and Application of Multi-Target Tracking Based on GM-PHD Filter

In recent years, multi-target tracking technology based on Gaussian Mixture- Probability Hypothesis Density (GM-PHD) filtering has become a hot field of information fusion research. This article outlines the generation and development of multi-target tracking methods based on GM-PHD filtering, and the principle and implementation method of GM-PHD filtering are explained, and the application status based on GM-PHD filtering is summarized, and the key issues of the development of GM-PHD filtering technology are analyzed.

Robust attitude control for rapid multi-target tracking in spacecraft formation flying

A robust attitude tracking control scheme for spacecraft formation flying is presented. The leader spacecraft with a rapid mobile antenna and a camera is modeled. While the camera is tracking the ground target, the antenna is tracking the follower spacecraft. By an angular velocity constraint and an angular constraint, two methods are proposed to compute the reference attitude profiles of the camera and antenna, respectively. To simplify the control design problem, this paper first derives the desired inverse system （DIS）, which can convert the attitude tracking problem of 3D space into the regulator problem. Based on DIS and sliding mode control （SMC）, a robust attitude tracking controller is developed in the presence of mass parameter uncertainties and external disturbance. By Lyapunov stability theory, the closed loop system stability can be achieved. The numerical simulations show that the proposed robust control scheme exhibits significant advantages for the multi-target attitude tracking of a two-spacecraft formation.

Algorithm for Multi-laser-target Tracking Based on Clustering Fusion

Multi-laser-target tracking is an important subject in the field of signal processing of laser warners. A clustering method is applied to the measurement of laser warner, and the space-time fusion for measurements in the same cluster is accomplished. Real-time tracking of multi-laser-target and real-time picking of multi-laser-signal are introduced using data fusion of the measurements. A prototype device of the algorithm is built up. The results of experiments show that the algorithm is very effective.

VIDEO MULTI-TARGET TRACKING BASED ON PROBABILISTIC GRAPHICAL MODEL

In the technique of video multi-target tracking,the common particle filter can not deal well with uncertain relations among multiple targets.To solve this problem,many researchers use data association method to reduce the multi-target uncertainty.However,the traditional data association method is difficult to track accurately when the target is occluded.To remove the occlusion in the video,combined with the theory of data association,this paper adopts the probabilistic graphical model for multi-target modeling and analysis of the targets relationship in the particle filter framework.Ex-perimental results show that the proposed algorithm can solve the occlusion problem better compared with the traditional algorithm.

Computer Model for Evaluating Multi-Target Tracking Algorithms

Public benchmark datasets have been widely used to evaluate multi-target tracking algorithms. Ideally, the benchmark datasets should include the video scenes of all scenarios that need to be tested. However, a limited amount of the currently available benchmark datasets does not comprehensively cover all necessary test scenarios. This limits the evaluation of multitarget tracking algorithms with various test scenarios. This paper introduced a computer simulation model that generates benchmark datasets for evaluating multi-target tracking algorithms with the complexity of multitarget tracking scenarios directly controlled by simulation inputs such as target birth and death rates, target movement, the rates of target merges and splits, target appearances, and image noise types and levels. The simulation model generated a simulated video and also provides the ground-truth target tracking for the simulated video, so the evaluation of multitarget tracking algorithms can be easily performed without any manual video annotation process. We demonstrated the use of the proposed simulation model for evaluating tracking-by-detection algorithms and filtering-based tracking algorithms.

Underground Coal Mine Target Tracking via Multi-Feature Joint Sparse Representation

Single-feature methods are unable to effectively track a target in an underground coal mine video due to the high background noise, low and uneven illumination, and drastic light fluctuation in the video. In this study, we propose an underground coal mine personnel target tracking method using multi-feature joint sparse representation. First, with a particle filter framework, the global and local multiple features of the target template and candidate particles are extracted. Second, each of the candidate particles is sparsely represented by a dictionary template, and reconstruction is achieved after solving the sparse coefficient. Last, the particle with the lowest reconstruction error is deemed the tracking result. To validate the effectiveness of the proposed algorithm, we compare the proposed method with three commonly employed tracking algorithms. The results show that the proposed method is able to reliably track the target in various scenarios, such as occlusion and illumination change, which generates better tracking results and validates the feasibility and effectiveness of the proposed method.

Maneuvering Multi-target Tracking Algorithm Based on Modified Generalized Probabilistic Data Association

Aiming at the problem of strong nonlinear and effective echo confirm of multi-target tracking system in clutters environment, a novel maneuvering multitarget tracking algorithm based on modified generalized probabilistic data association is proposed in this paper. In view of the advantage of particle filter which can deal with the nonlinear and non-Gaussian system, it is introduced into the framework of generalized probabilistic data association to calculate the residual and residual covariance matrices, and the interconnection probability is further optimized. On that basis, the dynamic combination of particle filter and generalized probabilistic data association method is realized in the new algorithm. The theoretical analysis and experimental results show the filtering precision is obviously improved with respect to the tradition method using suboptimal filter.

Target Tracking with QoS Support in Large Wireless Sensor Networks

Quality of Service (QoS) is important in the application of target tracking in wireless sensor networks (WSNs). When a target appears, it will trigger an event from one or more sensors. A target can only be accurately detected if a certain number of event packets are received by the sink in a predetermined detection time interval. In this paper, we propose a buffer management scheme based on event ordering to achieve QoS. We also propose a directional QoS-aware routing protocol (DQRP) for the dissemination of the event ordering list. After the dissemination, a priority queue buffer management scheme is used to ensure QoS. Our buffer management scheme works in conjunction with DQRP to ensure accurate as well as energy-efficient target detection in the presence of multiple targets. The novelty of our network architecture is that a distributed admission control scheme is implemented on each node based on a geographic routing algorithm. In our scenario, a target can only be accurately detected if a certain number of event packets are received by the sink in a predetermined detection time interval. Our main performance metric is the number of targets/events being detected. Our protocol maximizes the number of targets being detected.