Search Results for author: Martin Chmelik

Found 3 papers, 0 papers with code

Sensor Synthesis for POMDPs with Reachability Objectives

no code implementations29 Sep 2017 Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu

Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors.

A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs

no code implementations26 Nov 2015 Krishnendu Chatterjee, Martin Chmelik, Jessica Davies

POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment.

POMDPs under Probabilistic Semantics

no code implementations9 Aug 2014 Krishnendu Chatterjee, Martin Chmelik

We consider two types of path constraints: (i) quantitative constraint defines the set of paths where the payoff is at least a given threshold lambda_1 in (0, 1]; and (ii) qualitative constraint which is a special case of quantitative constraint with lambda_1=1.

Cannot find the paper you are looking for? You can Submit a new open access paper.