多传感器在易损和带宽受限信道上的最优调度
Optimal Scheduling of Multiple Sensors over Lossy and Bandwidth Limited Channels
AI总结:
本文研究了多个动态过程的传感器调度问题,提出了一种集中式调度策略以最小化远程估计器的总预期估计误差和通信成本,并展示了单调策略的最优性,同时提供了一种基于索引的启发式方法来避免计算复杂性。
摘要:
本文考虑了多个动态过程的传感器调度问题。我们考虑n个线性动态过程,每个过程的状态由传感器测量,并通过无线信道将本地状态估计传输到远程估计器,这会带来一定的通信成本。在每个时间步,只允许一部分传感器传输数据到远程估计器,由于无线信道的不可靠性,数据包可能会丢失。我们的目标是找到一种调度策略,以集中方式协调传感器,以最小化远程估计器的总预期估计误差和通信成本。我们将问题建模为马尔可夫决策过程。我们开发了一种算法来检查是否存在确定性的平稳最优策略。我们证明了单调策略的最优性,这节省了寻找最优策略的计算努力,并促进了实际应用。然而,当过程数量较大时,获得精确的最优策略仍受到维度灾难的限制。我们进一步提供了一种基于索引的启发式方法以避免暴力计算。数值示例用于说明我们的理论结果。
英文摘要:
This work considers the sensor scheduling for multiple dynamic processes. We consider $n$ linear dynamic processes, the state of each process is measured by a sensor, which transmits their local state estimates over wireless channels to a remote estimator with certain communication costs. In each time step, only a portion of the sensors is allowed to transmit data to the remote estimator and the packet might be lost due to unreliability of the wireless channels. Our goal is to find a scheduling policy which coordinates the sensors in a centralized manner to minimize the total expected estimation error of the remote estimator and the communication costs. We formulate the problem as a Markov decision process. We develop an algorithm to check whether there exists a deterministic stationary optimal policy. We show the optimality of monotone policies, which saves computational effort of finding an optimal policy and facilitates practical implementation. Nevertheless, obtaining an exact optimal policy still suffers from curse of dimensionality when the number of processes are large. We further provide an index-based heuristics to avoid brute force computation. Numerical examples are presented to illustrate our theoretical results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。