Martin Chmelik

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 18

Top Topics

Partially Observable Markov Decision Process

Decision Theoretic Planning

Top Venues

Publications

Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Kwiatkowska, Tobias Meggendorfer, David Parker, Mateusz Ujma
Learning Algorithms for Verification of Markov Decision Processes. CoRR (2024)
Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu
Sensor Synthesis for POMDPs with Reachability Objectives. ICAPS (2018)
Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu
Sensor Synthesis for POMDPs with Reachability Objectives. CoRR (2017)
Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný
Stochastic Shortest Path with Energy Constraints in POMDPs. CoRR (2016)
Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia
Optimal cost almost-sure reachability in POMDPs. Artif. Intell. 234 (2016)
Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol
What is decidable about partially observable Markov decision processes with ω-regular objectives. J. Comput. Syst. Sci. 82 (5) (2016)
Krishnendu Chatterjee, Martin Chmelik, Jessica Davies
A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. AAAI (2016)
Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný
Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract). AAMAS (2016)
Krishnendu Chatterjee, Martin Chmelik
Indefinite-Horizon Reachability in Goal-DEC-POMDPs. ICAPS (2016)
María Svorenová, Martin Chmelik, Kevin Leahy, Hasan Ferit Eniser, Krishnendu Chatterjee, Ivana Cerná, Calin Belta
Temporal logic motion planning using POMDPs with parity objectives: case study paper. HSCC (2015)
Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia
Optimal Cost Almost-Sure Reachability in POMDPs. AAAI (2015)
Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, Jan Kretínský
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. CAV (1) (2015)
Krishnendu Chatterjee, Martin Chmelik, Jessica Davies
A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs. CoRR (2015)
María Svorenová, Jan Kretínský, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerná, Calin Belta
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. HSCC (2015)
Krishnendu Chatterjee, Martin Chmelik
POMDPs under probabilistic semantics. Artif. Intell. 221 (2015)
Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, Jan Kretínský
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. CoRR (2015)
Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca
CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods Syst. Des. 47 (2) (2015)
Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA (2015)
Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia
Optimal Cost Almost-sure Reachability in POMDPs. CoRR (2014)
Krishnendu Chatterjee, Martin Chmelik
POMDPs under Probabilistic Semantics. CoRR (2014)
Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca
CEGAR for Qualitative Analysis of Probabilistic Systems. CoRR (2014)
Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Z. Kwiatkowska, David Parker, Mateusz Ujma
Verification of Markov Decision Processes Using Learning Algorithms. ATVA (2014)
María Svorenová, Jan Kretínský, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerná, Calin Belta
Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games. CoRR (2014)
Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Z. Kwiatkowska, David Parker, Mateusz Ujma
Verification of Markov Decision Processes using Learning Algorithms. CoRR (2014)
Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia
Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. CoRR (2014)
Pavol Cerný, Martin Chmelik, Thomas A. Henzinger, Arjun Radhakrishna
Interface simulation distances. Theor. Comput. Sci. 560 (2014)
Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca
CEGAR for Qualitative Analysis of Probabilistic Systems. CAV (2014)
Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol
What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. CoRR (2013)
Krishnendu Chatterjee, Martin Chmelik
POMDPs under Probabilistic Semantics. UAI (2013)
Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol
What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. CSL (2013)
Krishnendu Chatterjee, Martin Chmelik
POMDPs under Probabilistic Semantics. CoRR (2013)
Martin Chmelik, Vojtech Rehák
Controllable-Choice Message Sequence Graphs. MEMICS (2012)
Krishnendu Chatterjee, Martin Chmelik, Rupak Majumdar
Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games. ATVA (2012)
Pavol Cerný, Martin Chmelik, Thomas A. Henzinger, Arjun Radhakrishna
Interface Simulation Distances GandALF (2012)
Martin Chmelik, Vojtech Rehák
Controllable-choice Message Sequence Graphs CoRR (2012)
Krishnendu Chatterjee, Martin Chmelik, Rupak Majumdar
Equivalence of Games with Probabilistic Uncertainty and Partial-observation Games CoRR (2012)