论文标题
具有计算限制的代理商计划的信息理论抽象
Information-Theoretic Abstractions for Planning in Agents with Computational Constraints
论文作者
论文摘要
在本文中，我们开发了一个框架，用于在未提供给代理商先验的抽象上，而是作为可用计算资源的函数出现的。我们展示了如何通过求解一系列更易于在原始空间的抽象上解决问题的顺序来系统地近似环境中的路径规划问题。分析了问题的属性，并介绍和讨论了许多理论结果。提出了一个数字示例，以显示方法的实用性并证实理论发现。最后，我们提供了一个讨论，详细介绍了拟议方法与任何时间算法和有限理性的联系。
In this paper, we develop a framework for path-planning on abstractions that are not provided to the agent a priori but instead emerge as a function of the available computational resources. We show how a path-planning problem in an environment can be systematically approximated by solving a sequence of easier to solve problems on abstractions of the original space. The properties of the problem are analyzed, and a number of theoretical results are presented and discussed. A numerical example is presented to show the utility of the approach and to corroborate the theoretical findings. We conclude by providing a discussion detailing the connections of the proposed approach to anytime algorithms and bounded rationality.
