Frequency modulated continuous wave(FMCW)radar is an advantageous sensor scheme for target estimation and environmental perception.However,existing algorithms based on discrete Fourier transform(DFT),multiple signal c...Frequency modulated continuous wave(FMCW)radar is an advantageous sensor scheme for target estimation and environmental perception.However,existing algorithms based on discrete Fourier transform(DFT),multiple signal classification(MUSIC)and compressed sensing,etc.,cannot achieve both low complexity and high resolution simultaneously.This paper proposes an efficient 2-D MUSIC algorithm for super-resolution target estimation/tracking based on FMCW radar.Firstly,we enhance the efficiency of 2-D MUSIC azimuth-range spectrum estimation by incorporating 2-D DFT and multi-level resolution searching strategy.Secondly,we apply the gradient descent method to tightly integrate the spatial continuity of object motion into spectrum estimation when processing multi-epoch radar data,which improves the efficiency of continuous target tracking.These two approaches have improved the algorithm efficiency by nearly 2-4 orders of magnitude without losing accuracy and resolution.Simulation experiments are conducted to validate the effectiveness of the algorithm in both single-epoch estimation and multi-epoch tracking scenarios.展开更多
A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filte...A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filtering to solve the state of nonlinear mobile target tracking.First,the steps of extended Kalman filtering(EKF)are introduced.Second,the ISO is used to adjust the parameters of the EKF in real time to adapt to the current motion state of the mobile target.Finally,the effectiveness of the algorithm is demonstrated through filtering and tracking using the constant velocity circular motion model(CM).Under the specified conditions,the position and velocity mean square error curves are compared among the snake optimizer(SO)-EKF algorithm,EKF algorithm,and the proposed algorithm.The comparison shows that the proposed algorithm reduces the root mean square error of position by 52%and 41%compared to the SOEKF algorithm and EKF algorithm,respectively.展开更多
An algorithm to track multiple sharply maneuvering targets without prior knowledge about new target birth is proposed. These targets are capable of achieving sharp maneuvers within a short period of time, such as dron...An algorithm to track multiple sharply maneuvering targets without prior knowledge about new target birth is proposed. These targets are capable of achieving sharp maneuvers within a short period of time, such as drones and agile missiles.The probability hypothesis density (PHD) filter, which propagates only the first-order statistical moment of the full target posterior, has been shown to be a computationally efficient solution to multitarget tracking problems. However, the standard PHD filter operates on the single dynamic model and requires prior information about target birth distribution, which leads to many limitations in terms of practical applications. In this paper,we introduce a nonzero mean, white noise turn rate dynamic model and generalize jump Markov systems to multitarget case to accommodate sharply maneuvering dynamics. Moreover, to adaptively estimate newborn targets’information, a measurement-driven method based on the recursive random sampling consensus (RANSAC) algorithm is proposed. Simulation results demonstrate that the proposed method achieves significant improvement in tracking multiple sharply maneuvering targets with adaptive birth estimation.展开更多
A polynomial model, time origin shifting model(TOSM, is used to describe the trajectory of a moving target .Based on TOSM, a recursive laeast squares(RLS) algorithm with varied forgetting factor is derived for tracki...A polynomial model, time origin shifting model(TOSM, is used to describe the trajectory of a moving target .Based on TOSM, a recursive laeast squares(RLS) algorithm with varied forgetting factor is derived for tracking of a non-maneuvering target. In order to apply this algorithm to maneuvering targets tracking ,a tracking signal is performed on-line to determine what kind of TOSm will be in effect to track a target with different dynamics. An effective multiple model least squares filtering and forecasting method dadpted to real tracking of a maneuvering target is formulated. The algorithm is computationally more effcient than Kalman filter and the percentage improvement from simulations show both of them are considerably alike to some extent.展开更多
To avoid missing track caused by the target maneuvers in automatic target tracking system, a new maneuvering target tracking technique called threshold interacting multiple model (TIMM) is proposed. This algorithm i...To avoid missing track caused by the target maneuvers in automatic target tracking system, a new maneuvering target tracking technique called threshold interacting multiple model (TIMM) is proposed. This algorithm is based on the interacting multiple model (IMM) method and applies a threshold controller to improve tracking accuracy. It is also applicable to other advanced algorithms of IMM. In this research, we also compare the position and velocity root mean square (RMS) errors of TIMM and IMM algorithms with two different examples. Simulation results show that the TIMM algorithm is superior to the traditional IMM alzorithm in estimation accuracy.展开更多
Aim To develop a practical target tracking algorithm for different motion modes. Methods After creation of the new model, it was implemented by computer simulation to prove its performance and compared with the of...Aim To develop a practical target tracking algorithm for different motion modes. Methods After creation of the new model, it was implemented by computer simulation to prove its performance and compared with the often-used current statistical model. Results The simulation results show that the new IMM (interactive multiple model) have low tracking error in both maneuVering segment and non^Inaneuwi segment while the current statistical model bas muCh higher tracking error in non-maneuvering segment. Conclusion In the point of trackintaccuracy, the new IMM method is much better than the current acceleration method. It can develop into a practical target hacking method.展开更多
The mean shift tracker has difficulty in tracking fast moving targets and suffers from tracking error accumulation problem. To overcome the limitations of the mean shift method, a new approach is proposed by integrati...The mean shift tracker has difficulty in tracking fast moving targets and suffers from tracking error accumulation problem. To overcome the limitations of the mean shift method, a new approach is proposed by integrating the mean shift algorithm and frame-difference methods. The rough position of the moving tar- get is first located by the direct frame-difference algorithm and three-frame-difference algorithm for the immobile camera scenes and mobile camera scenes, respectively. Then, the mean shift algorithm is used to achieve precise tracking of the target. Several tracking experiments show that the proposed method can effectively track first moving targets and overcome the tracking error accumulation problem.展开更多
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...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.展开更多
To improve the low tracking precision caused by lagged filter gain or imprecise state noise when the target highly maneuvers, a modified unscented Kalman filter algorithm based on the improved filter gain and adaptive...To improve the low tracking precision caused by lagged filter gain or imprecise state noise when the target highly maneuvers, a modified unscented Kalman filter algorithm based on the improved filter gain and adaptive scale factor of state noise is presented. In every filter process, the estimated scale factor is used to update the state noise covariance Qk, and the improved filter gain is obtained in the filter process of unscented Kalman filter (UKF) via predicted variance Pk|k-1, which is similar to the standard Kalman filter. Simulation results show that the proposed algorithm provides better accuracy and ability to adapt to the highly maneuvering target compared with the standard UKF.展开更多
For being able to deal with the nonlinear or non-Gaussian problems, particle filters have been studied by many researchers. Based on particle filter, the extended Kalman filter (EKF) proposal function is applied to ...For being able to deal with the nonlinear or non-Gaussian problems, particle filters have been studied by many researchers. Based on particle filter, the extended Kalman filter (EKF) proposal function is applied to Bayesian target tracking. Markov chain Monte Carlo (MCMC) method, the resampling step, ere novel techniques are also introduced into Bayesian target tracking. And the simulation results confirm the improved particle filter with these techniques outperforms the basic one.展开更多
Wireless sensor network (WSN) of active sensors suffers from serious inter-sensor interference (ISI) and imposes new design and implementation challenges. In this paper, based on the ultrasonic sensor network, two tim...Wireless sensor network (WSN) of active sensors suffers from serious inter-sensor interference (ISI) and imposes new design and implementation challenges. In this paper, based on the ultrasonic sensor network, two time-division based distributed sensor scheduling schemes are proposed to deal with ISI by scheduling sensors periodically and adaptively respectively. Extended Kalman filter (EKF) is used as the tracking algorithm in distributed manner. Simulation results show that the adaptive sensor scheduling scheme can achieve superior tracking accuracy with faster tracking convergence speed.展开更多
Target tracking is very important in computer vision and related areas. It is usually difficult to accurately track fast motion target with appearance variations. Sometimes the tracking algorithms fail for heavy appea...Target tracking is very important in computer vision and related areas. It is usually difficult to accurately track fast motion target with appearance variations. Sometimes the tracking algorithms fail for heavy appearance variations. A multiple template method to track fast motion target with appearance changes is presented under the framework of appearance model with Kalman filter. Firstly, we construct a multiple template appearance model, which includes both the original template and templates affinely transformed from original one. Generally speaking, appearance variations of fast motion target can be covered by affine transformation. Therefore, the affine tr templates match the target of appearance variations better than conventional models. Secondly, we present an improved Kalman filter for approx- imate estimating the motion trail of the target and a modified similarity evaluation function for exact matching. The estimation approach can reduce time complexity of the algorithm and keep accuracy in the meantime. Thirdly, we propose an adaptive scheme for updating template set to alleviate the drift problem. The scheme considers the following differences: the weight differences in two successive frames; different types of affine transformation applied to templates. Finally, experiments demonstrate that the proposed algorithm is robust to appearance varia- tion of fast motion target and achieves real-time performance on middle/low-range computing platform.展开更多
Sensor scheduling is essential to collaborative target tracking in wireless sensor networks (WSNs). In the existing works for target tracking in WSNs, such as the information-driven sensor query (IDSQ), the taskin...Sensor scheduling is essential to collaborative target tracking in wireless sensor networks (WSNs). In the existing works for target tracking in WSNs, such as the information-driven sensor query (IDSQ), the tasking sensors are scheduled to maximize the information gain while minimizing the resource cost based on the uniform sampling intervals, ignoring the changing of the target dynamics and the specific desirable tracking goals. This paper proposes a novel energy-efficient adaptive sensor scheduling approach that jointly selects tasking sensors and determines their associated sampling intervals according to the predicted tracking accuracy and tracking energy cost. At each time step, the sensors are scheduled in alternative tracking mode, namely, the fast tracking mode with smallest sampling interval or the tracking maintenance mode with larger sampling interval, according to a specified tracking error threshold. The approach employs an extended Kalman filter (EKF)-based estimation technique to predict the tracking accuracy and adopts an energy consumption model to predict the energy cost. Simulation results demonstrate that, compared to a non-adaptive sensor scheduling approach, the proposed approach can save energy cost significantly without degrading the tracking accuracy.展开更多
In multiple extended targets tracking, replacing traditional multiple measurements with a rectangular region of the nonzero volume in the state space inspired by the box-particle idea is exactly suitable to deal with ...In multiple extended targets tracking, replacing traditional multiple measurements with a rectangular region of the nonzero volume in the state space inspired by the box-particle idea is exactly suitable to deal with extended targets, without distinguishing the measurements originating from the true targets or clutter.Based on our recent work on extended box-particle probability hypothesis density(ET-BP-PHD) filter, we propose the extended labeled box-particle cardinalized probability hypothesis density(ET-LBP-CPHD) filter, which relaxes the Poisson assumptions of the extended target probability hypothesis density(PHD) filter in target numbers, and propagates not only the intensity function but also cardinality distribution. Moreover, it provides the identity of individual target by adding labels to box-particles. The proposed filter can improve the precision of estimating target number meanwhile achieve targets' tracks. The effectiveness and reliability of the proposed algorithm are verified by the simulation results.展开更多
A novel adaptive sampling interval algorithm for multitarget tracking is presented. This algorithm which is based on interacting multiple models incorporates the grey relational grade (GRG) into the particle swarm o...A novel adaptive sampling interval algorithm for multitarget tracking is presented. This algorithm which is based on interacting multiple models incorporates the grey relational grade (GRG) into the particle swarm optimization (PSO). Firstly, the desired tracking accuracy is set for each target. Secondly, sampling intervals are selected as particles, and then the advantage of the GRG is taken as the measurement function for resource management. Meanwhile, the fitness value of the PSO is used to measure the difference between desired tracking accuracy and estimated tracking accuracy. Finally, it is suggested that the radar should track the target whose prediction value of the next sampling interval is the smallest. Simulations show that the proposed method improves both the tracking accuracy and tracking efficiency of the phased-array radar.展开更多
Directed at the problem of occlusion in target tracking,a new improved algorithm based on the Meanshift algorithm and Kalman filter is proposed.The algorithm effectively combines the Meanshift algorithm with the Kalma...Directed at the problem of occlusion in target tracking,a new improved algorithm based on the Meanshift algorithm and Kalman filter is proposed.The algorithm effectively combines the Meanshift algorithm with the Kalman filtering algorithm to determine the position of the target centroid and subsequently adjust the current search window adaptively according to the target centroid position and the previous frame search window boundary.The derived search window is more closely matched to the location of the target,which improves the accuracy and reliability of tracking.The environmental influence and other influencing factors on the algorithm are also reduced.Through comparison and analysis of the experiments,the modified algorithm demonstrates good stability and adaptability,and can effectively solve the problem of large area occlusion and similar interference.展开更多
To track the nonlinear,non-Gaussian bearings-only maneuvering target accurately online,the constrained auxiliary particle filtering(CAPF)algorithm is presented.To restrict the samples into the feasible area,the soft m...To track the nonlinear,non-Gaussian bearings-only maneuvering target accurately online,the constrained auxiliary particle filtering(CAPF)algorithm is presented.To restrict the samples into the feasible area,the soft measurement constraints are implemented into the update routine via the1 regularization.Meanwhile,to enhance the sampling diversity and efficiency,the target kinetic features and the latest observations are involved into the evolution.To take advantage of the past and the current measurement information simultaneously,the sub-optimal importance distribution is constructed as a Gaussian mixture consisting of the original and modified priors with the fuzzy weighted factors.As a result,the corresponding weights are more evenly distributed,and the posterior distribution of interest is approximated well with a heavier tailor.Simulation results demonstrate the validity and superiority of the CAPF algorithm in terms of efficiency and robustness.展开更多
In radar target tracking application, the observation noise is usually non-Gaussian, which is also referred as glint noise. The performances of conventional trackers degra de severely in the presence of glint noise. A...In radar target tracking application, the observation noise is usually non-Gaussian, which is also referred as glint noise. The performances of conventional trackers degra de severely in the presence of glint noise. An improved particle filter, Markov chain Monte Carlo particle filter (MCMC-PF), is applied to cope with radar target tracking when the measurements are perturbed by glint noise. Tracking performance of the filter is demonstrated in the present of glint noise by computer simulation.展开更多
Tracking maneuvering target in real time autonomously and accurately in an uncertain environment is one of the challenging missions for unmanned aerial vehicles(UAVs).In this paper,aiming to address the control proble...Tracking maneuvering target in real time autonomously and accurately in an uncertain environment is one of the challenging missions for unmanned aerial vehicles(UAVs).In this paper,aiming to address the control problem of maneuvering target tracking and obstacle avoidance,an online path planning approach for UAV is developed based on deep reinforcement learning.Through end-to-end learning powered by neural networks,the proposed approach can achieve the perception of the environment and continuous motion output control.This proposed approach includes:(1)A deep deterministic policy gradient(DDPG)-based control framework to provide learning and autonomous decision-making capability for UAVs;(2)An improved method named MN-DDPG for introducing a type of mixed noises to assist UAV with exploring stochastic strategies for online optimal planning;and(3)An algorithm of taskdecomposition and pre-training for efficient transfer learning to improve the generalization capability of UAV’s control model built based on MN-DDPG.The experimental simulation results have verified that the proposed approach can achieve good self-adaptive adjustment of UAV’s flight attitude in the tasks of maneuvering target tracking with a significant improvement in generalization capability and training efficiency of UAV tracking controller in uncertain environments.展开更多
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 env...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.展开更多
基金funded by the National Natural Science Foundation of China,grant number 42074176,U1939204。
文摘Frequency modulated continuous wave(FMCW)radar is an advantageous sensor scheme for target estimation and environmental perception.However,existing algorithms based on discrete Fourier transform(DFT),multiple signal classification(MUSIC)and compressed sensing,etc.,cannot achieve both low complexity and high resolution simultaneously.This paper proposes an efficient 2-D MUSIC algorithm for super-resolution target estimation/tracking based on FMCW radar.Firstly,we enhance the efficiency of 2-D MUSIC azimuth-range spectrum estimation by incorporating 2-D DFT and multi-level resolution searching strategy.Secondly,we apply the gradient descent method to tightly integrate the spatial continuity of object motion into spectrum estimation when processing multi-epoch radar data,which improves the efficiency of continuous target tracking.These two approaches have improved the algorithm efficiency by nearly 2-4 orders of magnitude without losing accuracy and resolution.Simulation experiments are conducted to validate the effectiveness of the algorithm in both single-epoch estimation and multi-epoch tracking scenarios.
基金supported by National Natural Science Foundation of China (Nos.62265010,62061024)Gansu Province Science and Technology Plan (No.23YFGA0062)Gansu Province Innovation Fund (No.2022A-215)。
文摘A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filtering to solve the state of nonlinear mobile target tracking.First,the steps of extended Kalman filtering(EKF)are introduced.Second,the ISO is used to adjust the parameters of the EKF in real time to adapt to the current motion state of the mobile target.Finally,the effectiveness of the algorithm is demonstrated through filtering and tracking using the constant velocity circular motion model(CM).Under the specified conditions,the position and velocity mean square error curves are compared among the snake optimizer(SO)-EKF algorithm,EKF algorithm,and the proposed algorithm.The comparison shows that the proposed algorithm reduces the root mean square error of position by 52%and 41%compared to the SOEKF algorithm and EKF algorithm,respectively.
基金supported by the National Natural Science Foundation of China (61773142)。
文摘An algorithm to track multiple sharply maneuvering targets without prior knowledge about new target birth is proposed. These targets are capable of achieving sharp maneuvers within a short period of time, such as drones and agile missiles.The probability hypothesis density (PHD) filter, which propagates only the first-order statistical moment of the full target posterior, has been shown to be a computationally efficient solution to multitarget tracking problems. However, the standard PHD filter operates on the single dynamic model and requires prior information about target birth distribution, which leads to many limitations in terms of practical applications. In this paper,we introduce a nonzero mean, white noise turn rate dynamic model and generalize jump Markov systems to multitarget case to accommodate sharply maneuvering dynamics. Moreover, to adaptively estimate newborn targets’information, a measurement-driven method based on the recursive random sampling consensus (RANSAC) algorithm is proposed. Simulation results demonstrate that the proposed method achieves significant improvement in tracking multiple sharply maneuvering targets with adaptive birth estimation.
文摘A polynomial model, time origin shifting model(TOSM, is used to describe the trajectory of a moving target .Based on TOSM, a recursive laeast squares(RLS) algorithm with varied forgetting factor is derived for tracking of a non-maneuvering target. In order to apply this algorithm to maneuvering targets tracking ,a tracking signal is performed on-line to determine what kind of TOSm will be in effect to track a target with different dynamics. An effective multiple model least squares filtering and forecasting method dadpted to real tracking of a maneuvering target is formulated. The algorithm is computationally more effcient than Kalman filter and the percentage improvement from simulations show both of them are considerably alike to some extent.
文摘To avoid missing track caused by the target maneuvers in automatic target tracking system, a new maneuvering target tracking technique called threshold interacting multiple model (TIMM) is proposed. This algorithm is based on the interacting multiple model (IMM) method and applies a threshold controller to improve tracking accuracy. It is also applicable to other advanced algorithms of IMM. In this research, we also compare the position and velocity root mean square (RMS) errors of TIMM and IMM algorithms with two different examples. Simulation results show that the TIMM algorithm is superior to the traditional IMM alzorithm in estimation accuracy.
文摘Aim To develop a practical target tracking algorithm for different motion modes. Methods After creation of the new model, it was implemented by computer simulation to prove its performance and compared with the often-used current statistical model. Results The simulation results show that the new IMM (interactive multiple model) have low tracking error in both maneuVering segment and non^Inaneuwi segment while the current statistical model bas muCh higher tracking error in non-maneuvering segment. Conclusion In the point of trackintaccuracy, the new IMM method is much better than the current acceleration method. It can develop into a practical target hacking method.
基金supported by the Fundamental Research Funds for the Central Universities Project(CDJZR10170010)
文摘The mean shift tracker has difficulty in tracking fast moving targets and suffers from tracking error accumulation problem. To overcome the limitations of the mean shift method, a new approach is proposed by integrating the mean shift algorithm and frame-difference methods. The rough position of the moving tar- get is first located by the direct frame-difference algorithm and three-frame-difference algorithm for the immobile camera scenes and mobile camera scenes, respectively. Then, the mean shift algorithm is used to achieve precise tracking of the target. Several tracking experiments show that the proposed method can effectively track first moving targets and overcome the tracking error accumulation problem.
基金Defense Advanced Research Project "the Techniques of Information Integrated Processing and Fusion" in the Eleventh Five-Year Plan (513060302).
文摘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.
基金supported by the National Natural Science Fundationof China(61102109)
文摘To improve the low tracking precision caused by lagged filter gain or imprecise state noise when the target highly maneuvers, a modified unscented Kalman filter algorithm based on the improved filter gain and adaptive scale factor of state noise is presented. In every filter process, the estimated scale factor is used to update the state noise covariance Qk, and the improved filter gain is obtained in the filter process of unscented Kalman filter (UKF) via predicted variance Pk|k-1, which is similar to the standard Kalman filter. Simulation results show that the proposed algorithm provides better accuracy and ability to adapt to the highly maneuvering target compared with the standard UKF.
基金This project was supported by the National Natural Science Foundation of China (50405017) .
文摘For being able to deal with the nonlinear or non-Gaussian problems, particle filters have been studied by many researchers. Based on particle filter, the extended Kalman filter (EKF) proposal function is applied to Bayesian target tracking. Markov chain Monte Carlo (MCMC) method, the resampling step, ere novel techniques are also introduced into Bayesian target tracking. And the simulation results confirm the improved particle filter with these techniques outperforms the basic one.
基金Supported by Science & Engineering Research Council of Singnpore (0521010037)
文摘Wireless sensor network (WSN) of active sensors suffers from serious inter-sensor interference (ISI) and imposes new design and implementation challenges. In this paper, based on the ultrasonic sensor network, two time-division based distributed sensor scheduling schemes are proposed to deal with ISI by scheduling sensors periodically and adaptively respectively. Extended Kalman filter (EKF) is used as the tracking algorithm in distributed manner. Simulation results show that the adaptive sensor scheduling scheme can achieve superior tracking accuracy with faster tracking convergence speed.
基金Supported by the National Science Foundation of China(61472289)Hubei Province Science Foundation(2015CFB254)
文摘Target tracking is very important in computer vision and related areas. It is usually difficult to accurately track fast motion target with appearance variations. Sometimes the tracking algorithms fail for heavy appearance variations. A multiple template method to track fast motion target with appearance changes is presented under the framework of appearance model with Kalman filter. Firstly, we construct a multiple template appearance model, which includes both the original template and templates affinely transformed from original one. Generally speaking, appearance variations of fast motion target can be covered by affine transformation. Therefore, the affine tr templates match the target of appearance variations better than conventional models. Secondly, we present an improved Kalman filter for approx- imate estimating the motion trail of the target and a modified similarity evaluation function for exact matching. The estimation approach can reduce time complexity of the algorithm and keep accuracy in the meantime. Thirdly, we propose an adaptive scheme for updating template set to alleviate the drift problem. The scheme considers the following differences: the weight differences in two successive frames; different types of affine transformation applied to templates. Finally, experiments demonstrate that the proposed algorithm is robust to appearance varia- tion of fast motion target and achieves real-time performance on middle/low-range computing platform.
基金partly supported by the Agency for Science,Technology and Research(A*Star)SERC(No.0521010037,0521210082)
文摘Sensor scheduling is essential to collaborative target tracking in wireless sensor networks (WSNs). In the existing works for target tracking in WSNs, such as the information-driven sensor query (IDSQ), the tasking sensors are scheduled to maximize the information gain while minimizing the resource cost based on the uniform sampling intervals, ignoring the changing of the target dynamics and the specific desirable tracking goals. This paper proposes a novel energy-efficient adaptive sensor scheduling approach that jointly selects tasking sensors and determines their associated sampling intervals according to the predicted tracking accuracy and tracking energy cost. At each time step, the sensors are scheduled in alternative tracking mode, namely, the fast tracking mode with smallest sampling interval or the tracking maintenance mode with larger sampling interval, according to a specified tracking error threshold. The approach employs an extended Kalman filter (EKF)-based estimation technique to predict the tracking accuracy and adopts an energy consumption model to predict the energy cost. Simulation results demonstrate that, compared to a non-adaptive sensor scheduling approach, the proposed approach can save energy cost significantly without degrading the tracking accuracy.
文摘In multiple extended targets tracking, replacing traditional multiple measurements with a rectangular region of the nonzero volume in the state space inspired by the box-particle idea is exactly suitable to deal with extended targets, without distinguishing the measurements originating from the true targets or clutter.Based on our recent work on extended box-particle probability hypothesis density(ET-BP-PHD) filter, we propose the extended labeled box-particle cardinalized probability hypothesis density(ET-LBP-CPHD) filter, which relaxes the Poisson assumptions of the extended target probability hypothesis density(PHD) filter in target numbers, and propagates not only the intensity function but also cardinality distribution. Moreover, it provides the identity of individual target by adding labels to box-particles. The proposed filter can improve the precision of estimating target number meanwhile achieve targets' tracks. The effectiveness and reliability of the proposed algorithm are verified by the simulation results.
基金supported by the Pre-research Fund (N0901-041)the Funding of Jiangsu Innovation Program for Graduate Education(CX09B 081Z CX10B 110Z)
文摘A novel adaptive sampling interval algorithm for multitarget tracking is presented. This algorithm which is based on interacting multiple models incorporates the grey relational grade (GRG) into the particle swarm optimization (PSO). Firstly, the desired tracking accuracy is set for each target. Secondly, sampling intervals are selected as particles, and then the advantage of the GRG is taken as the measurement function for resource management. Meanwhile, the fitness value of the PSO is used to measure the difference between desired tracking accuracy and estimated tracking accuracy. Finally, it is suggested that the radar should track the target whose prediction value of the next sampling interval is the smallest. Simulations show that the proposed method improves both the tracking accuracy and tracking efficiency of the phased-array radar.
基金Supported by the Scholarship of China Scholarship Council(CSC)(201606935043)
文摘Directed at the problem of occlusion in target tracking,a new improved algorithm based on the Meanshift algorithm and Kalman filter is proposed.The algorithm effectively combines the Meanshift algorithm with the Kalman filtering algorithm to determine the position of the target centroid and subsequently adjust the current search window adaptively according to the target centroid position and the previous frame search window boundary.The derived search window is more closely matched to the location of the target,which improves the accuracy and reliability of tracking.The environmental influence and other influencing factors on the algorithm are also reduced.Through comparison and analysis of the experiments,the modified algorithm demonstrates good stability and adaptability,and can effectively solve the problem of large area occlusion and similar interference.
基金supported by the National Natural Science Foundation of China(61773267)the Shenzhen Fundamental Research Project(JCYJ2017030214551952420170818102503604)
文摘To track the nonlinear,non-Gaussian bearings-only maneuvering target accurately online,the constrained auxiliary particle filtering(CAPF)algorithm is presented.To restrict the samples into the feasible area,the soft measurement constraints are implemented into the update routine via the1 regularization.Meanwhile,to enhance the sampling diversity and efficiency,the target kinetic features and the latest observations are involved into the evolution.To take advantage of the past and the current measurement information simultaneously,the sub-optimal importance distribution is constructed as a Gaussian mixture consisting of the original and modified priors with the fuzzy weighted factors.As a result,the corresponding weights are more evenly distributed,and the posterior distribution of interest is approximated well with a heavier tailor.Simulation results demonstrate the validity and superiority of the CAPF algorithm in terms of efficiency and robustness.
文摘In radar target tracking application, the observation noise is usually non-Gaussian, which is also referred as glint noise. The performances of conventional trackers degra de severely in the presence of glint noise. An improved particle filter, Markov chain Monte Carlo particle filter (MCMC-PF), is applied to cope with radar target tracking when the measurements are perturbed by glint noise. Tracking performance of the filter is demonstrated in the present of glint noise by computer simulation.
基金The authors would like to acknowledge National Natural Science Foundation of China(Grant No.61573285,No.62003267)Aeronautical Science Foundation of China(Grant No.2017ZC53021)+1 种基金Open Fund of Key Laboratory of Data Link Technology of China Electronics Technology Group Corporation(Grant No.CLDL-20182101)Natural Science Foundation of Shaanxi Province(Grant No.2020JQ-220)to provide fund for conducting experiments.
文摘Tracking maneuvering target in real time autonomously and accurately in an uncertain environment is one of the challenging missions for unmanned aerial vehicles(UAVs).In this paper,aiming to address the control problem of maneuvering target tracking and obstacle avoidance,an online path planning approach for UAV is developed based on deep reinforcement learning.Through end-to-end learning powered by neural networks,the proposed approach can achieve the perception of the environment and continuous motion output control.This proposed approach includes:(1)A deep deterministic policy gradient(DDPG)-based control framework to provide learning and autonomous decision-making capability for UAVs;(2)An improved method named MN-DDPG for introducing a type of mixed noises to assist UAV with exploring stochastic strategies for online optimal planning;and(3)An algorithm of taskdecomposition and pre-training for efficient transfer learning to improve the generalization capability of UAV’s control model built based on MN-DDPG.The experimental simulation results have verified that the proposed approach can achieve good self-adaptive adjustment of UAV’s flight attitude in the tasks of maneuvering target tracking with a significant improvement in generalization capability and training efficiency of UAV tracking controller in uncertain environments.
基金supported by National Basic Research Program of China (973 Program) (No. 2010CB731800)Key Program of National Natural Science Foundation of China (No. 60934003)Key Project for Natural Science Research of Hebei Education Department(No. ZD200908)
文摘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.