Accelerating Empowerment Computation with UCT Tree Search
원문 초록
Models of intrinsic motivation present an important means to produce sensible behaviour in the absence of extrinsic rewards. Applications in video games are varied, and range from intrinsically motivated general game-playing agents to non-player characters such as companions and enemies. The information-theoretic quantity of Empowerment is a particularly promising candidate motivation to produce believable, generic and robust behaviour. However, while it can be used in the absence of external reward functions that would need to be crafted and learned, empowerment is computationally expensive. In this paper, we propose a modified UCT tree search method to mitigate empowerment's computational complexity in discrete and deterministic scenarios. We demonstrate how to modify a Monte-Carlo Search Tree with UCT to realise empowerment maximisation, and discuss three additional modifications that facilitate better sampling. We evaluate the approach both quantitatively, by analysing how close our approach gets to the baseline of exhaustive empowerment computation with varying amounts of computational resources, and qualitatively, by analysing the resulting behaviour in a Minecraft-like scenario.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Matrix-Game: Interactive World Foundation Model
TransDreamerV3: Implanting Transformer In DreamerV3
Toward Memory-Aided World Models: Benchmarking via Spatial Consistency
MineAnyBuild: Benchmarking Spatial Planning for Open-world AI Agents
BAR: A Backward Reasoning based Agent for Complex Minecraft Tasks
BeliefNest: A Joint Action Simulator for Embodied Agents with Theory of Mind
토론
이 논문과 연결된 포럼 글이 아직 없습니다.