论文标题

在共享渠道上安排观察者,并带有硬交付截止日期

Scheduling Observers Over a Shared Channel with Hard Delivery Deadlines

论文作者

Jurdi, Rebal, Andrews, Jeffrey G., Heath Jr, Robert W.

论文摘要

我们从需要超低延迟无线通信的应用程序中抽象出核心逻辑功能,以提供可靠性的新颖定义。实时应用程序(例如智能运输,远程手术和工业自动化)涉及控制和决策的重要因素。这样的系统涉及三个逻辑组件:观察者(例如传感器)测量环境或动态系统的状态,决定国家的集中行政人员(例如,控制者),以及实施执行官决定的代理人(例如执行者)。执行人员通过指示其代理采取适当的行动来收获观察者的测量结果,并决定系统的短期轨迹。所有观察数据包(通常是上行链路)和动作数据包(通常是下行链路)必须由硬期限来交付,以确保受控系统的正确运行。由于频道中固有的不确定性,例如褪色和不可预测的干扰,因此无法在无线系统中保证按时交付。因此,高管将不得不放弃一些数据包。我们开发了一个新颖的框架来制定观察者选择问题(OSP),通过该问题,高管计划通过该框架进行一系列观察,以最大程度地提高其对系统当前状态的了解。为了有效地解决这个问题,我们设计了一种系统地修剪搜索空间的分支和结合算法。我们的工作不同于现有的实时通信工作,因为交流可靠性不是通过数据包丢失或错误率来传达的,而是通过高管对其控制系统状态的了解的程度来传达的。

We abstract the core logical functions from applications that require ultra-low-latency wireless communications to provide a novel definition for reliability. Real-time applications -- such as intelligent transportation, remote surgery, and industrial automation -- involve a significant element of control and decision making. Such systems involve three logical components: observers (e.g. sensors) measuring the state of an environment or dynamical system, a centralized executive (e.g. controller) deciding on the state, and agents (e.g. actuators) that implement the executive's decisions. The executive harvests the observers' measurements and decides on the short-term trajectory of the system by instructing its agents to take appropriate actions. All observation packets (typically uplink) and action packets (typically downlink) must be delivered by hard deadlines to ensure the proper functioning of the controlled system. In-full on-time delivery cannot be guaranteed in wireless systems due to inherent uncertainties in the channel such as fading and unpredictable interference; accordingly, the executive will have to drop some packets. We develop a novel framework to formulate the observer selection problem (OSP) through which the executive schedules a sequence of observations that maximize its knowledge about the current state of the system. To solve this problem efficiently yet optimally, we devise a branch-and-bound algorithm that systematically prunes the search space. Our work is different from existing work on real-time communications in that communication reliability is not conveyed by packet loss or error rate, but rather by the extent of the executive's knowledge about the state of the system it controls.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源