Most threatening trajectories in a radar coverage area

In this paper, we will address one key issue for radar load regulation related to dwell priority assignment of Search Domains. Threat Level of search beam position is based on density map of most threatening trajectories (penetration corridors). We studied properties of these trajectories so as to f...

Full description

Saved in:
Bibliographic Details
Main Authors: Gauguelin, G., Barbaresco, F., Zolesio, J.P.
Format: Conference Proceeding
Language:English
Subjects:
Airborne radar
Aircraft
Anisotropic magnetoresistance
detection probability
Level set
Markov Chains
optimization
Phased arrays
Radar cross section
Radar detection
Radar tracking
Time factors
Trajectory
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 3
container_issue
container_start_page 1
container_title
container_volume
creator Gauguelin, G.
Barbaresco, F.
Zolesio, J.P.
description In this paper, we will address one key issue for radar load regulation related to dwell priority assignment of Search Domains. Threat Level of search beam position is based on density map of most threatening trajectories (penetration corridors). We studied properties of these trajectories so as to find theoretical results (existence or unicity) and also search algorithm which would be able to compute these trajectories. More particularly, we saw that the classical ¿shortest path algorithm¿ get useless when dealing with an additional local geometric constraints (local anisotropy of target Radar Cross Section). We built two sorts of algorithm in order to take this local constraint into account.
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_5438438</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5438438</ieee_id><sourcerecordid>5438438</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-bbc4702ea3133d8f07c27169cc5bd289c3074ab102e981dc9dfd1425c3831843</originalsourceid><addsrcrecordid>eNotjstKBDEQRYMPcBj7C9zkBxqSVJJKljL4ghEXuh-qk-oxg3ZLOgj-vQ26Oot7uJwzsTHeqh4R_LnoIgYTtQETnMMLsdEqYu_Q2yvRLctJKaWjR2dhI_zzvDTZ3itT46lMR9kqnTi1uRZeZJkkyUqZqkzzN1c6sqTVvRaXI30s3P1zK17v7952j_3-5eFpd7vvS1StH4ZkURkm0AA5jAqTQe1jSm7IJsQECi0NelVi0DnFPGZtjUsQQAcLW3Hz91qY-fBVyyfVn8PavW4BfgE8ZkIW</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Most threatening trajectories in a radar coverage area</title><source>IEEE Xplore All Conference Series</source><creator>Gauguelin, G. ; Barbaresco, F. ; Zolesio, J.P.</creator><creatorcontrib>Gauguelin, G. ; Barbaresco, F. ; Zolesio, J.P.</creatorcontrib><description>In this paper, we will address one key issue for radar load regulation related to dwell priority assignment of Search Domains. Threat Level of search beam position is based on density map of most threatening trajectories (penetration corridors). We studied properties of these trajectories so as to find theoretical results (existence or unicity) and also search algorithm which would be able to compute these trajectories. More particularly, we saw that the classical ¿shortest path algorithm¿ get useless when dealing with an additional local geometric constraints (local anisotropy of target Radar Cross Section). We built two sorts of algorithm in order to take this local constraint into account.</description><identifier>ISSN: 1097-5764</identifier><identifier>ISBN: 9782912328557</identifier><identifier>ISBN: 2912328551</identifier><identifier>EISSN: 2640-7736</identifier><language>eng</language><publisher>IEEE</publisher><subject>Airborne radar ; Aircraft ; Anisotropic magnetoresistance ; detection probability ; Level set ; Markov Chains ; optimization ; Phased arrays ; Radar cross section ; Radar detection ; Radar tracking ; Time factors ; Trajectory</subject><ispartof>2009 International Radar Conference "Surveillance for a Safer World" (RADAR 2009), 2009, p.1-3</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5438438$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2057,54554,54919,54931</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5438438$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Gauguelin, G.</creatorcontrib><creatorcontrib>Barbaresco, F.</creatorcontrib><creatorcontrib>Zolesio, J.P.</creatorcontrib><title>Most threatening trajectories in a radar coverage area</title><title>2009 International Radar Conference "Surveillance for a Safer World" (RADAR 2009)</title><addtitle>INTRADAR</addtitle><description>In this paper, we will address one key issue for radar load regulation related to dwell priority assignment of Search Domains. Threat Level of search beam position is based on density map of most threatening trajectories (penetration corridors). We studied properties of these trajectories so as to find theoretical results (existence or unicity) and also search algorithm which would be able to compute these trajectories. More particularly, we saw that the classical ¿shortest path algorithm¿ get useless when dealing with an additional local geometric constraints (local anisotropy of target Radar Cross Section). We built two sorts of algorithm in order to take this local constraint into account.</description><subject>Airborne radar</subject><subject>Aircraft</subject><subject>Anisotropic magnetoresistance</subject><subject>detection probability</subject><subject>Level set</subject><subject>Markov Chains</subject><subject>optimization</subject><subject>Phased arrays</subject><subject>Radar cross section</subject><subject>Radar detection</subject><subject>Radar tracking</subject><subject>Time factors</subject><subject>Trajectory</subject><issn>1097-5764</issn><issn>2640-7736</issn><isbn>9782912328557</isbn><isbn>2912328551</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjstKBDEQRYMPcBj7C9zkBxqSVJJKljL4ghEXuh-qk-oxg3ZLOgj-vQ26Oot7uJwzsTHeqh4R_LnoIgYTtQETnMMLsdEqYu_Q2yvRLctJKaWjR2dhI_zzvDTZ3itT46lMR9kqnTi1uRZeZJkkyUqZqkzzN1c6sqTVvRaXI30s3P1zK17v7952j_3-5eFpd7vvS1StH4ZkURkm0AA5jAqTQe1jSm7IJsQECi0NelVi0DnFPGZtjUsQQAcLW3Hz91qY-fBVyyfVn8PavW4BfgE8ZkIW</recordid><startdate>200910</startdate><enddate>200910</enddate><creator>Gauguelin, G.</creator><creator>Barbaresco, F.</creator><creator>Zolesio, J.P.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200910</creationdate><title>Most threatening trajectories in a radar coverage area</title><author>Gauguelin, G. ; Barbaresco, F. ; Zolesio, J.P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-bbc4702ea3133d8f07c27169cc5bd289c3074ab102e981dc9dfd1425c3831843</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Airborne radar</topic><topic>Aircraft</topic><topic>Anisotropic magnetoresistance</topic><topic>detection probability</topic><topic>Level set</topic><topic>Markov Chains</topic><topic>optimization</topic><topic>Phased arrays</topic><topic>Radar cross section</topic><topic>Radar detection</topic><topic>Radar tracking</topic><topic>Time factors</topic><topic>Trajectory</topic><toplevel>online_resources</toplevel><creatorcontrib>Gauguelin, G.</creatorcontrib><creatorcontrib>Barbaresco, F.</creatorcontrib><creatorcontrib>Zolesio, J.P.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gauguelin, G.</au><au>Barbaresco, F.</au><au>Zolesio, J.P.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Most threatening trajectories in a radar coverage area</atitle><btitle>2009 International Radar Conference "Surveillance for a Safer World" (RADAR 2009)</btitle><stitle>INTRADAR</stitle><date>2009-10</date><risdate>2009</risdate><spage>1</spage><epage>3</epage><pages>1-3</pages><issn>1097-5764</issn><eissn>2640-7736</eissn><isbn>9782912328557</isbn><isbn>2912328551</isbn><abstract>In this paper, we will address one key issue for radar load regulation related to dwell priority assignment of Search Domains. Threat Level of search beam position is based on density map of most threatening trajectories (penetration corridors). We studied properties of these trajectories so as to find theoretical results (existence or unicity) and also search algorithm which would be able to compute these trajectories. More particularly, we saw that the classical ¿shortest path algorithm¿ get useless when dealing with an additional local geometric constraints (local anisotropy of target Radar Cross Section). We built two sorts of algorithm in order to take this local constraint into account.</abstract><pub>IEEE</pub><tpages>3</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1097-5764
ispartof 2009 International Radar Conference "Surveillance for a Safer World" (RADAR 2009), 2009, p.1-3
issn 1097-5764
2640-7736
language eng
recordid cdi_ieee_primary_5438438
source IEEE Xplore All Conference Series
subjects Airborne radar
Aircraft
Anisotropic magnetoresistance
detection probability
Level set
Markov Chains
optimization
Phased arrays
Radar cross section
Radar detection
Radar tracking
Time factors
Trajectory
title Most threatening trajectories in a radar coverage area
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T15%3A42%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Most%20threatening%20trajectories%20in%20a%20radar%20coverage%20area&rft.btitle=2009%20International%20Radar%20Conference%20%22Surveillance%20for%20a%20Safer%20World%22%20(RADAR%202009)&rft.au=Gauguelin,%20G.&rft.date=2009-10&rft.spage=1&rft.epage=3&rft.pages=1-3&rft.issn=1097-5764&rft.eissn=2640-7736&rft.isbn=9782912328557&rft.isbn_list=2912328551&rft_id=info:doi/&rft_dat=%3Cieee_CHZPO%3E5438438%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-bbc4702ea3133d8f07c27169cc5bd289c3074ab102e981dc9dfd1425c3831843%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5438438&rfr_iscdi=true