Normalised complexity metric for manoeuvering target tracking

Abstract 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 K...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bing Liu, Xiao Jing Shen
Formato: article
Lenguaje:EN
Publicado: Wiley 2021
Materias:
Acceso en línea:https://doaj.org/article/bb64280128c44f9f825941995be3d97f
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:Abstract 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.