Result: A branch-and-bound algorithm applied to optimal radar search pattem

Title:
A branch-and-bound algorithm applied to optimal radar search pattem
Authors:
DODIN, Pierre, MINVIELLE, Pierre, LE CADRE, Jean-Pierre
Source:
Sensor management in complex systemsAerospace science and technology. 11(4):279-288
Publisher Information:
Paris: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Aeronautics astronautics, Aéronautique, astronautique, Mechanics acoustics, Mécanique et acoustique, Sciences exactes et technologie, Exact sciences and technology, Physique, Physics, Generalites, General, Instruments, appareillage, composants et techniques communs à plusieurs branches de la physique et de l'astronomie, Instruments, apparatus, components and techniques common to several branches of physics and astronomy, Informatique en physique expérimentale, Computers in experimental physics, Analyse de données: algorithmes et implémentations; gestion de données, Data analysis: algorithms and implementation; data management, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie de l'information, Information theory, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Approche déterministe, Deterministic approach, Enfoque determinista, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Balistique, Ballistics, Balística, Capteur mesure, Measurement sensor, Captador medida, Cible mobile, Moving target, Blanco móvil, Détection cible, Target detection, Detección blanco, Fonction exponentielle, Exponential function, Función exponencial, Méthode séparation et évaluation, Branch and bound method, Método branch and bound, Observateur, Observer, Observador, Optimisation, Optimization, Optimización, Ordonnancement, Scheduling, Reglamento, Poursuite cible, Target tracking, Radar poursuite, Tracking radar, Radar persecusión, Radar surveillance, Search radar, Radar vigilancia, Système complexe, Complex system, Sistema complejo, Beam scheduling, Radar search pattern, Search theory
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
CEA CESTA, BP 2, 33114 Le Barp, France
IRISA/CNRS, Campus de Beaulieu, Rennes, France
ISSN:
1270-9638
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18798210
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Metrology

Telecommunications and information theory
Accession Number:
edscal.18798210
Database:
PASCAL Archive

Further Information

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.