HackerPapers

arXiv:1801.03354cs.AI

Planning with Pixels in (Almost) Real Time

Wilmer Bandres, Blai Bonet, Hector Geffner

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Recently, width-based planning methods have been shown to yield state-of-the-art results in the Atari 2600 video games. For this, the states were associated with the (RAM) memory states of the simulator. In this work, we consider the same planning problem but using the screen instead. By using the same visual inputs, the planning results can be compared with those of humans and learning methods. We show that the planning approach, out of the box and without training, results in scores that compare well with those obtained by humans and learning methods, and moreover, by developing an episodic, rollout version of the IW(k) algorithm, we show that such scores can be obtained in almost real time.

arXiv comments
Published at AAAI-18
Journal reference
DOI
Subjects
cs.AIArtificial Intelligence

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Apr 2025 to Apr 2025.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Obituary for Cyc 1 comment
    • >> This is exactly correct, LLMs did scale with huge data, symbolic AI did not. So why? Like the rock salad you're mixing up two disparate contexts here. Symbolic AI like SAT solvers and planners is not trying to learn from data and there's no context in which it has to "scale…

      YeGoblynQueenneView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.