Skip to main content
. 2019 Sep 18;19(18):4033. doi: 10.3390/s19184033
Algorithm 1 Position Estimation with the Proposed Algorithm
1. Initialization
Generate grids Gx,yt|t=0 for x=1, , X and y=1, , Y, considering the coverage and performance of the radar system. For example, in our radar system, one grid is a square of 0.2 m2.
2. For x=1, , X and y=1, , Y, calculate the cumulative likelihood as follows:
Gx,yt=Gx,yt1i=1Nk=1M(px,y|zi,k) , (8)
(px,y|zi,k) is the likelihood function of a particular point px,y in grids, when the kth target is detected by the ith radar. Gx,yt, which is the grid value at time t, is generated by recursively exploiting Gx,yt1. A probability of target existence of a particular point can be shown through these generated grids Gx,yt.
3. For x=1, , X and y=1, , Y, normalize the cumulative likelihood for recursive operation as follows:
Gx,yt=Gx,ytx=1Xy=1YGx,yt, (9)
The normalizing process is required to make the sum of grids is to be one, and determine the effectivity of grids regarding re-initialization.
4. Find the coordinates over the threshold to estimate the location of multiple targets such that
Gx,yt>Gthresh ,
Gthresh is set adaptively according to the average number of targets detected by the radars. This is because if there is a large number of targets detected by the radars, the value of normalized probability of target existence represented by the cumulative likelihood will be reduced.
5. Calculate the effectivity of grids as follows:
Neff=1x=1Xy=1Y(Gx,yt)2 , (10)