稀疏动态目标的资源受限自适应搜索与跟踪
Resource-Constrained Adaptive Search and Tracking for Sparse Dynamic Targets
摘要:
研究了资源受限和噪声受限条件下大范围稀疏分布动态目标的定位与估计问题。我们将现有的框架[Bashan et al,2008]推广到动态情况下,用于自适应分配传感资源,考虑时变目标行为,例如过渡到相邻细胞和在潜在的长时间范围内变化幅度。所提出的自适应传感策略是由最小化的修改版本的先前介绍的ARAP目标函数,这是一个代理函数的均方误差内包含目标的位置。我们提供了理论上的自适应传感策略的性能上限,通过分析解决方案与目标位置的Oracle知识,洞察目标运动和幅度变化以及稀疏性的影响。多阶段目标函数的精确最小化是不可行的,但近视优化产生一个封闭形式的解决方案。我们提出了一个简单的非近视扩展,动态自适应资源分配政策(D-ARAP),分配一小部分资源用于探索所有位置,而不是仅仅利用当前的信念状态。我们的数值研究表明,D-ARAP具有以下优点:(a)它是更强大的比近视的政策,噪声,丢失的数据,和模型失配;(b)它执行了众所周知的近似动态规划的解决方案,但在显着较低的计算复杂性;和(c)它大大提高了非自适应均匀资源分配的估计误差和检测概率。
英文摘要:
This paper considers the problem of resource-constrained and noise-limited localization and estimation of dynamic targets that are sparsely distributed over a large area. We generalize an existing framework [Bashan et al, 2008] for adaptive allocation of sensing resources to the dynamic case, accounting for time-varying target behavior such as transitions to neighboring cells and varying amplitudes over a potentially long time horizon. The proposed adaptive sensing policy is driven by minimization of a modified version of the previously introduced ARAP objective function, which is a surrogate function for mean squared error within locations containing targets. We provide theoretical upper bounds on the performance of adaptive sensing policies by analyzing solutions with oracle knowledge of target locations, gaining insight into the effect of target motion and amplitude variation as well as sparsity. Exact minimization of the multi-stage objective function is infeasible, but myopic optimization yields a closed-form solution. We propose a simple non-myopic extension, the Dynamic Adaptive Resource Allocation Policy (D-ARAP), that allocates a fraction of resources for exploring all locations rather than solely exploiting the current belief state. Our numerical studies indicate that D-ARAP has the following advantages: (a) it is more robust than the myopic policy to noise, missing data, and model mismatch; (b) it performs comparably to well-known approximate dynamic programming solutions but at significantly lower computational complexity; and (c) it improves greatly upon non-adaptive uniform resource allocation in terms of estimation error and probability of detection.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。