2019
DOI: 10.1002/acs.2987
|View full text |Cite
|
Sign up to set email alerts
|

Nonmyopic sensor scheduling for target tracking with emission control

Abstract: Summary Active sensors obtain the measurements of targets by emitting energy that can be intercepted by enemy surveillance sensors. To satisfy the target tracking requirement and control the whole system emission, we propose a nonmyopic sensor scheduling to minimize the emission cost while maintaining a desired tracking accuracy. The processes of target tracking and emission control are formulated as a partially observable Markov decision process. Then, we translate our scheduling problem to a discrete unconst… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 24 publications
0
5
0
Order By: Relevance
“…where t i is the continuous working time, n i is the number of targets tracked by sensor i at the same time, t 0 is a constant which can be set according to working parameters of radar interceptor (Qiao et al, 2019). According to the silence principle, the intercepted probability factor becomes zero when the sensor stops tracking the target (Xu et al, 2019a).…”
Section: System Observation and Measurement Equationmentioning
confidence: 99%
See 1 more Smart Citation
“…where t i is the continuous working time, n i is the number of targets tracked by sensor i at the same time, t 0 is a constant which can be set according to working parameters of radar interceptor (Qiao et al, 2019). According to the silence principle, the intercepted probability factor becomes zero when the sensor stops tracking the target (Xu et al, 2019a).…”
Section: System Observation and Measurement Equationmentioning
confidence: 99%
“…But, the computational complexity of NMSM is higher. The commonly used solving algorithms for NMSM are dynamic programming algorithm (Li et al, 2009), decision tree optimization algorithm (Qiao et al, 2019) and modern intelligent optimization algorithm (Pang and Shan, 2019;Solaiman, 2016). The intelligent optimization algorithm, such as genetic algorithm, particle swarm optimization algorithm, has high solving efficiency and will not be limited by the calculated condition, which has been used in the sensor management field.…”
Section: Introductionmentioning
confidence: 99%
“…In order to illustrate the advancement of the branchand-bound-based greedy search algorithm (BB-GS), we compare it with three existing algorithms, namely uniform cost search (UCS), greedy search (GS) and branch-andbound-based standard cost search (BB-UCS) [29]. Then, the percentage of nodes opened and the maximum number of nodes stored are selected as evaluation indexes, which represent the performance of the algorithm in search time and memory consumption, respectively [29]. Fig.…”
Section: Comparison Of Search Algorithmsmentioning
confidence: 99%
“…An objective function should be established firstly and after that, the optimal sensor management schemes should be calculated. The calculated sensor management scheme is carried out to get observations, which will be used to estimate motion states of targets [1]- [4].…”
Section: Introductionmentioning
confidence: 99%