arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.12936eess.SYcs.SY
收藏

及时目标跟踪:认知雷达网络中的分布式更新

Timely Target Tracking: Distributed Updating in Cognitive Radar Networks

William W. Howard, Anthony F. Martone, R. Michael Buehrer

AI总结:

针对认知雷达网络多目标跟踪中的信息新鲜度与更新速率约束,提出基于 AoI 的集中式节点选择和基于 AoII 的分布式更新方法,并证明二者速率限制等价且性能更优。

摘要:

认知雷达网络(CRN)能够优化运行参数,以便向操作员或次级系统提供可据以行动的信息。CRN 已被提出用于满足低成本设备跟踪地理上分散区域中潜在大量目标的需求。由小规模设备组成的网络也已被证明优于传统的大规模、高价格单设备部署。在本工作中,我们考虑一个跟踪多个目标的 CRN,其目标是向测量融合中心(FC)提供既新鲜又准确的信息。我们表明,在每个雷达节点更新速率受到约束的情况下,网络能够利用信息年龄(AoI)指标来最大化资源利用率并最小化每条航迹的误差。由于信息新鲜度对决策至关重要,这种结构使 CRN 能够向下游系统或操作员提供尽可能高质量的信息。我们讨论了解决该问题的集中式和分布式方法,同时考虑节点观测质量、每个目标的机动性,以及任何节点可向 FC 提供更新的速率限制。我们提出了一种受 AoI 启发的集中式节点选择指标,其中 FC 向特定节点请求更新。我们将其与若干替代技术进行比较。此外,我们提供了一种利用错误信息年龄(AoII)指标的分布式方法,允许每个独立节点根据其能够观测到的目标提供更新。我们对集中式和分布式方法所定义的速率限制进行了数学分析,表明二者是等价的。最后,我们通过数值仿真证明,所提算法在资源利用率和跟踪性能方面均优于替代方法。

英文摘要:

Cognitive radar networks (CRNs) are capable of optimizing operating parameters in order to provide actionable information to an operator or secondary system. CRNs have been proposed to answer the need for low-cost devices tracking potentially large numbers of targets in geographically diverse regions. Networks of small-scale devices have also been shown to outperform legacy, large scale, high price, single-device installations. In this work, we consider a CRN tracking multiple targets with a goal of providing information which is both fresh and accurate to a measurement fusion center (FC). We show that under a constraint on the update rate of each radar node, the network is able to utilize Age of Information (AoI) metrics to maximize the resource utilization and minimize error per track. Since information freshness is critical to decision-making, this structure enables a CRN to provide the highest-quality information possible to a downstream system or operator. We discuss centralized and distributed approaches to solving this problem, taking into account the quality of node observations, the maneuverability of each target, and a limit on the rate at which any node may provide updates to the FC. We present a centralized AoI-inspired node selection metric, where a FC requests updates from specific nodes. We compare this against several alternative techniques. Further, we provide a distributed approach which utilizes the Age of Incorrect Information (AoII) metric, allowing each independent node to provide updates according to the targets it can observe. We provide mathematical analysis of the rate limits defined for the centralized and distributed approaches, showing that they are equivalent. We conclude with numerical simulations demonstrating that the performance of the algorithms exceeds that of alternative approaches, both in resource utilization and in tracking performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑