A. Capponi, C. Pilotto, G. Golino, A. Farina, Lance M. Kaplan
{"title":"Algorithms for the selection of the active sensors in distributed tracking: comparison between Frisbee and GNS methods","authors":"A. Capponi, C. Pilotto, G. Golino, A. Farina, Lance M. Kaplan","doi":"10.1109/ICIF.2006.301592","DOIUrl":null,"url":null,"abstract":"This paper compares two different approaches for sensor selection for distributed tracking: 1) the Frisbee method, and 2) global node selection (GNS). The Frisbee method is based on the proximity of the nodes to the predicted location of the target; GNS is based on minimizing the unbiased Cramer Rao lower bound (CRLB). Both theoretical and experimental results indicate that the Frisbee method is as effective as GNS. Furthermore, the Frisbee method is attractive due to its very light computational load","PeriodicalId":248061,"journal":{"name":"2006 9th International Conference on Information Fusion","volume":"299 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 9th International Conference on Information Fusion","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIF.2006.301592","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
This paper compares two different approaches for sensor selection for distributed tracking: 1) the Frisbee method, and 2) global node selection (GNS). The Frisbee method is based on the proximity of the nodes to the predicted location of the target; GNS is based on minimizing the unbiased Cramer Rao lower bound (CRLB). Both theoretical and experimental results indicate that the Frisbee method is as effective as GNS. Furthermore, the Frisbee method is attractive due to its very light computational load
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
