.png){kind=icon}
返回
Attention allocation for decision making queues
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2013.11.028.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the optimal servicing of a queue with sigmoid server performance. There are various systems with sigmoid server performance, including systems involving human decision making, visual perception, human machine communication and advertising response. Tasks arrive at the server according to a Poisson process. Each task has a deadline that is incorporated as a latency penalty. We investigate the trade-off between the reward obtained by processing the current task and the penalty incurred due to the tasks waiting in the queue. We study this optimization problem in a Markov decision process (MDP) framework. We characterize the properties of the optimal policy for the MDP and show that the optimal policy may drop some tasks; that is, may not process a task at all. We determine an approximate solution to the MDP using the certainty-equivalent receding horizon optimization framework and derive performance bounds on the proposed receding horizon policy. We also suggest guidelines for the design of such queues. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Sigmoid utility
Human decision making
Control of queues
Human-robot interaction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
Adjuvant chemotherapy in early breast cancer and incidence of new primary malignancies.png)
The Lancet
The LancetIF0
PREAI
分享收藏O-15 - Latent class analysis of ptsd symptoms among 6,733 New York City students exposed to 9/11
PREAI
分享收藏The shape of advertising response functions revisited: A model of dynamic probabilistic thresholds
PREAI
分享收藏
分享收藏
查看更多内容