论文标题
网络上的最佳minimax移动传感器调度
Optimal Minimax Mobile Sensor Scheduling Over a Network
论文作者
论文摘要
我们研究了使用单个移动传感器监视多个目标的问题，目的是最大程度地减少所有目标之间所有目标之间的最大估计误差。传感器可以在网络受限的结构中移动，在该结构中必须计划要访问的目标以及在每个节点上停留多长时间。我们证明，在最佳观察时间分配中，所有目标之间的峰值不确定性是相同的。通过进一步限制代理策略仅访问每个目标一次，我们开发了一个方案来优化代理的行为，与以前的类似问题相比，计算在计算上明显更简单。
We investigate the problem of monitoring multiple targets using a single mobile sensor, with the goal of minimizing the maximum estimation error among all the targets over long time horizons. The sensor can move in a network-constrained structure, where it has to plan which targets to visit and for how long to dwell at each node. We prove that in an optimal observation time allocation, the peak uncertainty is the same among all the targets. By further restricting the agent policy to only visit each target once every cycle, we develop a scheme to optimize the agent's behavior that is significantly simpler computationally when compared to previous approaches for similar problems.
