Optimal Power Allocation Under Different Power Availability Scenarios for Multitarget Tracking With C-MIMO Radar Systems

被引:1
作者
Sun, Jiajie [1 ]
Wang, Zhiguo [1 ]
Shen, Xiaojing [1 ]
Varshney, Pramod K. [2 ]
机构
[1] Sichuan Univ, Coll Math, Chengdu 610064, Sichuan, Peoples R China
[2] Syracuse Univ, Dept Elect Engn & Comp Sci, Syracuse, NY 13244 USA
基金
中国国家自然科学基金;
关键词
Resource management; Radar tracking; Radar; Target tracking; Optimization; Bayes methods; Task analysis; Quasi-convexity; power allocation; multi-target tracking; quality of service; MULTIPLE TARGETS TRACKING; RESOURCE-ALLOCATION; JOINT SUBCARRIER; MANAGEMENT; STRATEGY; LOCALIZATION; COMPLEXITY; SELECTION; DESIGN;
D O I
10.1109/TSP.2023.3327885
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Power allocation has emerged to be a critical problem when exploiting colocated multiple-input and multiple-output (C-MIMO) radar for multi-target tracking. Several prior approaches employing the quality of service-based framework aim to minimize the weighted sum of the target task utility functions. In this article, to utilize power-resource efficiently and further improve the tracking performance of the C-MIMO radar system, an optimal power allocation (OPA) method is proposed. First, the quality of service based power allocation model is generalized to a more general and flexible model, where the task utility functions can be selected from a set of monotonically increasing convex functions, and the construction of the objective function is not limited to a particular filter to approximate the Bayesian Cramer-Rao lower bound (BCRLB). Thus, more efficient non-linear Bayesian filters can be used. Second, quasi-convexity of the non-convex OPA problem under the quality of service-based framework is explored, whose objective function is the weighted sum of a set of separable quasi-convex functions. Then the strong duality between the original non-convex problem and its dual problem is derived. Finally, under any given approximated BCRLB, a dual projection subgradient power allocation (DPSPA) algorithm is proposed to deal with the dual problem and obtain the optimal solution. Illustrative numerical results demonstrate the efficiency and generality of the proposed strategy under different power availability scenarios.
引用
收藏
页码:4146 / 4162
页数:17
相关论文
共 54 条
  • [1] Labeled Random Finite Sets and Multi-Object Conjugate Priors
    Ba-Tuong Vo
    Ba-Ngu Vo
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (13) : 3460 - 3475
  • [2] Bertsekas DP., 1999, NONLINEAR PROGRAMMIN
  • [3] Bertsekas DP., 2003, CONVEX ANAL OPTIMIZA
  • [4] Boyd S., 2004, CONVEX OPTIMIZATION
  • [5] Boyd S, 2004, LECT NOTES EE392O, P2004
  • [6] Burden R. L., 2015, Numerical Analysis
  • [7] Charlish Alexander, 2017, Novel Radar Techniques and Applications. Volume 2: Waveform Diversity and Cognitive Radar, and Target Tracking and Data Fusion, P157, DOI 10.1049/SBRA512G_ch5
  • [8] Scheduling and Power Allocation in a Cognitive Radar Network for Multiple-Target Tracking
    Chavali, Phani
    Nehorai, Arye
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (02) : 715 - 729
  • [9] Quality-of-service driven power allocations for wireless full-duplex bidirectional links
    Cheng WenChi
    Zhang HaiLin
    [J]. SCIENCE CHINA-INFORMATION SCIENCES, 2014, 57 (04) : 1 - 10
  • [10] An effective PSO-based power allocation for target tracking in MIMO radar with widely separated antennas
    Darzikolaei, Mohammad Akhondi
    Mollaei, Mohammad Reza Karami
    Najimi, Maryam
    [J]. PHYSICAL COMMUNICATION, 2022, 51