Optimal Revisit Time Allocation in Group Target Tracking under Recursive Bayesian Cramer-Rao Lower Bound Criterion

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Phased array radars leverage their electronic beam capability to perform a broader range of tasks compared to classical radars. Given the shared and constrained resources for task execution, effective resource and task management is crucial for these radar systems. While radar resource management for point target tracking has been extensively studied, this paper introduces an extension of this topic to group target tracking. The algorithm proposed in this study calculates the revisit time by solving an optimization problem and incorporates it into the group target tracking cycle. The optimization problem's cost function is formulated as a weighted combination of tracking accuracy and resource consumption. By solving this optimization problem based on the defined cost function and constraints, the revisit time for the next cycle is determined. The recursive nature of the "recursive Cramer-Rao lower bound" is utilized for the tracking accuracy component of the cost function. Comparative analysis between the proposed method, which incorporates an optimal revisit time, and the conventional approach of a fixed revisit time demonstrates a substantial reduction in cost ranging from 44 to 49 percent.
Language:
Persian
Published:
Pages:
81 to 94
https://www.magiran.com/p2865691  
سامانه نویسندگان
  • Author (3)
    Seyyed Mohammad Mehdi Dehghan
    Associate Professor Electrical and computer engineering, Malek-Ashtar University Of Technology, Tehran, Iran
    Dehghan، Seyyed Mohammad Mehdi
اطلاعات نویسنده(گان) توسط ایشان ثبت و تکمیل شده‌است. برای مشاهده مشخصات و فهرست همه مطالب، صفحه رزومه را ببینید.
مقالات دیگری از این نویسنده (گان)