Decentralized target localization in distributed MIMO radars

This paper addresses the problem of target estimation in distributed MIMO radars, focusing on the challenge of requiring a robust fusion center to process all the collected data. To overcome this limitation, we propose a solution based on the Alternating Direction Method of Multipliers (ADMM) that eliminates the need for a centralized fusion center. By leveraging the sparsity of target location information within the detection range, the target localization problem is reformulated as a sparse recovery problem, which is then efficiently solved using ADMM. The key innovation of the proposed approach is the transformation of the average value computation, typically required in centralized methods, into a consensus averaging problem, and subsequently into a consensus optimization problem. This transformation allows for fully decentralized processing, where each node only communicates with its neighboring nodes to reach a consensus on the estimation of target location. Simulation results demonstrate that the proposed distributed algorithm achieves performance comparable to that of semi-distributed algorithms while fully exploiting the advantages of decentralization.

Authors

Institutions

Publication Details

Published
2025-03-31
DOI
https://doi.org/10.1117/12.3061899
Primary Topic
Radar Systems and Signal Processing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decentralized target localization in distributed MIMO radars

Qinglai Qiu, Jie Li, Feng Xi
Radar Systems and Signal Processing
article

Decentralized target localization in distributed MIMO radars

Qinglai Qiu, Jie Li, Feng Xi
article en

Abstract

This paper addresses the problem of target estimation in distributed MIMO radars, focusing on the challenge of requiring a robust fusion center to process all the collected data. To overcome this limitation, we propose a solution based on the Alternating Direction Method of Multipliers (ADMM) that eliminates the need for a centralized fusion center. By leveraging the sparsity of target location information within the detection range, the target localization problem is reformulated as a sparse recovery problem, which is then efficiently solved using ADMM. The key innovation of the proposed approach is the transformation of the average value computation, typically required in centralized methods, into a consensus averaging problem, and subsequently into a consensus optimization problem. This transformation allows for fully decentralized processing, where each node only communicates with its neighboring nodes to reach a consensus on the estimation of target location. Simulation results demonstrate that the proposed distributed algorithm achieves performance comparable to that of semi-distributed algorithms while fully exploiting the advantages of decentralization.

Nanjing University of Science and Technology (CN)
Openalex Percentile: Top 92%
Radar Systems and Signal Processing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.