{"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.
期刊介绍:
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.