### Skapa referens, olika format (klipp och klistra)

**Harvard**

Wintenby, J. (2003) *Resource Allocation in Airborne Surveillance Radar*. Göteborg : Chalmers University of Technology (Technical report - School of Electrical Engineering, Chalmers University of Technology, Göteborg, Sweden, nr: 463).

** BibTeX **

@book{

Wintenby2003,

author={Wintenby, Johannes},

title={Resource Allocation in Airborne Surveillance Radar},

isbn={91-7291-357-6},

abstract={Radars equipped with an Electronically Scanned Antenna (ESA) have the potential of directing the electromagnetic radar beam without mechanically adjusting the antenna. Furthermore, the beam can be redirected instantaneously towards any location in space. Hence, the mechanical constraint of a traditional antenna, which imposes the typically revolving measurement pattern, is relaxed. This means, for example, that targets can be observed in any order. The <i>radar resource management</i> problem is now to design a measurement policy, which optimally utilizes the ESA potentials. This problem is a highly complicated, stochastic optimization problem, and in existing work, many of the practical aspects from real-life are disregarded. For radar designers, practical aspects are important, and more work is needed that focuses on the practical aspects. <p />In this thesis, optimization-based measurement policies are studied both for offline analysis, and for online beam scheduling in real-time. The general approach in the thesis is to solve a simplified problem denoted as <i>resource allocation</i>, which is posed on a higher abstraction level and on a slower time scale than the original resource management problem. It turns out that the resource allocation problem naturally separates into a series of independent tracking and searching subtasks in the radar system. Among these subtasks, the antenna is regarded as a limited and time shared resource. Given shares of radar resources, i.e., time or energy, each subtask can be optimized locally. Coordination of the subtasks is handled via constraints on the resources, where the constraints are included in a resource allocation algorithm using Lagrange relaxation. The resulting algorithms are tested in simulations, given models and performance measures appropriate to the abstraction level in question. <p />In an initial work on high-level resource allocation, an approach designed to detect whether a target navigates along a known route, is studied. The knowledge regarding a target's choice of trajectory is applicable in high-level resource allocation when deciding on target priorities.},

publisher={Institutionen för signaler och system, Chalmers tekniska högskola,},

place={Göteborg},

year={2003},

series={Technical report - School of Electrical Engineering, Chalmers University of Technology, Göteborg, Sweden, no: 463Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie, no: 2039},

keywords={resource allocation, radar resource management, radar control, sensor management, electronically scanned antenna, surveillance radar, adaptive tracking},

note={192},

}

** RefWorks **

RT Dissertation/Thesis

SR Print

ID 177

A1 Wintenby, Johannes

T1 Resource Allocation in Airborne Surveillance Radar

YR 2003

SN 91-7291-357-6

AB Radars equipped with an Electronically Scanned Antenna (ESA) have the potential of directing the electromagnetic radar beam without mechanically adjusting the antenna. Furthermore, the beam can be redirected instantaneously towards any location in space. Hence, the mechanical constraint of a traditional antenna, which imposes the typically revolving measurement pattern, is relaxed. This means, for example, that targets can be observed in any order. The <i>radar resource management</i> problem is now to design a measurement policy, which optimally utilizes the ESA potentials. This problem is a highly complicated, stochastic optimization problem, and in existing work, many of the practical aspects from real-life are disregarded. For radar designers, practical aspects are important, and more work is needed that focuses on the practical aspects. <p />In this thesis, optimization-based measurement policies are studied both for offline analysis, and for online beam scheduling in real-time. The general approach in the thesis is to solve a simplified problem denoted as <i>resource allocation</i>, which is posed on a higher abstraction level and on a slower time scale than the original resource management problem. It turns out that the resource allocation problem naturally separates into a series of independent tracking and searching subtasks in the radar system. Among these subtasks, the antenna is regarded as a limited and time shared resource. Given shares of radar resources, i.e., time or energy, each subtask can be optimized locally. Coordination of the subtasks is handled via constraints on the resources, where the constraints are included in a resource allocation algorithm using Lagrange relaxation. The resulting algorithms are tested in simulations, given models and performance measures appropriate to the abstraction level in question. <p />In an initial work on high-level resource allocation, an approach designed to detect whether a target navigates along a known route, is studied. The knowledge regarding a target's choice of trajectory is applicable in high-level resource allocation when deciding on target priorities.

PB Institutionen för signaler och system, Chalmers tekniska högskola,

T3 Technical report - School of Electrical Engineering, Chalmers University of Technology, Göteborg, Sweden, no: 463Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie, no: 2039

LA eng

OL 30