Research Article  Open Access
Yijun Chen, Qun Zhang, Ying Luo, Tat Soon Yeo, "Adaptive Resource Allocation Scheme for Micromotion Feature Extraction Based on TrackBeforeDetect", Journal of Sensors, vol. 2018, Article ID 5301253, 13 pages, 2018. https://doi.org/10.1155/2018/5301253
Adaptive Resource Allocation Scheme for Micromotion Feature Extraction Based on TrackBeforeDetect
Abstract
The micromotion feature extraction method based on trackbeforedetect (TBD) can save the radar resource and improve the realtime performance of micromotion feature extraction by implementing target detecting, tracking, and micromotion feature extraction simultaneously. Usually, multitargets will exist in different areas, and the limited radar resources should be allocated for different areas to achieve the maximal performance of radar. For singlebeam phased array radar, an adaptive resource allocation optimization model is established according to the processing steps of the micromotion feature extraction method based on TBD, and an adaptive resource allocation strategy is proposed. With the method, the radar efficiency can be significantly improved. The effectiveness of the proposed method is demonstrated by simulations.
1. Introduction
With the beam agile ability, multifunction phased array radar (MFPAR) can control the transmit beam pointing flexibly by selecting the most appropriate target area for observation. Reasonable and effective resource scheduling algorithms are important for exploiting the high adaptive potential of MFPARs [1].
Recently, the study on radar resource allocation has drawn extensive attention of scholars [2–10]. In [2], an adaptive ISAR imagingconsidered task scheduling algorithm is proposed, which can improve the radar efficiency by allocating resource for target detecting, tracking, and imaging simultaneously. A time windowbased task scheduling approach for MFPAR is proposed in [3], with a simple but predictive heuristic approach, the latency in the schedules of latenesssensitive tasks can be reduced and the probability of target losses can be lessened. Based on a maximal pulse interleaving technique, an adaptive resource management method for MFPAR is proposed, which can improve the overall capacity of the radar system [4]. Focused on target detecting and tracking, the comparison of two different radar task scheduling methods [5, 6] showed that prioritization is a key component to determining overall performance; thus, a knowledgebased fuzzy logic approach for prioritizing radar tasks was introduced and a resource management method is proposed [7]. With the consideration of both the radial cumulative detection probability and tangential cumulative detection probability, a resource scheduling algorithm for phased array radar in searching mode is proposed in [8], which can minimize the total resource consumption under the guarantee of searching performance. In [9], in terms of multitarget tracking, the radar resource is allocated adaptively according to the tracking accuracy, which can make the actual tracking accuracy approach the expected one. Aimed at the micromotion feature extraction of the target, a radar resource allocation method is proposed in [10], where the micromotion feature of the target can be extracted using tracking pulses with adaptive update rate; thus, the efficiency of the radar system can be improved.
So far, the existing adaptive resource scheduling methods can be classified into two categories [1–11]: for singletype task and for multitype tasks. For singletype task, the resource allocation optimization models are usually established according to the corresponding performance metrics (such as the detection probability for the detecting tasks and the tracking accuracy for the tracking tasks). For multitype tasks, the source allocation optimization models are usually established according to the priority, the expected execution time, the dwell time, the time window, and data update rate of different type tasks.
To save the radar resource and improve the realtime performance of micromotion feature extraction, we have proposed a novel micromotion feature extraction method based on trackbeforedetect (TBD) by establishing an information feedback loop [12], with which the micromotion feature parameters of space target can be extracted concurrently with implementing the target detecting and tracking, both the detection probability and micromotion feature extraction precision are much higher than the traditional methods.
However, multitargets may exist in different areas, and the detecting, tracking, and micromotion feature extraction need to be implemented for different areas simultaneously. In this case, the limited radar resources will be not sufficient to be allocated for every area, and then the allocation contradiction of radar resources becomes serious. A reasonable and effective resource allocation strategy is important for exploiting the performance advantages of the micromotion feature extraction method based on TBD [12]. From the available related works, almost all existing resource scheduling methods are aimed at the traditional radar tasks (such as detecting tasks, tracking tasks, and imaging tasks), and for different radar tasks, the resource allocation model is different which depended on the signal processing steps of different radar tasks. Obviously, the signal processing steps of the micromotion feature extraction method based on TBD is different from that of the traditional radar tasks, because it integrates the detecting, tracking, and micromotion feature extraction together. Therefore, the existing adaptive resource scheduling methods will be not usable. In this paper, according to the processing steps of the micromotion feature extraction method in [12], an adaptive resource allocation strategy is proposed, where the performance of detecting, tracking, and micromotion feature extraction is all considered to establish the resource allocation optimization model. By solving the resource allocation optimization model with intelligent optimization algorithms [13, 14]; the reasonable and effective resource allocation can be achieved.
This paper is organized as follows. The brief recap of the micromotion feature extraction method based on TBD is given in Section 2. The relationship between the performances of target detecting, tracking, and micromotion feature extraction and the radar resource consumption is analyzed in Section 3. The resource allocation optimization model is established and solved in Section 4. Simulations are presented in Section 5 and some conclusions are made in the last section.
2. Micromotion Feature Extraction Method Based on TBD
In this section, the brief principles of the micromotion feature extraction method based on TBD are reviewed, which is the foundation of this paper. The main idea is that micromotion feature parameters are estimated from the acquired curve information based on TBD technology, and in return, the state transition set of TBD has been updated adaptively according to these extracted feature parameters. A single conical target contains a fixed scatterer and two slide scatterers and have been taken as an example, as shown in Figure 1, where , , , , , , and are the precession angle, precession frequency, angle between line of sight (LOS) and axis, radius of the base circle, distance between the target centroid and scatterer , vertical distance between the target centroid and the base circle, and target velocity, respectively.
The projection of , , and in the line of sight direction at time can be represented as , , and , respectively. A feedback loop between micromotion feature extraction and TBD of the target is established, the main steps can be described as follows. The monitoring area is divided into grids according to the range and azimuthal angle with stepped increasement of and , and each grid is denoted as a state . Assume the target consists of observable scatterers. At the kth scan, for each azimuthal angle , selecting any states to form an expanded state , the measured value of is defined as where is the measured value of state . The cumulative energy can be calculated as where is the state transition set, which contains all the possible state which can transit to state . Assume that the number of the cumulative energy which is larger than the detection threshold is . Thus, state sequences will be obtained, and each state sequence contains range trajectories and angle trajectories . Obviously, for the conetip scatterer , the range trajectory should be equal to , for the conebase scatterers and , the estimated range trajectories should be equal to and , respectively. Therefore, the micromotion feature parameters can be extracted via fitting the obtained range trajectory according to the mathematical expression of mD effect (, , and ) with the Levenberg–Marquardt method. In turn, the extracted micromotion feature parameters are utilized to update the parameters of TBD adaptively. The state will belong to the state transition set (i.e., ) when it satisfies where represents the consistency of the micromotion feature parameter vectors between the k − 1th scan and kth scan, , , and are the estimated movement of the three scatters according to the estimated micromotion feature parameters.
In the micromotion feature extraction method based on TBD, the energy accumulation value and the precision of micromotion feature extraction are both taken into full consideration to declare the presence of a target, where the precision of micromotion feature extraction is described by the consistency of the extracted micromotion feature parameter vectors and fitting error . Assume the minimum and maximum total number of scans that are jointly processed in TBD are and , respectively. Two detection thresholds are set: the lower detection threshold and the higher detection threshold . In the kth () scan, if the cumulative energy is larger than , we declare the presence of a target and the micromotion feature parameters can be obtained via fitting the obtained range trajectories. On the other hand, if the cumulative energy is larger than and smaller than , extract the micromotion feature parameter vector at kth scan, which goes on to cumulate energy for the data of scan, and extract the micromotion feature parameters at k + 1th scan. If and are both relatively small (satisfies and ), we can declare the presence of a target and get the micromotion feature parameters. The energy accumulation is no longer needed. Otherwise, updating the state transition set according to the extracted micromotion feature parameters (3) and the energy accumulation of the data of k + 2th scan is needed. Repeat the steps described above until it satisfies and or , or when it reached the scan.
3. Performance Analysis with Respect to Resource Consumption
Usually, multitargets may exist in different areas, and the limited resources should be allocated for each area according to the performance of detecting, tracking, and micromotion feature extraction. That means more resources should be allocated for the area which is of higher probability of target existence, and if the energy accumulation value or the precision of micromotion feature extraction is high enough to declare the presence of the target and obtain the accurate micromotion parameters, less resources will be further allocated to the area. Therefore, to achieve the adaptive resource allocation, the performance of detecting, tracking, and micromotion feature extraction with respect to resource consumption should be analyzed firstly.
The probability density function of cumulative energy can be calculated, respectively, under two different conditions: one is that only noise exists in the searching gate, the other is that target exists in the searching gate.
The size of is denoted as that means there are states in the searching gate which can transit to state . If the state is noise, the probability density function of measured value is denoted as . If the state is the target, the probability density function of measured value is denoted as .
For the first condition (i.e., only noise exists), all the states in are noise states. Assume that is independent and identically distributed for each , and the distribution function is denoted as . The distribution function of can be represented as , and the corresponding probability density function can be calculated by derivation:
Without loss of generality, and are independent; thus, the probability density function of can be calculated as where denotes convolution operation.
For the second condition (i.e., target exists), contains noise states and one target state. The target state is denoted as , the probability density function of is denoted as , and the corresponding distribution function is . The noise states are independent and identically distributed with the distribution function of . Then, the probability density function of can be calculated as
Thus, the probability density function of can be calculated as
In theory, the expression of the probability density function can be obtained according to (4), (5), (6), and (7). However, the analytical expression of is too complicated; thus, it is difficult to be calculated. Therefore, assume obeys the normal distribution [14], and the mean and variance of for the two conditions above can be calculated as follows.
For the first condition, assume the measured value of the noise state obeys the standard normal distribution, where the mean and the variance . Assume the cumulative energy of the noise state obeys the normal distribution, where the mean and variance are denoted as and , respectively. The mean and variance of the maximum of random variables which are independent and identically distributed with are denoted as and , it holds where where and are the probability density function and the distribution function of the standard normal distribution, respectively. Similarly, it holds where
According to (2), the recurrence formulas of the mean and variance of can be obtained as
At the first scan, is equal to ; therefore, it holds and . Then, the mean and variance of at each scan can be calculated according to (12) and (13), it means the probability density function of can be obtained and denoted as .
For the second condition, assume the measured value of the target state obeys the normal distribution, where the mean is and the variance is . Assume the cumulative energy of the target state obeys the normal distribution, where the mean and variance are denoted as and , respectively. Assume the cumulative energy of the noise state obeys the normal distribution, where the mean and variance are denoted as and , respectively. The defined variables as follows:
According to (2), the recurrence formulas of the mean and variance of can be obtained as
At the first scan, it holds and . Then, the probability density function of the cumulative energy of target state at each scan can be obtained and denoted as.
A binary probability hypothesis is defined as follows:
Obviously, the prior probability of can be obtained and denoted as and according to and . When , where is a very small neighborhood radius, and can be calculated as
Further, the posterior probability of can be calculated according to Bayesian theory where and are the prior probability of target exist and target not exist, respectively. When and are known, the posterior probability of target existence can be calculated according to . However, in practice, and are usually unknown. Therefore, the posterior probability of target existence is described by in this paper. Divide (19) by (20):
Obviously, the larger the is, the higher posterior probability of target existence is. Because of and , when , decreases monotonically and increases monotonically over . Therefore, increases monotonically, and we can think that the higher is, the higher posterior probability of target existence is. When or , the monotonic of is uncertain. Assume that there are H areas that need to be observed, the cumulative energy of the hth area is denoted as . Normalize and define the posterior probability of target existence in each area as
In fact, the posterior probability of the target existence in each area is calculated to guide the resource allocation strategy, that is, we want to allocate more resource for the area in which the posterior probability of target existence is higher. For the areas in which the cumulative energy satisfies , we can think that the higher means the higher posterior probability of target existence due to the monotonic increasing of , and more resources should be allocated; thus, is in proportion to as shown in (22). However, for the areas in which the cumulative energy satisfies , it is hard to determine the posterior probability of target existence according to because the monotonic of is uncertain. Therefore, for these areas, the equal distribution strategy of radar resource is considered, and the of these areas are equal to each other as shown in (22), which means the same resource will be allocated. Similarly, the equal distribution strategy is utilized for the areas in which the cumulative energy satisfies .
It should be noticed that the posterior probability of target existence shown as (22) is calculated with the only consideration of the cumulative energy . However, in the micromotion feature extraction method based on TBD, the energy accumulation value and the precision of micromotion feature extraction are both taken into full consideration to declare the presence of a target. Therefore, the final assessment function of target existence should include two aspects: one is the posterior probability of target existence shown in (22) which is calculated according to the energy accumulation value, and the other is the precision of micromotion feature extraction.
The micromotion feature parameters are extracted by fitting the obtained range trajectory according to the mathematical expression of mD effect. Thus, the performance of micromotion feature extraction depends on the target tracking performance. At the kth scan, the range state of target scatters can be represented as , the measured value of is denoted as , and the measured value vector of range state can be represented as . All the measured value vectors of the former k scans are denoted as , then the posterior probability of can be represented as where
Equations (23), (24), and (25) describe a recursion solving method to obtain , and we can see that the factors which will influence the posterior probability are and , where is the probability density function of the measured value of range state and is the probability density function of range state transition. Both and obey normal distribution: where is the variance of measurement of the pth observable scatterer, and is the correlation coefficient between the measurements of the p_{1}th and p_{2}th observable scatterer. Without loss of generality, the measurement of each observable scatterer has the same variance; thus, we can denote , and the CramerRao lower bound (CRLB) of can be represented as where is the velocity of electromagnetic wave, is the mean square bandwidth, and is the SNR of the echo signal, which is proportional to the dwell time .
In (27), is the revisit time interval of observation for the target. represents the micromotion feature parameter vector, and is the state transition function defined as where can be represented as where is the variance of state noise of the pth observable scatterer with unit time during target moving, and is the correlation coefficient between the state noises of the p_{1}th and p_{2}th observable scatterer. Similar with , we can denote .
On the basis, the tracking error at the kth scan can be calculated as where represents the true range state of the target at the kth scan. Because the micromotion feature parameters are extracted by fitting the obtained range trajectory, the precision of micromotion feature extraction can be described by . The higher is, the lower precision of micromotion feature extraction is. However, in terms of (33), the true range state of the target at each scan is hard to be known; thus, the precision of micromotion feature extraction can only be described by the consistency of the extracted micromotion feature parameter vectors and fitting error , alternatively. The consistency and fitting error of the hth area are denoted as and , respectively. Then, the precision of micromotion feature extraction in each area can be defined as where and are the normalized consistency and fitting error.
Based on the analysis above, the assessment function of target existence should be defined with the variables and , and the limited radar resource should be allocated for the H areas according to the assessment function value of target existence of each area.
In addition, from (12) to (13), (15) to (16), (21) to (22), and (26) to (33), we can get the conclusion that the larger dwell time and smaller revisit time interval will bring in the better performances of target detection and micromotion feature extraction.
Therefore, in the adaptive resource allocation strategy proposed in this paper, the higher assessment function value of target existence is, the more resource (larger dwell time and smaller revisit time interval ) will be allocated.
4. Adaptive Resource Allocation Scheme
Just as discussed above, the idea of resource allocation is that for the area in which target exists with higher probability, the more resource will be allocated. As a result, the target will be detected with higher probability and the precision of micromotion feature extraction will be higher. According to the performance analysis given in Section 3, the assessment function of target existence can be defined as where represents the assessment value of target existence in the hth area, and is a micromotion judgment function defined as
In (35), if the cumulative energy is larger than or the micromotion feature extraction results satisfy and , we can declare the presence of a target and set the assessment value as 3; in this case, the radar resources will not be allocated for the area in the next scheduling interval. If the cumulative energy is larger than and smaller than , the assessment value is determined by the normalized posterior probability of target existence and the normalized precision of micromotion feature extraction . However, a space target can be in two states: micromotion or no micromotion. Thus, the micromotion judgment function is introduced. If the micromotion feature extraction precision cannot reach the thresholds and , only the posterior probability of target existence which is calculated according to the energy accumulation value will be used to calculate the assessment function value, and only if the micromotion feature extraction precision can reach the thresholds, the micromotion feature extraction results will be considered into the calculation of the assessment function value. In a word, whether the target exhibits or does not exhibits micromotion, the assessment function of the target existence can be calculated adaptively according to the target state. If the cumulative energy is smaller than , the micromotion feature extraction will not be implemented; thus, the assessment function only contains the term of normalized posterior probability of target existence .
Without loss of generality, we hope that the areas with higher assessment values will be observed with higher probability, the number of areas which can be observed is as more as possible, and the vacant time of radar transmitter is as little as possible. In addition, for the observed areas, the allocated resources for each area are desired to be proportional to the assessment value as far as possible (i.e., the more resources can be allocated for the areas with higher assessment value; thus, the higher performance of target detecting and micromotion feature extraction can be achieved).
Therefore, four objective functions are defined for the resource allocation strategy: (1)The sum of assessment value of the areas which can be observed, defined by where is the number of areas which can be observed.(2)The ratio of the areas which can be observed to the total areas which need to be observed, defined by (3)The resource utilization rate, defined by where is the scheduling time interval, is the number of revisits for the hth area, and is the dwell time of the n_{h}th revisit for the hth area.(4)The proportion of resource allocation, defined by where indicates the variance of . is used to make the allocated resources for each area to be proportional to the assessment value as far as possible. However, compared with the former three objective functions (i.e., SAV, ROA, and RUR), is less important for the resource allocation strategy.
In this paper, the number of revisits , the dwell time of each revisit, and the revisit time interval sequence are treated as the optimization variables of the resource allocation. In view of the above objective functions, the stratified resource allocation optimization model with the optimization variables of , , and is proposed as follows: where and are the priority marks. Solving to obtain the Pareto solution set firstly and then the optimal solution can be obtained by solving based on the obtained Pareto solution set of . Constraint (41a) represents that the total resources allocated for all the observed areas are not beyond the available time resources. In constraint (41b), for the hth area, is the maximum time interval between any two adjacent elements in , and is the extracted rotating frequency obtained from the previous scheduling interval. It should be pointed out that if it is the first time to extract the micromotion feature parameter in the scheduling interval, is set as the maximum possible value of target rotating frequency, which is set as rad/s in this paper. Generally, fitting the sinusoidlike curve requires that data intervals should be smaller than the quarter of the curve period, which can be guaranteed by constraint (41b). In constraint (41c) and (41d), and are the required minimum dwell time and number of revisits for the observed areas.
To get the optimal solution of the resource allocation optimization model shown as (41), the optimization problem of should be solved firstly, which is a multiobjective problem (MOP). The nondominated sorting genetic algorithm II (NSGAII) is one of the most widely applied multiobjective evolutionary algorithms, outperforming other multiobjective evolutionary algorithms such as ParetoArchived Evolution Strategy (PAES) and StrengthPareto Evolutionary Algorithm [15, 16]. Therefore, NSGAII is adopted to solve in this paper.
NSGAII combines the genetic algorithm, the concept of nondominance, and the crowded distance estimation together [17, 18], and the concrete steps of the solving based on NSGAII can be described as follows.
Step 1 (population initialization). In genetic algorithm, each individual of the population presents a problem solution called chromosome [19]. In this paper, the optimization variables are the number of revisits , the dwell time , and the revisit time interval sequence for H areas which need to be observed. The scheduling time interval can be divided into time segments according to pulse repetition frequency (PRF) of the radar system. Therefore, the chromosome can be described by a time assignment string of length , and each element of the string includes two parts: the first part represents the area which will be observed at the corresponding time segment, and the second part represents if it is the first pulse of a certain revisit. Obviously, the time assignment string (i.e., chromosome) contains all the information of the number of revisits , the dwell time and the revisit time interval sequence for H areas. The goal of NSGAII is to obtain the optimal chromosome which is corresponding to the optimal resource allocation results.
Set the maximum generation number as and initialize the generation number and the population of size .
Step 2 (nondominated sorting and crowding distance calculation). Sorting the population according to the nondomination criteria and assigning the Pareto rank of each individual as , which indicates the number of solutions that dominated to the individual [16]. The different nondominated fronts can be formed by all the individuals which satisfies . To maintain the population diversity in each nondominated front, the crowding distance of each individual is assigned as [15].
Step 3 (offspring population generation). Generating the offspring population of size from with the genetic operators. Firstly, the binary tournament selection should be operated, which can be described as two individuals being selected randomly, and then both the Pareto rank and the crowding distance are taken into consideration to judge the winner; the winner is the individual having the smaller Pareto rank; if the Pareto rank is the same for both individuals, the winner is the individual having the higher crowding distance [15]. On this basis, the crossover and mutation operation [20] is taken on the selected individuals, and then the offspring population can be obtained.
Step 4 (recombination and new population generation). Combining and to create a population of size , for which the nondominated fronts are formed and the crowding distance of each individual is calculated as described in Step 2. On this basis, the new generation is filled as follows. Firstly, initialize the generation and , while fills and let . Then, all the individuals in the front are sorted descending according to the crowding distance. Finally, the first elements in the sorted front are filled into . So far, the new generation is obtained.
Set , if , repeat Step 2 to Step 4; if , iteration ends and the front is the Pareto optimal solution set for the optimization problem shown as in (41).
On the obtained Pareto optimal solution set for , the genetic algorithm is adopted to solve the optimization problem shown as in (41). As a result, the Pareto optimal solution set of the resource allocation optimization model shown as (41) can be obtained. Finally, the most suitable resource allocation result can be selected from the Pareto optimal solution set by giving weight vector satisfying for the three objective functions SAV, ROA, and RUR.
5. Simulations
In this section, some simulations are carried out to verify the efficiency of the proposed algorithm. The simulation parameters are set as follows: , , , , , , , , , , , , , , , , , , and , where is the beam width, is the constant used to control the ratio of intersections number to scans number, and are the lower detection threshold coefficient and the higher detection threshold coefficient corresponding to and , is the noise intensity of the white Gaussian noise, and obeys . Assume 5 areas among the areas are with target existence, and the target parameters are shown in Table 1, where “area number” represents which area the target locates in.

The PRF of the radar system is set as 240 Hz; the scheduling time interval of radar resource is set as , and and are set as and , respectively. The time resources are allocated according to the resource allocation optimization model. By giving weight vector , , and , the resource allocation results can be acquired, as shown in Figure 2, and the assessment value of target existence in each area is shown in Figure 3.
(a)
(b)
(c)
(d)
(e)
From Figures 2 and 3, we can see that after the 2nd scheduling interval, area 4 is of the highest assessment value of target existence; thus, the most resources are allocated for area 4 in the 3rd scheduling interval. At the same time, all the areas are observed in the 3rd scheduling interval and allocated resources for each area are almost proportional to the assessment value. After the 6th scheduling interval, both the assessment values of area 4 and area 1 are larger than 1, which means the cumulative energies of these two areas are larger than , and the micromotion feature extraction should be implemented in the 7th scheduling interval. For area 4 and area 1, it is the first time to extract the micromotion feature parameter; thus, should be rad/s in resource allocation optimization model shown as (41). However, the limited radar resources are not enough to be allocated for both area 4 and area 1 to extract the micromotion feature parameter. Because the assessment value of area 4 is larger than that of area 1, more radar resources are allocated for area 4 which satisfies the constraint in (41b), and the micromotion feature extraction can be implemented. For area 1, due to the allocated resources which cannot reach the requirement of sinusoidlike curve fitting, only the energy accumulation can be implemented. After the 8th scheduling interval, the assessment values of area 4 reaches to 3, which means we can declare the presence of a target and get the micromotion feature parameters, and the radar resources will not be allocated for the area in the next scheduling interval. Similarly, in the 9th scheduling interval, the most radar resources are allocated for area 1 which is of the highest assessment value to implement the micromotion feature extraction, and is also set as rad/s in the scheduling interval. After the 9th scheduling interval, the estimated of area 1 is 23.994 rad/s, which is used for the resource allocation in the next scheduling interval and enough resources satisfying the constraint (41b) are allocated for area 1 in the 10th scheduling interval. After the 14th scheduling interval, both the assessment values of area 9 and area 3 are larger than 1; thus, the micromotion feature extraction should be implemented in the next scheduling interval, and enough radar resources are allocated with (obtained in the 14th scheduling interval) for area 9 and rad/s for area 3.
Figure 3 shows that the assessment values of area 4, area 1, area 2, and area 9 reaching to 3; thus, we can declare that the presence of target in area 4, area 1, area 2, and area 9 and the obtained micromotion feature parameters are shown in Tables 2–5, which are closed to the theoretical value.




To demonstrate the efficiency of the proposed algorithm, the equal distribution method and the traditional resource allocation method [8] are considered for comparison. The performance of target detecting and micromotion feature extraction is compared in Table 6.

From Table 6, we can see that 4 targets can be detected with the proposed adaptive resource allocation method, while only 2 targets can be detected with the equal distribution method and traditional resource allocation method. It is because our method is proposed according to the signal processing steps of the micromotion feature extraction method based on TBD, and it utilizes the measurements information and the micromotion feature information together, while the traditional resource allocation method can only utilize the measurement information and the equal distribution method does not utilize any information. What is more, because the constraint in (41b) is not considered in the equal distribution method and traditional resource allocation method, the accurate micromotion feature parameters cannot be obtained; thus, the additional and continuous time resources need to be allocated to implement the micromotion feature extraction. Obviously, our proposed adaptive resource allocation method can detect more targets, obtain higher micromotion feature extraction precision, and improve the radar efficiency.
Finally, the performance of the three resource allocation methods versus the number of observed areas is discussed. The success of target detection and the success of micromotion feature extraction are defined as where is the number of total targets, is the number of detected targets, and is the number of targets for which the estimated error of each micromotion feature parameter is less than 10%. The and versus the number of observed areas are shown in Figure 4, we can see that both and of our method are much higher than other methods.
(a) Success of target detection
(b) Success of micromotion feature extraction
6. Conclusions
In this paper, an adaptive resource allocation strategy for micromotion feature extraction method based on trackbeforedetect is proposed. According to the processing steps, a resource allocation optimization model is established based on the analysis of the performances of target detecting, tracking, and micromotion feature extraction with respect to resource consumption. The simulation results show that the proposed resource allocation strategy can improve the radar efficiency significantly.
However, in this paper, the required minimum dwell time and the number of revisits are set as constants according to the traditional detecting tasks and tracking tasks. If they can be adjusted adaptively according to the radar work conditions, the radar efficiency may be further improved. Also, there are many thresholds in the proposed method, which are determined by experiments. If the expression of the performance of target detecting, tracking, and micromotion feature extraction with the thresholds can be derived, the radar efficiency also may be improved. The related contents will be studied in our future work.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this article.
Acknowledgments
This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61631019, 61471386, and 61571457 and in part by Ministry of Education, Singapore under Grant no. MOE2016T21070.
References
 W. Xiangli, Y. Wei, and K. Lingjiang, “Joint beam selection and dwell time allocation for multitarget tracking in phased array radar system,” Journal of Radars, vol. 6, no. 6, pp. 602–610, 2017. View at: Publisher Site  Google Scholar
 Y. Chen, Q. Zhang, N. Yuan, Y. Luo, and H. Lou, “An adaptive ISARimagingconsidered task scheduling algorithm for multifunction phased array radars,” IEEE Transactions on Signal Processing, vol. 63, no. 19, pp. 5096–5110, 2015. View at: Publisher Site  Google Scholar
 D. S. Jang, H. L. Choi, and J. E. Roh, “A timewindowbased task scheduling approach for multifunction phased array radars,” in 2011 11th International Conference on Control, Automation and Systems, pp. 1250–1255, Gyeonggido, Republic of Korea, October 2011. View at: Google Scholar
 C. Jie, W. Lei, Z. Wei, and Z. Ke, “Multifunction phased radar resource management via maximal pulse interleaving technique,” Arabian Journal for Science and Engineering, vol. 38, no. 11, pp. 3081–3091, 2013. View at: Publisher Site  Google Scholar
 J. M. Butler, MultiFunction Radar Tracking and Control, [Ph.D. thesis], University College London, London, UK, 1998.
 A. J. Orman, C. N. Potts, A. K. Shahani, and A. R. Moore, “Scheduling for a multifunction phased array radar system,” European Journal of Operational Research, vol. 90, no. 1, pp. 13–25, 1996. View at: Publisher Site  Google Scholar
 S. Miranda, C. Baker, K. Woodbridge, and H. Griffiths, “Knowledgebased resource management for multifunction radar: a look at scheduling and task prioritization,” IEEE Signal Processing Magazine, vol. 23, no. 1, pp. 66–76, 2006. View at: Publisher Site  Google Scholar
 J. Wu and T. Cheng, “Research on phased array radar resource management in searching mode,” MATEC Web of Conferences, vol. 59, article 07005, 2016. View at: Publisher Site  Google Scholar
 S. Qing, Z. Qin, and T. Jianfeng, “Research on resource management of phasedarray radar in target tracking,” in 2015 International Conference on Automation, Mechanical Control and Computational Engineering, pp. 150–155, Jinan, China, January 2015. View at: Google Scholar
 Y. Chen, Q. Zhang, C. Ma, Y. Luo, and T. S. Yeo, “Micromotion feature extraction of radar target using tracking pulses with adaptive pulse repetition frequency adjustment,” Journal of Applied Remote Sensing, vol. 8, no. 1, article 083569, 2014. View at: Publisher Site  Google Scholar
 J. Yan, H. Liu, B. Jiu, B. Chen, Z. Liu, and Z. Bao, “Simultaneous multibeam resource allocation scheme for multiple target tracking,” IEEE Transactions on Signal Processing, vol. 63, no. 12, pp. 3110–3122, 2015. View at: Publisher Site  Google Scholar
 Y. Chen, Q. Zhang, Y. Luo, and T. S. Yeo, “Micromotion feature extraction of space target based on trackbeforedetect,” Journal of Sensors, vol. 2017, Article ID 8723042, 14 pages, 2017. View at: Publisher Site  Google Scholar
 L. Li, X. Chen, and X. Xiang, “An intelligent optimization algorithm for joint MCS and resource block allocation in LTE femtocell downlink with QoS guarantees,” in The 2014 5th International Conference on Game Theory for Networks, pp. 1–6, Beijing, China, November 2014. View at: Publisher Site  Google Scholar
 Z. X. Cong, P. C. Li, J. X. Ou, and Z. W. Peng, “A new method of power system load forecasting based on intelligent optimization algorithm,” Advanced Materials Research, vol. 10701072, pp. 1439–1445, 2014. View at: Publisher Site  Google Scholar
 S. Bandyopadhyay and R. Bhattacharya, “Solving multiobjective parallel machine scheduling problem by a modified NSGAII,” Applied Mathematical Modelling, vol. 37, no. 1011, pp. 6718–6729, 2013. View at: Publisher Site  Google Scholar
 A. MartínezVargas, J. DomínguezGuerrero, and Á. G. Andrade, “Application of NSGAII algorithm to the spectrum assignment problem in spectrum sharing networks,” Applied Soft Computing, vol. 39, pp. 188–198, 2016. View at: Publisher Site  Google Scholar
 Y. Yusoff, M. S. Ngadiman, and A. M. Zain, “Overview of NSGAII for optimizing machining process parameters,” Procedia Engineering, vol. 15, pp. 3978–3983, 2011. View at: Publisher Site  Google Scholar
 M. Shaygan, A. Alimohammadi, and A. Mansourian, “Spatial multiobjective optimization approach for land use allocation using NSGAII,” IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, vol. 7, no. 3, pp. 906–916, 2014. View at: Publisher Site  Google Scholar
 Y. J. Chen, Q. Zhang, Y. Luo, and Y. A. Chen, “Measurement matrix optimization for ISAR sparse imaging based on genetic algorithm,” IEEE Geoscience and Remote Sensing Letters, vol. 13, no. 12, pp. 1875–1879, 2016. View at: Publisher Site  Google Scholar
 P. Vivekanandan, M. Rajalakshmi, and R. Nedunchezhian, “An intelligent genetic algorithm for mining classification rules in large datasets,” Computing and Informatics, vol. 32, no. 1, 2013. View at: Google Scholar
Copyright
Copyright © 2018 Yijun Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.