In a multifunctional radar performing searching and tracking operations, the maximum number of targets that can be managed is an important measure of performance. One way a radar can maximize tracking performance is to optimize its dwell scheduling. The problem of designing efficient dwell scheduling algorithms for various tracking and searching scenarios with respect to various objective functions has been considered many times in the past and many solutions have been proposed. We consider the dwell scheduling problem for two different scenarios where the only objective is to maximize the number of dwells scheduled during a scheduling period. We formulate the problem as a distributed and a nondistributed bin packing problem and present optimal solutions using an integer programming formulation. Obtaining an optimal solution gives the limit of radar performance. We also present a more computationally friendly but less optimal solution using a greedy approach.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dwell Scheduling Algorithms for Phased Array Antenna


    Contributors:
    Spasojevic, Z. (author) / Dedeo, S. (author) / Jensen, R. (author)


    Publication date :

    2013-01-01


    Size :

    661718 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Real-time dwell scheduling of component-oriented phased array radars

    Kuo, Tei-Wei / Chao, Yung-Sheng / Kuo, Chin-Fu et al. | Tema Archive | 2005


    Predictive Assessment for Phased Array Antenna Scheduling

    Jensen, Randy / Stottler, Richard / Breeden, David et al. | AIAA | 2012


    2012-2432 Predictive Assessment for Phased Array Antenna Scheduling

    Jensen, R. / Stottler, R. / Breeden, D. et al. | British Library Conference Proceedings | 2012



    Phased-Antenna-Array Conical Scanning

    Lesh, J. R. | NTRS | 1984