One of the most complex tasks of decision making and planning is to gather information. This task becomes even more complex when the state is high-dimensional and its belief cannot be expressed with a parametric distribution. Although the state is high-dimensional, in many problems only a small fraction of it might be involved in transitioning the state and generating observations. We exploit this fact to calculate an information-theoretic expected reward, mutual information (MI), over a much lower-dimensional subset of the state, to improve efficiency and without sacrificing accuracy. A similar approach was used in previous works, yet specifically for Gaussian distributions, and we here extend it for general distributions. Moreover, we apply the dimensionality reduction for cases in which the new states are augmented to the previous, yet again without sacrificing accuracy. We then continue by developing an estimator for the MI which works in a Sequential Monte Carlo (SMC) manner, and avoids the reconstruction of future belief's surfaces. Finally, we show how this work is applied to the informative planning optimization problem. This work is then evaluated in a simulation of an active SLAM problem, where the improvement in both accuracy and timing is demonstrated.
翻译:最复杂的决策和规划任务之一是收集信息。当国家是高度的,而其信仰不能以参数分布来表达时,这项任务就变得更加复杂。虽然国家是高度的,但在许多问题上,只有一小部分问题可能涉及国家转型和产生观察。我们利用这个事实来计算信息理论预期的奖赏、相互信息(MI),超过国家的低维子集,提高效率和避免牺牲准确性。在以前的工作中,采用了类似的方法,但具体针对高山分布,我们在此扩展为一般分布。此外,我们对新国家扩大至前一,但又不牺牲准确性的案例适用维度减法。然后我们继续开发一个MI的估测器,以序列式蒙特卡洛(SMC)方式工作,避免重建未来信仰的表面。最后,我们展示了这项工作如何适用于信息化的规划优化问题。然后,在模拟一个活跃的SLAMM问题时,对这项工作进行了评估,以显示准确性和时间上的改进。