کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1718923 1013879 2007 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A branch-and-bound algorithm applied to optimal radar search pattern
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی هوافضا
پیش نمایش صفحه اول مقاله
A branch-and-bound algorithm applied to optimal radar search pattern
چکیده انگلیسی

In the article, the radar acquisition problem, e.g. the determination of a directional energy allocation sequence, is studied. The radar search pattern goal is the detection of a moving target whose initial location is approximately known. We have turned towards the general search theory where the observer allocates indivisible search efforts while the target presence probability spreads due to its dynamics. A few years ago, a Branch and Bound algorithm was proposed to determine the optimal sequence for a conditionally deterministic target. This operational research algorithm supposes a negative exponential detection function and a one over N detection logic, meaning that the target is declared detected if it has been detected once over a horizon of N looks. We have applied it to a narrow-beam tracking radar attempting to acquire a ballistic target. Non-trivial search patterns, such as expanding-contracting spirals, are obtained.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Aerospace Science and Technology - Volume 11, Issue 4, May 2007, Pages 279-288