atlas

Research map / Reinforcement learning / MDPs and planning

A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs

AAAI 2016 · Reinforcement learning › MDPs and planning · approach: POMDP policy optimization · 29 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
symbolic SAT encoding instead of explicit belief-support MDP constructionalmost-sure reachability in POMDPs · Hallway HW1runtime (s): 128.9 -> 0.6Helped
symbolic SAT encoding instead of explicit algorithmalmost-sure reachability · Escape9runtime (s): 688.6 -> 60.2Helped
symbolic SAT encoding instead of explicit algorithmalmost-sure reachability · RockSample RS[9]runtime (s): 197.3 -> 79.1Helped
symbolic SAT encoding instead of explicit algorithmalmost-sure reachability · Escape3runtime (s): 0.4 -> 0.2Mixed
increase memory states from 1 to 2 in Hallway (memoryless to small memory) (ablation)SAT encoding · Hallway HW1existence of winning strategyHelped
increase memory states from 1 to 2 (larger SAT instance) (ablation)SAT encoding · Hallway HW8runtime (s): 55.4 -> 1157.1Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy