scholarly journals Demanded Dwell Time Reduction Based on Prior RCS Fluctuation Constraint in Target Tracking

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Zijian Wu ◽  
Fei Wang ◽  
Jianjiang Zhou
Keyword(s):  
Target Tracking ◽  
Dwell Time ◽  
Search Algorithm ◽  
Prediction Method ◽  
Airborne Radar ◽  
Multiple Model ◽  
Frequency Method ◽  
Tracking Process ◽  
Fluctuation Range ◽  
Probability Prediction

In the field of airborne radar resource management, one of the most accessible solutions to enhance the power of modern radar system is to save target tracking time as much as possible. During the target tracking process, it is effective to utilize the prior knowledge of the radar cross section (RCS) of the target to save airborne radar resource. Since the target RCS is sensitive to frequency and attitude angle, it is difficult to predict the target RCS accurately. This paper proposes an effective way to save airborne radar time resource in the target tracking process by changing radiation frequency of airborne radar to tolerate certain RCS fluctuation. Firstly, based on the tolerable fluctuation range of the target RCS, this paper designs an effective search algorithm to minimize the frequency set while maximizing the average RCS within the limited fluctuation range. Secondly, the detection probability prediction phase is renewed by taking the RCS fluctuation into account in order to reduce the radar dwell time. Finally, by using interactive multiple model Kalman filter (IMMKF) algorithm, a target tracking procedure with the minimum dwell time prediction method is proposed. Simulation results show that the proposed method is effective. As for target tracking simulation of three different trajectories, the proposed method can save at best 81.35% more dwell time than the fixed frequency method.

scholarly journals Research on Target Tracking Algorithm Based on Siamese Neural Network

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Haibo Pang ◽  
Qi Xuan ◽  
Meiqin Xie ◽  
Chengming Liu ◽  
Zhanbo Li
Keyword(s):  
Neural Network ◽  
Target Tracking ◽  
Evaluation Criteria ◽  
Attention Mechanism ◽  
Tracking Algorithm ◽  
Temporal Attention ◽  
Tracking Accuracy ◽  
Current Frame ◽  
Tracking Process ◽  
Recognition Ability

Target tracking is a significant topic in the field of computer vision. In this paper, the target tracking algorithm based on deep Siamese network is studied. Aiming at the situation that the tracking process is not robust, such as drift or miss the target, the tracking accuracy and robustness of the algorithm are improved by improving the feature extraction part and online update part. This paper adds SE-block and temporal attention mechanism (TAM) to the framework of Siamese neural network. SE-block can refine and extract features; different channels are given different weights according to their importance which can improve the discrimination of the network and the recognition ability of the tracker. Temporal attention mechanism can update the target state by adjusting the weights of samples at current frame and historical frame to solve the model drift caused by the existence of similar background. We use cross-entropy loss to distinguish the targets in different sequences so that their distance in the feature domains is longer and the features are easier to identify. We train and test the network on three benchmarks and compare with several state-of-the-art tracking methods. The experimental results demonstrate that the algorithm proposed is superior to other methods in tracking effect diagram and evaluation criteria. The proposed algorithm can solve the occlusion problem effectively while ensuring the real-time performance in the process of tracking.

Sensor cooperative scheduling method for low-altitude maneuvering target tracking in complex environment

Sensor Review ◽  
2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Yunpu Zhang ◽  
Gongguo Xu ◽  
Ganlin Shan
Keyword(s):  
Target Tracking ◽  
Sensor Scheduling ◽  
Multiple Model ◽  
Complex Environment ◽  
Tracking Accuracy ◽  
Content Type ◽  
Target State ◽  
Maneuvering Targets ◽  
Scheduling Method ◽  
Low Altitude

Purpose Continuous and stable tracking of the low-altitude maneuvering targets is usually difficult due to terrain occlusion and Doppler blind zone (DBZ). This paper aims to present a non-myopic scheduling method of multiple radar sensors for tracking the low-altitude maneuvering targets. In this scheduling problem, the best sensors are systematically selected to observe targets for getting the best tracking accuracy under maintaining the low intercepted probability of a multi-sensor system. Design/methodology/approach First, the sensor scheduling process is formulated within the partially observable Markov decision process framework. Second, the interacting multiple model algorithm and the cubature Kalman filter algorithm are combined to estimate the target state, and the DBZ information is applied to estimate the target state when the measurement information is missing. Then, an approximate method based on a cubature sampling strategy is put forward to calculate the future expected objective of the multi-step scheduling process. Furthermore, an improved quantum particle swarm optimization (QPSO) algorithm is presented to solve the sensor scheduling action quickly. Optimization problem, an improved QPSO algorithm is presented to solve the sensor scheduling action quickly. Findings Compared with the traditional scheduling methods, the proposed method can maintain higher target tracking accuracy with a low intercepted probability. And the proposed target state estimation method in DBZ has better tracking performance. Originality/value In this paper, DBZ, sensor intercepted probability and complex terrain environment are considered in sensor scheduling, which has good practical application in a complex environment.

scholarly journals Dwell Time Allocation Algorithm for Multiple Target Tracking in LPI Radar Network Based on Cooperative Game

Sensors ◽  
2020 ◽  
Vol 20 (20) ◽  
pp. 5944
Author(s):  
Chenyan Xue ◽  
Ling Wang ◽  
Daiyin Zhu
Keyword(s):  
Target Tracking ◽  
Cooperative Game ◽  
Time Allocation ◽  
Dwell Time ◽  
Nash Bargaining ◽  
Multiple Target Tracking ◽  
Multiple Target ◽  
Allocation Algorithm ◽  
Radar Network ◽  
Target Allocation

To solve the problem of dwell time management for multiple target tracking in Low Probability of Intercept (LPI) radar network, a Nash bargaining solution (NBS) dwell time allocation algorithm based on cooperative game theory is proposed. This algorithm can achieve the desired low interception performance by optimizing the allocation of the dwell time of each radar under the constraints of the given target detection performance, minimizing the total dwell time of radar network. By introducing two variables, dwell time and target allocation indicators, we decompose the dwell time and target allocation into two subproblems. Firstly, combining the Lagrange relaxation algorithm with the Newton iteration method, we derive the iterative formula for the dwell time of each radar. The dwell time allocation of the radars corresponding to each target is obtained. Secondly, we use the fixed Hungarian algorithm to determine the target allocation scheme based on the dwell time allocation results. Simulation results show that the proposed algorithm can effectively reduce the total dwell time of the radar network, and hence, improve the LPI performance.

Sign in / Sign up

Export Citation Format

Share Document