CN104750998B - Target tracking method of passive multi-sensor based on density filter - Google Patents
Target tracking method of passive multi-sensor based on density filter Download PDFInfo
- Publication number
- CN104750998B CN104750998B CN201510166369.4A CN201510166369A CN104750998B CN 104750998 B CN104750998 B CN 104750998B CN 201510166369 A CN201510166369 A CN 201510166369A CN 104750998 B CN104750998 B CN 104750998B
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- msubsup
- msup
- mfrac
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Abstract
, can not be the problem of the noise intensity unknown accurate tracking multiple target with the newborn unknown situation progress of target to solve prior art the invention discloses a kind of passive multi-sensor multi-object tracking method based on density filter.Its implementation is:Corresponding coordinate under passive multi-sensor bearingonly measurement is obtained by the least square Cross Location Method based on Newton iteration first, and the coordinate at former and later two moment is associated, newborn object set is obtained;Secondly, newborn target sample collection is produced according to the distribution of the state of newborn target;Then multiple target tracking is carried out using density filter.The present invention can not only quickly obtain newborn target sample collection, reduce target sample number, improve target following efficiency, and noise intensity can be updated in real time, available for multiple target tracking while dbjective state is estimated.
Description
Technical field
The invention belongs to technical field of guidance, it is related to unknown newborn multiple target tracking, specifically a kind of passive multi-sensor
Method for tracking target, available for systems such as infrared guidances.
Background technology
The basic object of target following is the number according to the measurement set estimation current goal for mixing clutter and noise
And state.Due to the appearance of target, disappearance and the presence of target derivatization process, the number of each moment target may all occur
Change.Passive multi-sensor can not obtain the range information of target, and its target information obtained is usually the azimuth of target
With pitching angle information, passive multi-sensor target following is substantially a Nonlinear Tracking problem, how by nonlinear filtering
It is always the focus and difficult point of academia and engineer applied area research applied to passive multi-sensor target following.
The probability hypothesis density filtering and density filter realized based on particle method are solving Nonlinear Multiobjective tracking
There is preferably application in problem.Although probability hypothesis density filtering can be good at being applied to passive multi-sensor target following
In problem, but its newborn dbjective state is known a priori, and can not estimate to measure noise intensity in real time.Density filter is used
Continuously-discrete space represents new life and the extinction of target by the mutual conversion of continuous space and discrete space to Target Modeling,
Estimation noise intensity can be measured while target is tracked.Although density filter can obtain new by region uniform sampling
Raw target information, but population can be sharply increased with the expansion of target area, the missing inspection situation when particle density is relatively low
Than more serious, when particle density is big compared with high hour operation quantity, track less efficient.
The content of the invention
It is an object of the invention to for problem above, propose a kind of passive multi-sensor target based on density filter
Tracking, target is accurately tracked by realize under the unknown newborn unknown situation with target of noise intensity.
Realizing the key of the technology of the present invention is:, will be by using many base least square cross bearingses based on Newton iteration
The azimuth that dynamic multisensor is obtained is converted into coordinate;The velocity interval setpoint distance threshold value moved according to target, by continuous two
Coordinate points of the individual moment distance in threshold range are considered as newborn target point.
According to above-mentioned thinking, implementation steps of the invention include as follows:
(1) initial time t=0 is made, is that sensor produces N according to the initial distribution of dbjective statet|tIndividual initial sample structure
Into target sample collection:Wherein,I-th of target sample of t is represented,Represent t i-th
The intensity of target sample;
If initial time is without newborn target, i.e., newborn target sample collectionFor empty set, wherein,Table
Show i-th of newborn target sample of t,Represent the intensity of i-th of newborn target sample of t, JtRepresent that t is newborn
Target sample number;
(2) the target sample collection of t is mergedWith newborn target sample collectionObtain
New set:WhereinWithI-th of sample after merging and its intensity are represented respectively;
(3) whether be empty, if the sample set after merging is sky, perform step if judging the sample set after t merging
(9) step (4), otherwise, is performed;
(4) the merging sample set obtained according to (2)It is pre- to the t+1 moment that t is calculated with state equation
Survey sample setWherein,T is represented to i-th of forecast sample of t+1 moment,Represent
The intensity of i-th of forecast sample, Nt+1|t=Nt|t+JtRepresent forecast sample number;
(5) according to forecast sample collectionWith t without goal hypothesis intensity ft|tWhen (φ) predicts t+1
Carve without goal hypothesis intensity ft+1|t(φ);According to forecast sample collectionWith the measurement collection at t+1 momentPredict the measurement intensity at t+1 momentWherein,Represent that the t+1 moment measures for j-th, Nz,t+1Represent t
The measurement number at+1 moment;
(6) by measurement intensityWith measurement likelihoodCalculate the probability W that target is presentj, work as Wj> τ
When, it is believed that target is present, and estimates dbjective stateWherein, τ is the given threshold that target is present;
(7) prediction is updated respectively without goal hypothesis intensity ft+1|t(φ) and forecast sample collectionObtain t+
1 moment without goal hypothesis intensity ft+1|t+1(φ) and sample set
(8) following parameter is obtained according to the result of step (7):
8a) to the sample set after renewalIn intensity summation, obtain the number of targets that the t+1 moment estimates
Desired value ηt+1;
8b) using without goal hypothesis intensity ft+1|t+1(φ) and forecast sample number Nt+1|t, calculate resampling sample number
Nt+1|t+1;
8c) using without goal hypothesis intensity ft+1|t+1(φ), without goal hypothesis transition probability ψt+1(φ | φ) and pre- test sample
This number Nt+1|tCalculate newborn sample number Jt+1;
8d) from sample setMiddle resampling Nt+1|t+1Individual sample, the sample set after being sampled:
(9) newborn coordinates of targets and newborn target velocity are calculated:
Many base least square cross bearingses 9a) are utilized, all measurements at t and t+1 moment are converted into coordinate, point
It is not expressed asWithFilter out all satisfactionsCoordinate, structure
Into newborn coordinates of targets collection:Wherein,WithRepresent that t and t+1 moment measure for j-th respectively
The coordinate of conversion,WithJ-th of newborn coordinates of targets of t and t+1 moment, ε are represented respectivelyminAnd εmaxDifference table
Show apart from lower limit and apart from the upper limit, NzFor all coordinate numbers for meeting condition;
The speed of newborn target 9b) is calculated according to the coordinate of newborn target:Wherein, Δ T
Represent time interval;
(10) according to newborn coordinates of targets collectionWith speed collectionConstitute newborn object setWhether be empty, if it is empty, then in target region [a if judging newborn object setx,bx]*[ay,by] in uniformly adopt
Sample Jt+1Individual target sample;Otherwise, each newborn target is distributed as according to the state of newborn target to produceIndividual target sample,
Constitute newborn target sample collectionWherein,Represent newborn target strength;
(11) t=t+1 is made, return to step (2) continues to track target.
The present invention has advantages below:
1) bearingonly measurement is converted into coordinate, utilizes seat by the present invention due to using many base least square cross bearingses
Information is marked, all coordinate points met in threshold range are judged as newborn target point, and newborn target velocity is estimated, because
And can be in the case where newborn target is unknown, the newborn target of optional position in tracing area.
2) present invention is due to using the estimation to newborn coordinates of targets, reducing sample used in object tracking process
Number, reduces operand, improves operational efficiency.
Brief description of the drawings
Fig. 1 be the present invention realize general flow chart;
Fig. 2 is the least square cross bearing sub-process figure based on Newton iteration in the present invention;
Fig. 3 is the scene graph that the present invention is emulated;
Fig. 4 (a) is the trajectory diagram with present invention tracking target;
Fig. 4 (b) is the target number figure estimated with the present invention;
Fig. 5 (a) is the dbjective state OSPA Error Graphs estimated with the present invention;
Fig. 5 (b) is the target velocity OSPA Error Graphs estimated with the present invention;
Fig. 6 (a) is with target sample number figure used in present invention tracking object procedure;
Fig. 6 (b) is the run time figure of the present invention.
Embodiment
First, basic theory introduction
1. system equation
Under cartesian coordinate system, system mode takes x, the position in y directions and speed, can set up following Nonlinear Dynamic
System model:
xt+1=Fxt+Get 1)
zt=h (xt)+wt 2)
Wherein, xt=[xt,vx,t,yt,vy,t]T, T represents transposition, xt,ytRepresent target on x directions and y directions respectively
Coordinate, vx,t,vy,tSpeed of the target on x directions and y directions is represented respectively, and subscript t ∈ [1, N] represent time, state-noise
etObeying variance isZero-mean gaussian distribution, diag [@] represent diagonalization element therein, σxAnd σy
Represent that location criteria is poor, F, G is respectively state-transition matrix and input matrix, and h is nonlinear function, measure noise wtObedience side
Difference is distributed for R zero-mean gaussian, etWith wtIt is separate, ztFor the measuring value of sensor.
In the present invention assume passive sensor can only observed object azimuth information, therefore nonlinear function h definition such as
Under:
Wherein, arctan () represents arc tangent, xs,ysFor the position of sensor.
2. more than base least square cross bearing
Assuming that many base station s1,s2,…,snCan obtain the orientation angle measurements of target at each moment, the measurement of t to
Measure Z=[θt1,θt2,…,θtn], the actual position X=[x of targett,yt], the position of many base stations is (xs1,ys1),(xs2,
ys2),…,(xsn,ysn)。
By formula 2) measurement model that can obtain alignment system is:
Z=h (X)+wθ 4)
Wherein nonlinear function is:
wθFor observation noise vector, wθ=[wθ1,wθ2,…,wθn]T, wθiFor the observation noise of i-th of base station;
According to the definition w of least squareθ TPwθ=min, then state vector X estimateMeet:
Wherein, min represents minimum, and P is covariance matrix, due to ZTZ be a constant, therefore formula 6) be equivalent to target letter
Number:
Formula 7) be many base least square cross bearing systems least-squares estimation model.
Formula 7) a certain approximate solution can be approached by Newton iterative method recursion so that
Wherein, → represent infinite approach, the approximate solution obtainedCan serve as formula 7) numerical solution.WillIn kth
Secondary iterative state XkNearby utilize second order Taylor series expansion:
Wherein:
Wherein,Represent in kth time iterative state XkThe value at place, formula 9) inMake formula 9) to Δ Xk's
Single order local derviation is zero, is obtained:
gk+(ΔXk)TGk=0 12)
Work as GkWhen nonsingular
(ΔXk)T=-(Gk)-1(gk)T 13)
Wherein, ()-1Represent inversion operation.
Then iterative formula can be written as:
Xk+1=Xk+ΔXk=Xk-(Gk)-1(gk)T 14)
Formula 14) be exactly Newton iteration fundamental formular, stopping criterion for iteration is:
R(Xk+1)≡R(Xk) 15)
Wherein, ≡ represents to be constantly equal to.
Two:The tracking of the present invention
Reference picture 1, tracking step of the invention is as follows:
Step 1. initialized target sample
Initial time t=0 is made, is that sensor produces N according to the initial distribution of dbjective statet|tIndividual initial sample constitutes mesh
Mark sample set:Wherein,I-th of target sample of t is represented,Represent i-th of target of t
The intensity of sample;
If initial time is without newborn target, i.e., newborn target sample collectionFor empty set, wherein,Table
Show i-th of newborn target sample of t,Represent the intensity of i-th of newborn target sample of t, JtRepresent that t is newborn
Target sample number;
Step 2. merges target sample
Merge the target sample collection of tWith newborn target sample collectionObtain new
Set:WhereinWithI-th of sample after merging and its intensity are represented respectively;
Step 3. judges whether the sample set after t merging is empty, if the sample set after merging is sky, performs step
8, otherwise, perform step 4;
Step 4. predicts target sample collection, without goal hypothesis intensity and measurement intensity.
(4.1) the merging sample set obtained according to tT is obtained to the prediction mesh at t+1 moment
Mark sample setWherein,T is represented to i-th of forecast sample of t+1 moment, F is represented
State-transition matrix, G represents input matrix, etRepresent state-noise,The intensity of i-th of forecast sample is represented,
Nt+1|t=Nt|t+JtRepresent forecast sample number;
(4.2) predict t to the t+1 moment without goal hypothesis intensity ft+1|t(φ):
Wherein,T is represented to the non-existent intensity of t+1 moment targets,Represent t to the t+1 moment
The intensity of target termination, its calculation formula is as follows:
Wherein, ψt+1(φ | φ) no goal hypothesis transition probability is indicated,Represent the probability that target disappears, ft|t
(φ) represents the intensity without goal hypothesis of t;
(4.3) according to the measurement collection at t+1 momentPrediction measures intensity
Wherein, j ∈ [1, Nz,t+1], Nz,t+1The measurement number at t+1 moment is represented,Represent measurement source in target-like
The intensity of state,Measurement source is represented in the intensity without goal hypothesis, its calculation formula is as follows:
Wherein,Represent to measure the likelihood for coming from no goal hypothesis,Indicate the inspection of no goal hypothesis
Survey probability,Represent target detection probability,Represent to measure likelihood,With
Calculation formula it is as follows:
Wherein,!Factorial computing is represented, Ω represents covariance matrix.
Step 5. estimates dbjective state.
(5.1) j-th is measuredCalculate and measureFrom the probability of target:
(5.2) W is worked asjDuring > τ, it is believed that j-th of measurement comes from target, and estimates dbjective state:
Wherein,τ is the given threshold that target is present.
Step 6. updates target sample intensity and without goal hypothesis intensity.
(6.1) using following formula to target strengthIt is updated, the target strength after being updated
(6.2) using following formula to after prediction without goal hypothesis intensity ft+1|t(φ) is updated, the nothing after being updated
Goal hypothesis intensity ft+1|t+1(φ):
Step 7. is according to the target sample collection after renewalWith the target strength after renewalObtain mesh
Mark sample set
(7.1) to formula 25) summation of obtained sample intensity, the number of targets desired value that the t+1 moment estimates is obtained, is expressed as
ηt+1:
(7.2) according to above-mentioned number of targets desired value ηt+1With after renewal without goal hypothesis intensity ft+1|t+1(φ), calculates weight
Oversampling ratio ps:
(7.3) forecast sample number is multiplied with resampling ratio and obtains resampling sample number Nt+1|t+1:
Nt+1|t+1=Nt+1|t·ps 29)
(7.4) from the target sample collection after renewalMiddle resampling Nt+1|t+1Individual sample, is obtained after sampling
Target sample collection:
Step 8. measures conversion
Reference picture 2, this step is implemented as follows:
(8.1) set initial state value as:According to j-th of measurementInitial target functional value R is calculated as follows
(Xk):
Wherein, j ∈ [1, Nz,t+1],xt+1And yt+1X directions and y directions coordinate are represented respectively, and k is represented
Iterations, nonlinear functionIt is calculated as follows:
Wherein, (xsi,ysi) represent i-th of observation station position, i=1 ..., n;
(8.2) Jacobi matrixes g is calculated as followsk:
(8.3) Hessian matrixes G is calculated as followsk:
(8.4) an iteration state value is calculated as follows
Wherein, (Gk)-1Represent Hessian matrixes GkIt is inverse, T represents to seek the transposition of matrix;
(8.5) an iteration target function value is calculated as follows
(8.6) judgeWithIt is whether equal, ifThen export j-th of measurement
The coordinate of conversion:Otherwise, makeK=k+1, return to step (8.2) is carried out next
Secondary iteration;Wherein,
(8.7) step (8.1)~(8.6) are pressed, all measurements of t and t+1 moment are converted into coordinate, are expressed as:With
Step 9. estimates newborn target
(9.1) newborn target sample number J is calculated according to following formulat+1:
Judge Jt+1Whether it is zero or infinitely great, if Jt+1It is zero or infinitely great, then makes Jt+1=NnewNumPar, its
Middle NnewNewborn target number is represented, numPar represents the sampled targets sample number of each newborn target;
(9.2) result obtained according to step 8, the coordinate set of conversion is measured from tMeasure and turn with the t+1 moment
The coordinate set of changeIn filter out and all meet εmin< d < εmaxCoordinate constitute newborn coordinates of targets collectionWherein,Denotation coordinationAnd coordinateDistance, NzFor
The number of all coordinates of targets for meeting condition, εminAnd εmaxThe lower and upper limit apart from d are represented respectively;
(9.3) speed of j-th of newborn target of t+1 moment is calculated:Wherein, j ∈ [1,
Nz], Δ T represents time interval;
(9.4) according to newborn coordinates of targets collectionWith speed collectionConstitute newborn object setWhether be empty, if it is empty, then in target region [a if judging newborn object setx,bx]*[ay,by] in uniformly adopt
Sample Jt+1Individual target sample;Otherwise, each newborn target is distributed as according to the state of newborn target to produceIndividual target sample,
Constitute newborn target sample collectionWherein,Represent newborn target strength.
Step 10. makes t=t+1, and return to step 2 continues to track target.
The design sketch of the present invention can be further illustrated by following experiment simulation:
1. simulated conditions and parameter
Simulating scenes such as Fig. 3 represents that the time of day of the target of each in simulating scenes is x=[x, vx,y,vy]T, its
In, x, y represents coordinate of the target on cartesian coordinate system x directions and y directions, v respectivelyx,vyRepresent target in x directions respectively
With the speed on y directions, state equation and the measurement equation such as formula 1 of target) and 2), wherein:
Wherein, TsSampling time interval is represented, simulation parameter is as shown in table 1:
The experiment simulation parameter of table 1
2. emulation content and interpretation of result
Pure orientation angle tracking to six targets under three sensor conditions carries out emulation experiment, and target is in two dimensional surface
It is interior motion real trace as shown in figure 3, emulation in the present invention tracking LSCL-iFilter with using uniform sampling with
The conventional strength wave filter U-iFilter method for tracking target of the unknown newborn target of track is contrasted.
Emulation 1:The track of target and target number are emulated with this method, simulation result as shown in figure 4, wherein,
Fig. 4 (a) is target following trajectory diagram, and Fig. 4 (b) is target number analogous diagram, as can be seen that passing through from Fig. 4 (a) and Fig. 4 (b)
Often there is target detection leakage phenomenon when tracking unknown newborn target in uniform sampling, fails effective tracking target, the present invention in real time
Can postpone two moment estimates newborn target, and number of targets estimation is stable, seldom occurs more estimating and estimating phenomenon less.
Emulation 2:Dbjective state error and velocity error are emulated with this method, simulation result as shown in figure 5, its
In, Fig. 5 (a) is dbjective state OSPA Error Graphs, and Fig. 5 (b) is target velocity OSPA Error Graphs, can from Fig. 5 (a) and Fig. 5 (b)
To find out, error of the invention is consistently lower than the error that unknown newborn goal approach is tracked by uniform sampling.Fig. 5 (a) and Fig. 5
(b) the two larger peak values occurred in are both present in two moment that newborn target is postponed estimation.After newborn target state estimator goes out,
Its state error and velocity error can tend to be steady.
Emulation 3:Sample number and run time are emulated with the present invention, simulation result is as shown in fig. 6, wherein, Fig. 6
(a) it is target number figure, Fig. 6 (b) is simulation time figure, as can be seen that the present invention is in tracking mesh from Fig. 6 (a) and Fig. 6 (b)
The sample number and run time that timestamp is used are few, and it tracks efficiency far and tracks unknown newborn target higher than using uniform sampling
Conventional strength wave filter.
Claims (7)
1. a kind of target tracking method of passive multi-sensor based on density filter, comprises the following steps:
(1) initial time t=0 is made, is that sensor produces N according to the initial distribution of dbjective statet|tIndividual initial sample constitutes mesh
Mark sample set:Wherein,I-th of target sample of t is represented,Represent i-th of target sample of t
This intensity;
If initial time is without newborn target, i.e., newborn target sample collectionFor empty set, wherein,When representing t
I-th of newborn target sample is carved,Represent the intensity of i-th of newborn target sample of t, JtRepresent the newborn target sample of t
This number;
(2) the target sample collection of t is mergedWith newborn target sample collectionObtain new collection
Close:WhereinWithI-th of sample after merging and its intensity are represented respectively;
(3) whether be empty, if the sample set after merging is sky, execution step (9) is no if judging the sample set after t merging
Then, step (4) is performed;
(4) the merging sample set obtained according to (2)T is calculated to the pre- test sample at t+1 moment with state equation
This collectionWherein,T is represented to i-th of forecast sample of t+1 moment,Represent i-th
The intensity of individual forecast sample, Nt+1|t=Nt|t+JtRepresent forecast sample number;
(5) according to forecast sample collectionWith t without goal hypothesis intensity ft|t(φ) prediction t+1 moment
Without goal hypothesis intensity ft+1|t(φ);According to forecast sample collectionWith the measurement collection at t+1 moment
Predict the measurement intensity at t+1 momentWherein,Represent that the t+1 moment measures for j-th, Nz,t+1Represent the amount at t+1 moment
Survey number;
(6) by measurement intensityWith measurement likelihoodCalculate the probability W that target is presentj, work as WjDuring > τ, recognize
Exist for target, and estimate dbjective stateWherein, τ is the given threshold that target is present;
(7) prediction is updated respectively without goal hypothesis intensity ft+1|t(φ) and forecast sample collectionObtain the t+1 moment
Without goal hypothesis intensity ft+1|t+1(φ) and sample set
(8) following parameter is obtained according to the result of step (7):
8a) to the sample set after renewalIn intensity summation, obtain the number of targets desired value that the t+1 moment estimates
ηt+1;
8b) using without goal hypothesis intensity ft+1|t+1(φ) and forecast sample number Nt+1|t, calculate resampling sample number Nt+1|t+1;
8c) using without goal hypothesis intensity ft+1|t+1(φ), without goal hypothesis transition probability ψt+1(φ | φ) and forecast sample number
Nt+1|tCalculate newborn sample number Jt+1;
8d) from sample setMiddle resampling Nt+1|t+1Individual sample, the sample set after being sampled:
(9) newborn coordinates of targets and newborn target velocity are calculated:
Many base least square cross bearingses 9a) are utilized, all measurements at t and t+1 moment coordinate are converted into, respectively table
It is shown asWithFilter out all satisfactionsCoordinate, constitute new
Raw coordinates of targets collection:Wherein,WithI-th of the measurement conversion of t and t+1 moment is represented respectively
Coordinate,WithJ-th of newborn coordinates of targets of t and t+1 moment is represented respectively, and T represents transposition, εminAnd εmaxRespectively
Represent apart from lower limit and apart from the upper limit, NzFor all coordinate numbers for meeting condition;
The speed of newborn target 9b) is calculated according to the coordinate of newborn target:Wherein, Δ T is represented
Time interval;
(10) according to newborn coordinates of targets collectionWith speed collectionConstitute newborn object setSentence
Whether disconnected new life object set is empty, if it is empty, then in target region [ax,bx]*[ay,by] interior uniform sampling Jt+1Individual target
Sample;Otherwise, each newborn target is distributed as according to the state of newborn target to produceIndividual target sample, constitutes newborn target
Sample setWherein,Represent newborn target strength;
(11) t=t+1 is made, return to step (2) continues to track target.
2. according to the method described in claim 1, wherein:According to forecast sample collection in the step (5)And t
The measurement collection at+1 momentPredict the measurement intensity at t+1 momentCarry out as follows:
<mrow>
<msub>
<mi>&lambda;</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mover>
<mi>&lambda;</mi>
<mo>~</mo>
</mover>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>&zeta;</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow>
Wherein, j ∈ [1, Nz,t+1], Nz,t+1The measurement number at t+1 moment is represented,Represent measurement source in dbjective state
Intensity,Measurement source is represented in the intensity without goal hypothesis, its calculation formula is as follows:
<mrow>
<msub>
<mover>
<mi>&lambda;</mi>
<mo>~</mo>
</mover>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>|</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
<msubsup>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>D</mi>
</msubsup>
<mrow>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mi>&zeta;</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
</munderover>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>|</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
<msubsup>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>D</mi>
</msubsup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
<msubsup>
<mi>w</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>;</mo>
</mrow>
Wherein,Represent to measure the likelihood for coming from no goal hypothesis,Indicate that the detection of no goal hypothesis is general
Rate,Represent to measure likelihood,Represent target detection probability,WithMeter
Calculate formula as follows:
<mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>|</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
<mo>)</mo>
</mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
</msup>
<mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>!</mo>
</mrow>
</mfrac>
<msup>
<mi>e</mi>
<mrow>
<mo>(</mo>
<mo>-</mo>
<mo>(</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
<mo>)</mo>
</mrow>
</msup>
<mo>;</mo>
</mrow>
<mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>|</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mrow>
<mn>2</mn>
<mi>&pi;</mi>
<mo>|</mo>
<mi>&Omega;</mi>
<msup>
<mo>|</mo>
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
</msup>
</mrow>
</mfrac>
<mi>exp</mi>
<mrow>
<mo>(</mo>
<mo>-</mo>
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
<msup>
<mrow>
<mo>(</mo>
<mrow>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>-</mo>
<mi>h</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
<mo>)</mo>
</mrow>
<mi>T</mi>
</msup>
<msup>
<mi>&Omega;</mi>
<mrow>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msup>
<mo>(</mo>
<mrow>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>-</mo>
<mi>h</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow>
Wherein,!Factorial computing is represented, Ω represents covariance matrix.
3. according to the method described in claim 1, wherein, by measurement intensity in the step (6)With measurement likelihoodCalculate the probability W that target is presentj, its calculation formula is as follows:
<mrow>
<msub>
<mi>W</mi>
<mi>j</mi>
</msub>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
</munderover>
<mfrac>
<mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>|</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
<msubsup>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>D</mi>
</msubsup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<msub>
<mi>&lambda;</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>&CenterDot;</mo>
<msubsup>
<mi>w</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>,</mo>
</mrow>
Wherein,Represent to measure likelihood,Represent target detection probability,Calculating it is public
Formula is as follows:
<mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>|</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
<mo>)</mo>
</mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
</msup>
<mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>!</mo>
</mrow>
</mfrac>
<msup>
<mi>e</mi>
<mrow>
<mo>(</mo>
<mo>-</mo>
<mo>(</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
<mo>)</mo>
</mrow>
</msup>
<mo>.</mo>
</mrow>
4. according to the method described in claim 1, wherein updating prediction in the step (7) respectively without goal hypothesis intensity ft+1|t
(φ) and forecast sample collectionObtain the t+1 moment without goal hypothesis intensity ft+1|t+1(φ) and sample setCarry out as follows:
(7.1) no goal hypothesis intensity f is calculated as followst+1|t+1(φ):
<mrow>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mo>&lsqb;</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>D</mi>
</msubsup>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
</munderover>
<mfrac>
<mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>|</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
<msubsup>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>D</mi>
</msubsup>
<mrow>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<msub>
<mi>&lambda;</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>&rsqb;</mo>
<mo>&CenterDot;</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
<mo>,</mo>
</mrow>
Wherein,The detection probability of no goal hypothesis is indicated,Represent to measure and come from no goal hypothesis seemingly
So, its calculation formula is as follows:
<mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>|</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
<mo>)</mo>
</mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
</msup>
<mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>!</mo>
</mrow>
</mfrac>
<msup>
<mi>e</mi>
<mrow>
<mo>(</mo>
<mo>-</mo>
<mo>(</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
<mo>)</mo>
</mrow>
</msup>
<mo>;</mo>
</mrow>
(7.2) intensity after i-th of target update of t+1 moment is calculated as follows
<mrow>
<msubsup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>=</mo>
<mo>&lsqb;</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<msubsup>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>D</mi>
</msubsup>
<mo>(</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>N</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
</munderover>
<mfrac>
<mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>|</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
<msubsup>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>D</mi>
</msubsup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<msub>
<mi>&lambda;</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>&rsqb;</mo>
<mo>&CenterDot;</mo>
<msubsup>
<mi>w</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>,</mo>
</mrow>
Wherein,Represent target detection probability,Represent to measure likelihood, its calculation formula is as follows:
<mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>|</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mrow>
<mn>2</mn>
<mi>&pi;</mi>
<mo>|</mo>
<mi>&Omega;</mi>
<msup>
<mo>|</mo>
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
</msup>
</mrow>
</mfrac>
<mi>exp</mi>
<mrow>
<mo>(</mo>
<mo>-</mo>
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
<msup>
<mrow>
<mo>(</mo>
<mrow>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>-</mo>
<mi>h</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
<mo>)</mo>
</mrow>
<mi>T</mi>
</msup>
<msup>
<mi>&Omega;</mi>
<mrow>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msup>
<mo>(</mo>
<mrow>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>-</mo>
<mi>h</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>X</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
</mrow>
<mi>i</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow>
Wherein, Ω represents covariance matrix.
5. according to the method described in claim 1, wherein the step 8b) it is middle using without goal hypothesis intensity ft+1|t+1(φ) and
Forecast sample number Nt+1|t, calculate resampling sample number Nt+1|t+1, carry out as follows:
8b1) according to number of targets desired value ηt+1With without goal hypothesis intensity ft+1|t+1(φ) calculates resampling ratio ps:
<mrow>
<msub>
<mi>p</mi>
<mi>s</mi>
</msub>
<mo>=</mo>
<mfrac>
<msub>
<mi>&eta;</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<msub>
<mi>&eta;</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>;</mo>
</mrow>
8b2) according to adopting ratio p againsWith forecast sample number Nt+1|tCalculate resampling sample number Nt+1|t+1:
Nt+1|t+1=Nt+1|t·ps。
6. according to the method described in claim 1, wherein the step 8c) it is middle using without goal hypothesis intensity ft+1|t+1(φ), nothing
Goal hypothesis transition probability ψt+1(φ | φ) and forecast sample number Nt+1|tCalculate newborn sample number Jt+1, its calculation formula is as follows:
<mrow>
<msub>
<mi>J</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>=</mo>
<mo>&lsqb;</mo>
<mfrac>
<msub>
<mi>N</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<msub>
<mi>&eta;</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
</mfrac>
<mo>&CenterDot;</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>&psi;</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>(</mo>
<mrow>
<mi>&phi;</mi>
<mo>|</mo>
<mi>&phi;</mi>
</mrow>
<mo>)</mo>
<mo>)</mo>
</mrow>
<mo>&CenterDot;</mo>
<msub>
<mi>f</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
<mo>|</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>&phi;</mi>
<mo>)</mo>
</mrow>
<mo>&rsqb;</mo>
<mo>,</mo>
</mrow>
Wherein ηt+1The number of targets desired value estimated for the t+1 moment.
7. according to the method described in claim 1, wherein the step 9a) it is middle using many base least square cross bearingses, by t
All measurements at moment and t+1 moment are converted into coordinate, carry out as follows:
9a1) set initial state value as:According to j-th of measurementInitial target functional value R (X are calculated as followsk):
<mrow>
<mi>R</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msup>
<mi>h</mi>
<mi>T</mi>
</msup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<mi>h</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mn>2</mn>
<msup>
<mi>h</mi>
<mi>T</mi>
</msup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>,</mo>
</mrow>
Wherein, j ∈ [1, Nz,t+1],xt+1And yt+1X directions and y directions coordinate are represented respectively, and k represents iteration
Number of times, nonlinear functionIt is calculated as follows:
<mrow>
<mi>h</mi>
<mrow>
<mo>(</mo>
<msup>
<mi>x</mi>
<mi>k</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>a</mi>
<mi>r</mi>
<mi>c</mi>
<mi>t</mi>
<mi>a</mi>
<mi>n</mi>
<mrow>
<mo>(</mo>
<mfrac>
<mrow>
<msub>
<mi>y</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>-</mo>
<msub>
<mi>y</mi>
<mrow>
<mi>s</mi>
<mn>1</mn>
</mrow>
</msub>
</mrow>
<mrow>
<msub>
<mi>x</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>-</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>s</mi>
<mn>1</mn>
</mrow>
</msub>
</mrow>
</mfrac>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mi>a</mi>
<mi>r</mi>
<mi>c</mi>
<mi>t</mi>
<mi>a</mi>
<mi>n</mi>
<mrow>
<mo>(</mo>
<mfrac>
<mrow>
<msub>
<mi>y</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>-</mo>
<msub>
<mi>y</mi>
<mrow>
<mi>s</mi>
<mn>2</mn>
</mrow>
</msub>
</mrow>
<mrow>
<msub>
<mi>x</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>-</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>s</mi>
<mn>2</mn>
</mrow>
</msub>
</mrow>
</mfrac>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>.</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mi>a</mi>
<mi>r</mi>
<mi>c</mi>
<mi>t</mi>
<mi>a</mi>
<mi>n</mi>
<mrow>
<mo>(</mo>
<mfrac>
<mrow>
<msub>
<mi>y</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>-</mo>
<msub>
<mi>y</mi>
<mrow>
<mi>s</mi>
<mi>n</mi>
</mrow>
</msub>
</mrow>
<mrow>
<msub>
<mi>x</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>-</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>s</mi>
<mi>n</mi>
</mrow>
</msub>
</mrow>
</mfrac>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>;</mo>
</mrow>
Wherein, (xsi,ysi) represent the observation station position, i=1 ..., n;
Jacobi matrixes g 9a2) is calculated as followsk:
<mrow>
<msup>
<mi>g</mi>
<mi>k</mi>
</msup>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<mfrac>
<mrow>
<mo>&part;</mo>
<mi>R</mi>
</mrow>
<mrow>
<mo>&part;</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
</mrow>
</mfrac>
</mtd>
<mtd>
<mfrac>
<mrow>
<mo>&part;</mo>
<mi>R</mi>
</mrow>
<mrow>
<mo>&part;</mo>
<msub>
<mi>y</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
</mrow>
</mfrac>
</mtd>
</mtr>
</mtable>
</mfenced>
<msub>
<mo>|</mo>
<mrow>
<mi>x</mi>
<mo>=</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
</mrow>
</msubsup>
</mrow>
</msub>
<mo>;</mo>
</mrow>
Hessian matrixes G 9a3) is calculated as followsk:
<mrow>
<msup>
<mi>G</mi>
<mi>k</mi>
</msup>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<mfrac>
<mrow>
<msup>
<mo>&part;</mo>
<mn>2</mn>
</msup>
<mi>R</mi>
</mrow>
<mrow>
<mo>&part;</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mn>2</mn>
</msubsup>
</mrow>
</mfrac>
</mtd>
<mtd>
<mfrac>
<mrow>
<msup>
<mo>&part;</mo>
<mn>2</mn>
</msup>
<mi>R</mi>
</mrow>
<mrow>
<mo>&part;</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&part;</mo>
<msub>
<mi>y</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
</mrow>
</mfrac>
</mtd>
</mtr>
<mtr>
<mtd>
<mfrac>
<mrow>
<msup>
<mo>&part;</mo>
<mn>2</mn>
</msup>
<mi>R</mi>
</mrow>
<mrow>
<mo>&part;</mo>
<msub>
<mi>x</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>&part;</mo>
<msub>
<mi>y</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
</mrow>
</mfrac>
</mtd>
<mtd>
<mfrac>
<mrow>
<msup>
<mo>&part;</mo>
<mn>2</mn>
</msup>
<mi>R</mi>
</mrow>
<mrow>
<mo>&part;</mo>
<msubsup>
<mi>y</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mn>2</mn>
</msubsup>
</mrow>
</mfrac>
</mtd>
</mtr>
</mtable>
</mfenced>
<msub>
<mo>|</mo>
<mrow>
<mi>x</mi>
<mo>=</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
</mrow>
</msubsup>
</mrow>
</msub>
<mo>;</mo>
</mrow>
An iteration state value 9a4) is calculated as follows
<mrow>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>=</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
</mrow>
</msubsup>
<mo>-</mo>
<msup>
<mrow>
<mo>(</mo>
<msup>
<mi>G</mi>
<mi>k</mi>
</msup>
<mo>)</mo>
</mrow>
<mrow>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msup>
<msup>
<mrow>
<mo>(</mo>
<msup>
<mi>g</mi>
<mi>k</mi>
</msup>
<mo>)</mo>
</mrow>
<mi>T</mi>
</msup>
<mo>;</mo>
</mrow>
Wherein, (Gk)-1Represent Hessian matrixes GkIt is inverse, T represents to seek the transposition of matrix;
An iteration target function value 9a5) is calculated as follows
<mrow>
<mi>R</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msup>
<mi>h</mi>
<mi>T</mi>
</msup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<mi>h</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mn>2</mn>
<msup>
<mi>h</mi>
<mi>T</mi>
</msup>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mi>z</mi>
<mo>,</mo>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mrow>
<mi>j</mi>
<mo>,</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<msubsup>
<mi>z</mi>
<mrow>
<mi>t</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mi>j</mi>
</msubsup>
<mo>;</mo>
</mrow>
9a6) judgeWithIt is whether equal, ifThen export j-th of measurementThe seat of conversion
Mark:Otherwise, makeReturn to step (9a2), is changed next time
Generation;Wherein,
9a7) press step 9a1)~9a6), all measurements of t and t+1 moment are converted into coordinate, are expressed as:With
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510166369.4A CN104750998B (en) | 2015-04-09 | 2015-04-09 | Target tracking method of passive multi-sensor based on density filter |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510166369.4A CN104750998B (en) | 2015-04-09 | 2015-04-09 | Target tracking method of passive multi-sensor based on density filter |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104750998A CN104750998A (en) | 2015-07-01 |
CN104750998B true CN104750998B (en) | 2017-08-25 |
Family
ID=53590673
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510166369.4A Expired - Fee Related CN104750998B (en) | 2015-04-09 | 2015-04-09 | Target tracking method of passive multi-sensor based on density filter |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104750998B (en) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106054167B (en) * | 2016-05-27 | 2018-06-26 | 西安电子科技大学 | More extension method for tracking target based on density filter |
CN108121846B (en) * | 2016-11-29 | 2022-01-11 | 南京航空航天大学 | Entropy punishment-based PHD multi-target tracking method for EM unknown clutter estimation |
CN111863157B (en) * | 2020-07-31 | 2021-10-15 | 广州博依特智能信息科技有限公司 | Raw material quality determination method in glass production process |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5793931A (en) * | 1996-11-18 | 1998-08-11 | The United States Of America As Represented By The Secretary Of The Army | Method and apparatus for multi-sensor, multi-target tracking using intelligent search techniques |
US6055523A (en) * | 1997-07-15 | 2000-04-25 | The United States Of America As Represented By The Secretary Of The Army | Method and apparatus for multi-sensor, multi-target tracking using a genetic algorithm |
CN101701826A (en) * | 2009-11-20 | 2010-05-05 | 西安电子科技大学 | Target tracking method of passive multi-sensor based on layered particle filtering |
CN101907461A (en) * | 2010-06-24 | 2010-12-08 | 西安电子科技大学 | Measuration data correlation method for passive multisensor based on angle cotangent value |
CN101975575A (en) * | 2010-10-15 | 2011-02-16 | 西安电子科技大学 | Multi-target tracking method for passive sensor based on particle filtering |
-
2015
- 2015-04-09 CN CN201510166369.4A patent/CN104750998B/en not_active Expired - Fee Related
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5793931A (en) * | 1996-11-18 | 1998-08-11 | The United States Of America As Represented By The Secretary Of The Army | Method and apparatus for multi-sensor, multi-target tracking using intelligent search techniques |
US6055523A (en) * | 1997-07-15 | 2000-04-25 | The United States Of America As Represented By The Secretary Of The Army | Method and apparatus for multi-sensor, multi-target tracking using a genetic algorithm |
CN101701826A (en) * | 2009-11-20 | 2010-05-05 | 西安电子科技大学 | Target tracking method of passive multi-sensor based on layered particle filtering |
CN101907461A (en) * | 2010-06-24 | 2010-12-08 | 西安电子科技大学 | Measuration data correlation method for passive multisensor based on angle cotangent value |
CN101975575A (en) * | 2010-10-15 | 2011-02-16 | 西安电子科技大学 | Multi-target tracking method for passive sensor based on particle filtering |
Non-Patent Citations (2)
Title |
---|
宋骊平 等;.《多被动传感器UKF与EKF算法的应用与比较》.《系统工程与电子技术》.2009,第31卷(第5期), * |
李翠芸 等;.《基于变分贝叶斯势均衡多目标伯努利滤波的多扩展目标跟踪算法》.《控制理论与应用》.2015,第32卷(第2期), * |
Also Published As
Publication number | Publication date |
---|---|
CN104750998A (en) | 2015-07-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Huang et al. | A novel robust student's t-based Kalman filter | |
CN103345577B (en) | Variation Bayesian probability assumed density multi-object tracking method | |
CN106443622B (en) | A kind of distributed object tracking based on improvement joint probability data association | |
CN106950562B (en) | State fusion target tracking method based on predicted value measurement conversion | |
CN110503071A (en) | Multi-object tracking method based on the more Bernoulli Jacob's Additive Models of variation Bayes's label | |
CN103925925B (en) | A kind of real-time high-precision position calculation method for multipoint location system | |
CN104730511A (en) | Tracking method for multiple potential probability hypothesis density expansion targets under star convex model | |
KR100816269B1 (en) | Robust fast simultaneous localization and mapping method applying unscented filter | |
CN107677997A (en) | Extension method for tracking target based on GLMB filtering and Gibbs samplings | |
CN104035083B (en) | A kind of radar target tracking method based on measurement conversion | |
CN103759732B (en) | A kind of centralized multisensor multiple hypotheis tracking method of angle information auxiliary | |
CN107084714A (en) | A kind of multi-robot Cooperation object localization method based on RoboCup3D | |
CN103973263B (en) | Approximation filter method | |
CN104833949A (en) | Multiple-unmanned aerial vehicle cooperative passive location method based on improved distance parameterization | |
CN110231620B (en) | Noise-related system tracking filtering method | |
CN104750998B (en) | Target tracking method of passive multi-sensor based on density filter | |
CN105785358B (en) | Radar target tracking method with Doppler measurement in direction cosine coordinate system | |
CN104794735A (en) | Extended target tracking method based on variational Bayesian expectation maximization | |
CN101701826A (en) | Target tracking method of passive multi-sensor based on layered particle filtering | |
CN108871365B (en) | State estimation method and system under course constraint | |
CN105354860A (en) | Box particle filtering based extension target CBMeMBer tracking method | |
CN101980044A (en) | Method for tracking multiple targets under unknown measurement noise distribution | |
CN107547067A (en) | A kind of multi-model self calibration EKF method | |
CN102706345A (en) | Maneuvering target tracking method based on fading memory sequential detector | |
CN107015944A (en) | A kind of mixing square root volume kalman filter method for target following |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170825 |