Normalised complexity metric for manoeuvering target tracking

Manoeuvering target tracking is a challenging problem for filter design in a variety of tracking systems. However, how to quantify the complexity of this problem is seldom studied. In this paper, a normalised complexity metric for manoeuvering target tracking called relative difficulty to Kalman fil...

Full description

Saved in:
Bibliographic Details
Published inElectronics letters Vol. 57; no. 23; pp. 897 - 899
Main Authors Liu, Bing, Shen, Xiao Jing
Format Journal Article
LanguageEnglish
Published Stevenage John Wiley & Sons, Inc 01.11.2021
Wiley
Subjects
Algorithms
Cognition & reasoning
Complexity
Dimensional analysis
Dimensional tolerances
Error analysis
Filter design (mathematics)
Kalman filters
Maneuvering targets
Measurement and error theory
Measurement theory
Performance evaluation
Sensors
Spatial variables measurement
Tracking
Tracking systems
Online AccessGet full text

Cover

More Information
Summary:Manoeuvering target tracking is a challenging problem for filter design in a variety of tracking systems. However, how to quantify the complexity of this problem is seldom studied. In this paper, a normalised complexity metric for manoeuvering target tracking called relative difficulty to Kalman filter is defined as the ratio between maximum tolerance error of positional estimation and its requirement precision of positional measurement. It can be employed as an indicator of the difficulty of designing an advanced filter to satisfy the tracking requirement. Analytical expression of RD2KF in three‐dimensional space is derived. Two typical tracking examples show that RD2KF is affected by manoeuver intensity, data rate and the required precision of the tracking mission.
ISSN:0013-5194
1350-911X
DOI:10.1049/ell2.12297