在有限时间范围内最大化效用的顺序传感
Utility Maximizing Sequential Sensing Over a Finite Horizon
AI总结:
研究在有限时间内通过顺序传感和利用资源以最大化预期效用的问题,提出基于动态阈值和最优选择规则的策略,通过仿真验证其近似最优性,应用于频谱接入和营销策略等场景。
摘要:
我们考虑如何最优利用N个未知二进制状态的资源的问题。每个资源的状态可以通过依赖状态的噪声测量来推断。根据其状态,利用资源会产生每单位时间的奖励或惩罚。目标是设计一个顺序策略,在每个时间点决定传感和利用的决策以最大化有限时间L内的预期效用(即总奖励减总惩罚和传感成本)。我们将问题建模为部分可观测马尔可夫决策过程(POMDP),并证明最优策略基于每个资源的两个时间变化阈值和最优选择规则,用于决定传感哪个资源。由于完全描述最优策略通常不可行,我们开发了一种低复杂度的策略,通过仿真显示其近似最优性。该问题在机会频谱接入、营销策略和其他顺序资源分配问题中具有应用。
英文摘要:
We consider the problem of optimally utilizing $N$ resources, each in an unknown binary state. The state of each resource can be inferred from state-dependent noisy measurements. Depending on its state, utilizing a resource results in either a reward or a penalty per unit time. The objective is a sequential strategy governing the decision of sensing and exploitation at each time to maximize the expected utility (i.e., total reward minus total penalty and sensing cost) over a finite horizon $L$. We formulate the problem as a Partially Observable Markov Decision Process (POMDP) and show that the optimal strategy is based on two time-varying thresholds for each resource and an optimal selection rule for which resource to sense. Since a full characterization of the optimal strategy is generally intractable, we develop a low-complexity policy that is shown by simulations to offer near optimal performance. This problem finds applications in opportunistic spectrum access, marketing strategies and other sequential resource allocation problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。