Yann Briheche, F. Barbaresco, F. Bennis, D. Chablat
{"title":"有限时间预算下固定面板雷达搜索模式优化的更新率约束","authors":"Yann Briheche, F. Barbaresco, F. Bennis, D. Chablat","doi":"10.23919/IRS.2017.8008155","DOIUrl":null,"url":null,"abstract":"Electronic Phased-Array Radars offer new possibilities for Radar Search Pattern Optimization by using bi-dimensional beam-forming and beam steering, along both elevation and azimuth axes. The Radar Search Pattern Optimization problem can be approximated as a Set Cover problem and solved using Integer Programming methods. This approximation can be extended to account for direction-specific scan update rates constraints without the need to modify the optimization algorithm.","PeriodicalId":430241,"journal":{"name":"2017 18th International Radar Symposium (IRS)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Update rates constraints in fixed-panel Radar Search Pattern Optimization with limited time budget\",\"authors\":\"Yann Briheche, F. Barbaresco, F. Bennis, D. Chablat\",\"doi\":\"10.23919/IRS.2017.8008155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Electronic Phased-Array Radars offer new possibilities for Radar Search Pattern Optimization by using bi-dimensional beam-forming and beam steering, along both elevation and azimuth axes. The Radar Search Pattern Optimization problem can be approximated as a Set Cover problem and solved using Integer Programming methods. This approximation can be extended to account for direction-specific scan update rates constraints without the need to modify the optimization algorithm.\",\"PeriodicalId\":430241,\"journal\":{\"name\":\"2017 18th International Radar Symposium (IRS)\",\"volume\":\"217 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 18th International Radar Symposium (IRS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/IRS.2017.8008155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 18th International Radar Symposium (IRS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/IRS.2017.8008155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Update rates constraints in fixed-panel Radar Search Pattern Optimization with limited time budget
Electronic Phased-Array Radars offer new possibilities for Radar Search Pattern Optimization by using bi-dimensional beam-forming and beam steering, along both elevation and azimuth axes. The Radar Search Pattern Optimization problem can be approximated as a Set Cover problem and solved using Integer Programming methods. This approximation can be extended to account for direction-specific scan update rates constraints without the need to modify the optimization algorithm.