atlas

Research map / Reinforcement learning / MDPs and planning

Point-Based Methods for Model Checking in Partially Observable Markov Decision Processes

AAAI 2020 · Reinforcement learning › MDPs and planning · approach: POMDP policy optimization · 25 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
Use SARSOP point-based planning instead of Lovejoy belief-space discretizationQuantitative POMDP model checking · 3×3 PO Grid Worldtime to reach a given precisionHelped
Use quantitative satisfaction-probability optimization rather than requiring probability-1 satisfactionPOMDP policy synthesis for LTL objectives · Rock Sampleability to return a policyHelped
Maintain belief over both environment and automaton state instead of assuming end components are observedPOMDP LTL model checking · POMDPs with unobservable labelspolicy synthesis under partial observabilityHelped
Use SARSOP on the product POMDP and translate its value bounds into satisfaction-probability boundsPOMDP model checker · LTL satisfactionbound on success probabilityHelped
Scale the drone surveillance domain from [5,5] to [7,7]POMDP model checker (SARSOP) · Drone Surveillance (U)solving time: 78.3 -> 12587.5Hurt

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