Yann Briheche, F. Barbaresco, F. Bennis, D. Chablat, F. Gosselin
{"title":"基于整数规划的方向余弦空间雷达搜索模式非均匀约束优化","authors":"Yann Briheche, F. Barbaresco, F. Bennis, D. Chablat, F. Gosselin","doi":"10.1109/IRS.2016.7497343","DOIUrl":null,"url":null,"abstract":"Electronic Phased-Array Radars offer new possibilities for Radar Search Pattern Optimization by using variable beam-shapes. Radar Search Pattern Optimization can be approximated by a Set Covering Problem. This allows automatic generation of Search Patterns for non-uniform constrained environments in operational situation. We present a Set Covering Problem approximation for Time-Budget minimization of Search Patterns, in Direction Cosines space, under constraints of range and detection probability.","PeriodicalId":346680,"journal":{"name":"2016 17th International Radar Symposium (IRS)","volume":"211 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Non-uniform constrained optimization of radar search patterns in direction cosines space using integer programming\",\"authors\":\"Yann Briheche, F. Barbaresco, F. Bennis, D. Chablat, F. Gosselin\",\"doi\":\"10.1109/IRS.2016.7497343\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Electronic Phased-Array Radars offer new possibilities for Radar Search Pattern Optimization by using variable beam-shapes. Radar Search Pattern Optimization can be approximated by a Set Covering Problem. This allows automatic generation of Search Patterns for non-uniform constrained environments in operational situation. We present a Set Covering Problem approximation for Time-Budget minimization of Search Patterns, in Direction Cosines space, under constraints of range and detection probability.\",\"PeriodicalId\":346680,\"journal\":{\"name\":\"2016 17th International Radar Symposium (IRS)\",\"volume\":\"211 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 17th International Radar Symposium (IRS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IRS.2016.7497343\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 17th International Radar Symposium (IRS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRS.2016.7497343","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Non-uniform constrained optimization of radar search patterns in direction cosines space using integer programming
Electronic Phased-Array Radars offer new possibilities for Radar Search Pattern Optimization by using variable beam-shapes. Radar Search Pattern Optimization can be approximated by a Set Covering Problem. This allows automatic generation of Search Patterns for non-uniform constrained environments in operational situation. We present a Set Covering Problem approximation for Time-Budget minimization of Search Patterns, in Direction Cosines space, under constraints of range and detection probability.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
