Optimization Based Sensor Placement for Multi-Target Localization With Coupling Sensor Clusters

IF 3 3区 计算机科学 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-08-28 DOI:10.1109/TSIPN.2023.3307899
Linlong Wu;Nitesh Sahu;Sheng Xu;Prabhu Babu;Domenico Ciuonzo
{"title":"Optimization Based Sensor Placement for Multi-Target Localization With Coupling Sensor Clusters","authors":"Linlong Wu;Nitesh Sahu;Sheng Xu;Prabhu Babu;Domenico Ciuonzo","doi":"10.1109/TSIPN.2023.3307899","DOIUrl":null,"url":null,"abstract":"Since the Cramér-Rao lower bounds (CRLB) of target localization depends on the sensor geometry explicitly, sensor placement becomes a crucial issue in many target or source localization applications. In the context of simultaneous time-of-arrival (TOA) based multi-target localization, we consider the sensor placement for multiple sensor clusters in the presence of shared sensors. To minimize the mean squared error (MSE) of target localization, we formulate the sensor placement problem as a minimization of the trace of the Cramér-Rao lower bound (CRLB) matrix (i.e., \n<inline-formula><tex-math>$A$</tex-math></inline-formula>\n-optimal design), subject to the coupling constraints corresponding to the freely-placed shared sensors. For the formulated nonconvex problem, we propose an optimization approach based on the combination of alternating minimization (AM), alternating direction method of multipliers (ADMM) and majorization-minimization (MM), in which the AM alternates between sensor clusters and the integrated ADMM and MM are employed to solve the subproblems. The proposed algorithm monotonically minimizes the joint design criterion and converges to a stationary point of the objective. Unlike the state-of-the-art analytical approaches in the literature, the proposed algorithm can handle both the non-uniform and correlated measurement noise in the simultaneous multi-target case. Through various numerical simulations under different scenario settings, we show the efficiency of the proposed method to design the optimal sensor geometry.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"596-611"},"PeriodicalIF":3.0000,"publicationDate":"2023-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Signal and Information Processing over Networks","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10232859/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Since the Cramér-Rao lower bounds (CRLB) of target localization depends on the sensor geometry explicitly, sensor placement becomes a crucial issue in many target or source localization applications. In the context of simultaneous time-of-arrival (TOA) based multi-target localization, we consider the sensor placement for multiple sensor clusters in the presence of shared sensors. To minimize the mean squared error (MSE) of target localization, we formulate the sensor placement problem as a minimization of the trace of the Cramér-Rao lower bound (CRLB) matrix (i.e., $A$ -optimal design), subject to the coupling constraints corresponding to the freely-placed shared sensors. For the formulated nonconvex problem, we propose an optimization approach based on the combination of alternating minimization (AM), alternating direction method of multipliers (ADMM) and majorization-minimization (MM), in which the AM alternates between sensor clusters and the integrated ADMM and MM are employed to solve the subproblems. The proposed algorithm monotonically minimizes the joint design criterion and converges to a stationary point of the objective. Unlike the state-of-the-art analytical approaches in the literature, the proposed algorithm can handle both the non-uniform and correlated measurement noise in the simultaneous multi-target case. Through various numerical simulations under different scenario settings, we show the efficiency of the proposed method to design the optimal sensor geometry.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于优化的传感器阵列耦合多目标定位
由于目标定位的Cramér-Rao下界(CRLB)明确地取决于传感器的几何形状,因此传感器的放置在许多目标或源定位应用中成为一个关键问题。在基于同时到达时间(TOA)的多目标定位的背景下,我们考虑在存在共享传感器的情况下多个传感器集群的传感器放置。为了最小化目标定位的均方误差(MSE),我们将传感器放置问题公式化为Cramér-Rao下界(CRLB)矩阵的迹的最小化(即$a$-最优设计),受与自由放置的共享传感器相对应的耦合约束。对于公式化的非凸问题,我们提出了一种基于交替最小化(AM)、乘法器交替方向法(ADMM)和优化最小化(MM)相结合的优化方法,其中AM在传感器簇之间交替,并且使用集成的ADMM和MM来解决子问题。所提出的算法单调最小化联合设计准则,并收敛到目标的平稳点。与文献中最先进的分析方法不同,所提出的算法可以在同时存在多目标的情况下处理非均匀和相关的测量噪声。通过在不同场景设置下的各种数值模拟,我们展示了所提出的方法设计最佳传感器几何结构的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Signal and Information Processing over Networks
IEEE Transactions on Signal and Information Processing over Networks Computer Science-Computer Networks and Communications
CiteScore
5.80
自引率
12.50%
发文量
56
期刊介绍: The IEEE Transactions on Signal and Information Processing over Networks publishes high-quality papers that extend the classical notions of processing of signals defined over vector spaces (e.g. time and space) to processing of signals and information (data) defined over networks, potentially dynamically varying. In signal processing over networks, the topology of the network may define structural relationships in the data, or may constrain processing of the data. Topics include distributed algorithms for filtering, detection, estimation, adaptation and learning, model selection, data fusion, and diffusion or evolution of information over such networks, and applications of distributed signal processing.
期刊最新文献
Reinforcement Learning-Based Event-Triggered Constrained Containment Control for Perturbed Multiagent Systems Finite-Time Performance Mask Function-Based Distributed Privacy-Preserving Consensus: Case Study on Optimal Dispatch of Energy System Discrete-Time Controllability of Cartesian Product Networks Generalized Simplicial Attention Neural Networks A Continuous-Time Algorithm for Distributed Optimization With Nonuniform Time-Delay Under Switching and Unbalanced Digraphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1