English
Related papers

Related papers: What is Decidable about Partially Observable Marko…

200 papers

We consider finite model approximations of discrete-time partially observed Markov decision processes (POMDPs) under the discounted cost criterion. After converting the original partially observed stochastic control problem to a fully…

Systems and Control · Computer Science 2017-10-20 Naci Saldi , Serdar Yüksel , Tamás Linder

We consider multiple-environment Markov decision processes (MEMDP), which consist of a finite set of MDPs over the same state space, representing different scenarios of transition structure and probability. The value of a strategy is the…

Logic in Computer Science · Computer Science 2025-04-23 Krishnendu Chatterjee , Laurent Doyen , Jean-François Raskin , Ocan Sankur

Decision processes with incomplete state feedback have been traditionally modeled as Partially Observable Markov Decision Processes. In this paper, we present an alternative formulation based on probabilistic regular languages. The proposed…

Optimization and Control · Mathematics 2009-08-07 Ishanu Chattopadhyay , Asok Ray

We consider the problem of designing policies for partially observable Markov decision processes (POMDPs) with dynamic coherent risk objectives. Synthesizing risk-averse optimal policies for POMDPs requires infinite memory and thus…

Robotics · Computer Science 2019-09-30 Mohamadreza Ahmadi , Masahiro Ono , Michel D. Ingham , Richard M. Murray , Aaron D. Ames

In this article, we are interested in planning problems where the agent is aware of the presence of an observer, and where this observer is in a partial observability situation. The agent has to choose its strategy so as to optimize the…

Artificial Intelligence · Computer Science 2025-11-24 Salomé Lepers , Vincent Thomas , Olivier Buffet

This paper studies parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over a finite set of parameters. Fixing values for all parameters…

Logic in Computer Science · Computer Science 2019-04-03 Tobias Winkler , Sebastian Junges , Guillermo A. Pérez , Joost-Pieter Katoen

Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies…

Artificial Intelligence · Computer Science 2018-05-01 Krishnendu Chatterjee , Adrián Elgyütt , Petr Novotný , Owen Rouillé

This paper describes sufficient conditions for the existence of optimal policies for Partially Observable Markov Decision Processes (POMDPs) with Borel state, observation, and action sets and with the expected total costs. Action sets may…

Optimization and Control · Mathematics 2014-07-02 Eugene A. Feinberg , Pavlo O. Kasyanov , Michael Z. Zgurovsky

We study planning problems where autonomous agents operate inside environments that are subject to uncertainties and not fully observable. Partially observable Markov decision processes (POMDPs) are a natural formal model to capture such…

Artificial Intelligence · Computer Science 2018-02-28 Steven Carr , Nils Jansen , Ralf Wimmer , Jie Fu , Ufuk Topcu

Optimal decision-making presents a significant challenge for autonomous systems operating in uncertain, stochastic and time-varying environments. Environmental variability over time can significantly impact the system's optimal decision…

Robotics · Computer Science 2024-03-11 Gokul Puthumanaillam , Xiangyu Liu , Negar Mehr , Melkior Ornik

In the theory of Partially Observed Markov Decision Processes (POMDPs), existence of optimal policies have in general been established via converting the original partially observed stochastic control problem to a fully observed one on the…

Optimization and Control · Mathematics 2022-01-11 Ali Devran Kara , Serdar Yuksel

A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may still permit unlikely but highly undesirable outcomes, which…

Artificial Intelligence · Computer Science 2017-01-31 Krishnendu Chatterjee , Petr Novotný , Guillermo A. Pérez , Jean-François Raskin , Đorđe Žikelić

Partially Observable Markov Decision Processes (POMDPs) are powerful models for sequential decision making under transition and observation uncertainties. This paper studies the challenging yet important problem in POMDPs known as the…

Artificial Intelligence · Computer Science 2024-06-06 Qi Heng Ho , Martin S. Feather , Federico Rossi , Zachary N. Sunberg , Morteza Lahijanian

This article presents the complexity of reachability decision problems for parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over a…

Logic in Computer Science · Computer Science 2020-09-29 Sebastian Junges , Joost-Pieter Katoen , Guillermo A. Pérez , Tobias Winkler

This paper is concerned with planning in stochastic domains by means of partially observable Markov decision processes (POMDPs). POMDPs are difficult to solve. This paper identifies a subclass of POMDPs called region observable POMDPs,…

Artificial Intelligence · Computer Science 2013-02-08 Nevin Lianwen Zhang , Wenju Liu

Partially Observable Markov Decision Process (POMDP) is a framework applicable to many real world problems. In this work, we propose an approach to solve POMDPs with multimodal belief by relying on a policy that solves the fully observable…

Machine Learning · Computer Science 2022-07-26 András Attila Sulyok , Kristóf Karacs

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. We study a setting in which the sensors are only…

Artificial Intelligence · Computer Science 2017-10-03 Krishnendu Chatterjee , Martin Chmelik , Ufuk Topcu

We consider lexicographic bi-objective problems on Markov Decision Processes (MDPs), where we optimize one objective while guaranteeing optimality of another. We propose a two-stage technique for solving such problems when the objectives…

Computer Science and Game Theory · Computer Science 2023-08-17 Damien Busatto-Gaston , Debraj Chakraborty , Anirban Majumdar , Sayan Mukherjee , Guillermo A. Pérez , Jean-François Raskin

Memoryless and finite-memory policies offer a practical alternative for solving partially observable Markov decision processes (POMDPs), as they operate directly in the output space rather than in the high-dimensional belief space. However,…

Machine Learning · Computer Science 2025-12-15 Roy van Zuijlen , Duarte Antunes

Possibilistic and qualitative POMDPs (pi-POMDPs) are counterparts of POMDPs used to model situations where the agent's initial belief or observation probabilities are imprecise due to lack of past experiences or insufficient data…

Artificial Intelligence · Computer Science 2013-09-27 Nicolas Drougard , Florent Teichteil-Konigsbuch , Jean-Loup Farges , Didier Dubois