計算資源に応じて抽象化が創発する経路計画フレームワーク
Information-Theoretic Abstractions for Planning in Agents with Computational Constraints
エージェントの計算資源量に応じて環境の抽象化が動的に生まれ、その上で経路計画を段階的に解く枠組みを提案し、理論解析と数値例で有効性を示した論文。
著者: Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras
分類: cs.RO, cs.AI, cs.IT, math.IT
原文アブストラクト
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.
