短视策略界限用于信息获取POMDPs
Myopic Policy Bounds for Information Acquisition POMDPs
AI总结:
本文研究了机器人传感系统在环境监测、搜索救援和侦察等场景中的自主信息采集问题,通过部分可观测马尔可夫决策过程(POMDP)建模,提出基于短视计算的策略上下界方法,用于加速最优策略的求解。
摘要:
本文针对机器人传感系统在自主信息采集中的最优控制问题,将其建模为部分可观测马尔可夫决策过程(POMDP),其中奖励函数用于捕捉不确定性降低。与经典POMDP不同,所得奖励结构在信念状态中非线性,传统方法不适用。本文不开发新近似算法,而是通过短视计算推导出策略的上下界,结合在线分支定界算法加速最优策略计算。在目标跟踪领域,通过低计算成本获得信息丰富的上下界,并展示了分支定界方法与精确值迭代的性能对比。
英文摘要:
This paper addresses the problem of optimal control of robotic sensing systems aimed at autonomous information gathering in scenarios such as environmental monitoring, search and rescue, and surveillance and reconnaissance. The information gathering problem is formulated as a partially observable Markov decision process (POMDP) with a reward function that captures uncertainty reduction. Unlike the classical POMDP formulation, the resulting reward structure is nonlinear in the belief state and the traditional approaches do not apply directly. Instead of developing a new approximation algorithm, we show that if attention is restricted to a class of problems with certain structural properties, one can derive (often tight) upper and lower bounds on the optimal policy via an efficient myopic computation. These policy bounds can be applied in conjunction with an online branch-and-bound algorithm to accelerate the computation of the optimal policy. We obtain informative lower and upper policy bounds with low computational effort in a target tracking domain. The performance of branch-and-bounding is demonstrated and compared with exact value iteration.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。