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.

中文翻译：

---

网络上的最优极小极大移动传感器调度

我们研究了使用单个移动传感器监控多个目标的问题，目标是在长时间范围内最小化所有目标之间的最大估计误差。传感器可以在网络受限的结构中移动，它必须计划访问哪些目标以及在每个节点停留多长时间。我们证明，在最佳观测时间分配中，所有目标之间的峰值不确定性是相同的。通过进一步限制代理策略在每个周期只访问每个目标一次，我们开发了一种优化代理行为的方案，与以前解决类似问题的方法相比，该方案在计算上要简单得多。