English
Related papers

Related papers: Simplification of Risk Averse POMDPs with Performa…

200 papers

In this paper, we consider a finite-horizon Markov decision process (MDP) for which the objective at each stage is to minimize a quantile-based risk measure (QBRM) of the sequence of future costs; we call the overall objective a dynamic…

Optimization and Control · Mathematics 2017-05-10 Daniel R. Jiang , Warren B. Powell

In the real world, planning is often challenged by distribution shifts. As such, a model of the environment obtained under one set of conditions may no longer remain valid as the distribution of states or the environment dynamics change,…

Artificial Intelligence · Computer Science 2026-03-02 Matteo Ceriscioli , Karthika Mohan

This paper studies optimization of Conditional Value-at-Risk (CVaR) for Markov Decision Processes (MDPs) with finite state and action sets. It introduces the Dynamically augmented CVaR (DCVaR) risk measure and provides an algorithm for its…

Optimization and Control · Mathematics 2026-03-12 Eugene A. Feinberg , Rui Ding

Partially Observable Markov Decision Processes (POMDPs) are a natural and general model in reinforcement learning that take into account the agent's uncertainty about its current state. In the literature on POMDPs, it is customary to assume…

Machine Learning · Computer Science 2022-03-24 Noah Golowich , Ankur Moitra , Dhruv Rohatgi

Solving partially observable Markov decision processes (POMDPs) typically requires reasoning about the values of exponentially many state beliefs. Towards practical performance, state-of-the-art solvers use value bounds to guide this…

Artificial Intelligence · Computer Science 2025-02-11 Merlijn Krale , Wietze Koops , Sebastian Junges , Thiago D. Simão , Nils Jansen

Partially Observable Markov Decision Processes (POMDPs) remain a core challenge in reinforcement learning due to incomplete state information. We address this by reformulating POMDPs as fully observable processes with fixed-length…

Machine Learning · Computer Science 2025-09-16 Wuhao Wang , Zhiyong Chen

Partially observable Markov decision processes (POMDPs) form a prominent model for uncertainty in sequential decision making. We are interested in constructing algorithms with theoretical guarantees to determine whether the agent has a…

Artificial Intelligence · Computer Science 2024-12-17 Marius Belly , Nathanaël Fijalkow , Hugo Gimbert , Florian Horn , Guillermo A. Pérez , Pierre Vandenhove

In reinforcement learning, the reward function on current state and action is widely used. When the objective is about the expectation of the (discounted) total reward only, it works perfectly. However, if the objective involves the total…

Artificial Intelligence · Computer Science 2018-12-03 Shuai Ma , Jia Yuan Yu

We study the problem of policy synthesis for uncertain partially observable Markov decision processes (uPOMDPs). The transition probability function of uPOMDPs is only known to belong to a so-called uncertainty set, for instance in the form…

Optimization and Control · Mathematics 2020-01-24 Marnix Suilen , Nils Jansen , Murat Cubuktepe , Ufuk Topcu

We introduce a class of partially observed Markov decision processes (POMDPs) with costs that can depend on both the value and (future) uncertainty associated with the initial state. These Initial-State Cost POMDPs (ISC-POMDPs) enable the…

Systems and Control · Electrical Eng. & Systems 2025-03-10 Timothy L. Molloy

We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize…

Artificial Intelligence · Computer Science 2016-05-12 Tomáš Brázdil , Krishnendu Chatterjee , Martin Chmelík , Anchit Gupta , Petr Novotný

The partially observable Markov decision process (POMDP) framework is a common approach for decision making under uncertainty. Recently, multiple studies have shown that by integrating relevant domain knowledge into POMDP belief estimation,…

Artificial Intelligence · Computer Science 2023-02-20 Tung Nguyen , Johane Takeuchi

We consider a class of sequential decision-making problems under uncertainty that can encompass various types of supervised learning concepts. These problems have a completely observed state process and a partially observed modulation…

Optimization and Control · Mathematics 2021-08-24 R. Reid Bishop , Chelsea C. White

Online planning for partially observable Markov decision processes (POMDPs) provides efficient techniques for robot decision-making under uncertainty. However, existing methods fall short of preventing safety violations in dynamic…

Robotics · Computer Science 2024-09-10 Shili Sheng , Pian Yu , David Parker , Marta Kwiatkowska , Lu Feng

Partially observable Markov decision processes (POMDPs) are standard models for dynamic systems with probabilistic and nondeterministic behaviour in uncertain environments. We prove that in POMDPs with long-run average objective, the…

Computer Science and Game Theory · Computer Science 2022-09-29 Krishnendu Chatterjee , Raimundo Saona , Bruno Ziliotto

This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state space. Agents maintain beliefs over physical states of the…

Artificial Intelligence · Computer Science 2011-09-13 P. Doshi , P. J. Gmytrasiewicz

We investigate partially observed Markov decision processes (POMDPs) with cost functions regularized by entropy terms describing state, observation, and control uncertainty. Standard POMDP techniques are shown to offer bounded-error…

Systems and Control · Electrical Eng. & Systems 2023-05-10 Timothy L. Molloy , Girish N. Nair

Partially observable Markov decision processes (POMDPs) are a central model for uncertainty in sequential decision making. The most basic objective is the reachability objective, where a target set must be eventually visited, and the more…

Computational Complexity · Computer Science 2025-12-09 Ali Asadi , Krishnendu Chatterjee , David Lurie , Raimundo Saona

CVaR (Conditional Value at Risk) is a risk metric widely used in finance. However, dynamically optimizing CVaR is difficult since it is not a standard Markov decision process (MDP) and the principle of dynamic programming fails. In this…

Optimization and Control · Mathematics 2022-10-18 Li Xia , Peter W. Glynn

Robust Markov Decision Processes (RMDPs) have received significant research interest, offering an alternative to standard Markov Decision Processes (MDPs) that often assume fixed transition probabilities. RMDPs address this by optimizing…

Machine Learning · Computer Science 2024-05-06 Xinyi Ni , Lifeng Lai
‹ Prev 1 3 4 5 6 7 10 Next ›