Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Study on Q-RAM and Feasible Directions Based Methods for Resource Management in Phased Array Radar Systems
Date
2010-10-01
Author
Irci, Ayhan
Saranlı, Afşar
Baykal, Buyurman
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
5
views
0
downloads
Our recent progress and results on optimal real-time resource allocation in phased array radar systems are reported. A previously proposed discrete resource allocation approach, the Quality of Service based Resource Allocation Model (Q-RAM), is analyzed and is observed to generate nonoptimal results. We identify the shortcomings of this method and first extend it using the Karush-Kuhn-Tucker (KKT) optimality conditions for the single resource type case. We obtain an algorithm that delivers a globally optimal solution. We later generalize this further for the multiple resource type case. The Q-RAM approach has its origins in the quality-of-service domain and is fundamentally limited to sampled cost functions. The availability of empirically obtained samples of convex tracking performance curves for phased array radar and the feasibility of continuous approximations to these samples lead our study to the consideration of well formulated alternative methods from the optimization literature belonging to the class of methods of feasible directions. In particular we successfully apply the gradient-projection algorithm for the more general multiple resource type case. Our experimental studies using simulated radar performance data (formulated as a calibration data set) show that superior performance can be obtained in achieving closeness to optimality, while also maintaining similar algorithm execution speeds. Performance can even be increased further if additional computational complexity can be tolerated. In particular improvements in closeness to optimality become significant for dense target scenarios with large number of targets.
Subject Keywords
Tracking
URI
https://hdl.handle.net/11511/35999
Journal
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS
DOI
https://doi.org/10.1109/taes.2010.5595599
Collections
Department of Electrical and Electronics Engineering, Article