使用MDL准则的多传感器单方位跟踪

R. Iltis, K.L. Anderson
{"title":"使用MDL准则的多传感器单方位跟踪","authors":"R. Iltis, K.L. Anderson","doi":"10.1109/ACSSC.1993.342503","DOIUrl":null,"url":null,"abstract":"The problem of multitarget tracking using bearings-only measurements is addressed, when the number of targets is unknown a-priori. The minimum description length (MDL) criterion of Rissanen (1983) is first chosen as a natural way to determine the number of targets when a prior distribution is unavailable. However, it is shown that the MDL criterion lends to overestimate the number of targets, and hence a modified criterion is proposed. The resulting algorithm corresponds to the computation of joint maximum likelihood estimates of target states and associations, with an additional penalty term to prevent overparameterization. The problem of data association is solved using a set of parallel simulated annealing algorithms over the sensors and scans. As the associations are formed by annealing, a conventional nonlinear programming algorithm simultaneously estimates the target states (position and velocity). The consistency of the new estimation criterion is proven analytically in the case of a clean environment. Simulation results are presented which compare the tracking performance of the MDL and modified estimation algorithms, for cases with and without clutter.<<ETX>>","PeriodicalId":266447,"journal":{"name":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multisensor bearings-only tracking using the MDL criterion\",\"authors\":\"R. Iltis, K.L. Anderson\",\"doi\":\"10.1109/ACSSC.1993.342503\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of multitarget tracking using bearings-only measurements is addressed, when the number of targets is unknown a-priori. The minimum description length (MDL) criterion of Rissanen (1983) is first chosen as a natural way to determine the number of targets when a prior distribution is unavailable. However, it is shown that the MDL criterion lends to overestimate the number of targets, and hence a modified criterion is proposed. The resulting algorithm corresponds to the computation of joint maximum likelihood estimates of target states and associations, with an additional penalty term to prevent overparameterization. The problem of data association is solved using a set of parallel simulated annealing algorithms over the sensors and scans. As the associations are formed by annealing, a conventional nonlinear programming algorithm simultaneously estimates the target states (position and velocity). The consistency of the new estimation criterion is proven analytically in the case of a clean environment. Simulation results are presented which compare the tracking performance of the MDL and modified estimation algorithms, for cases with and without clutter.<<ETX>>\",\"PeriodicalId\":266447,\"journal\":{\"name\":\"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.1993.342503\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 27th Asilomar Conference on Signals, Systems and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.1993.342503","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

研究了当目标数量先验未知时,单方位测量的多目标跟踪问题。首先选择Rissanen(1983)的最小描述长度(minimum description length, MDL)准则,作为无法获得先验分布时确定目标数量的自然方法。然而,研究表明,MDL标准会导致对目标数量的高估,因此提出了一种改进的标准。所得到的算法对应于目标状态和关联的联合最大似然估计的计算,并带有额外的惩罚项以防止过度参数化。利用一组并行模拟退火算法解决了传感器和扫描数据的关联问题。传统的非线性规划算法通过退火形成关联,同时估计目标状态(位置和速度)。在清洁环境的情况下,分析证明了新估计准则的一致性。仿真结果比较了MDL和改进估计算法在有杂波和无杂波情况下的跟踪性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multisensor bearings-only tracking using the MDL criterion
The problem of multitarget tracking using bearings-only measurements is addressed, when the number of targets is unknown a-priori. The minimum description length (MDL) criterion of Rissanen (1983) is first chosen as a natural way to determine the number of targets when a prior distribution is unavailable. However, it is shown that the MDL criterion lends to overestimate the number of targets, and hence a modified criterion is proposed. The resulting algorithm corresponds to the computation of joint maximum likelihood estimates of target states and associations, with an additional penalty term to prevent overparameterization. The problem of data association is solved using a set of parallel simulated annealing algorithms over the sensors and scans. As the associations are formed by annealing, a conventional nonlinear programming algorithm simultaneously estimates the target states (position and velocity). The consistency of the new estimation criterion is proven analytically in the case of a clean environment. Simulation results are presented which compare the tracking performance of the MDL and modified estimation algorithms, for cases with and without clutter.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信