English
Related papers

Related papers: Deep Belief Markov Models for POMDP Inference

200 papers

Theory-of-Mind (ToM) tasks pose a unique challenge for large language models (LLMs), which often lack the capability for dynamic logical reasoning. In this work, we propose DEL-ToM, a framework that improves verifiable ToM reasoning through…

Artificial Intelligence · Computer Science 2025-09-30 Yuheng Wu , Jianwen Xie , Denghui Zhang , Zhaozhuo Xu

Partially-Observable Markov Decision Processes (POMDPs) are typically solved by finding an approximate global solution to a corresponding belief-MDP. In this paper, we offer a new planning algorithm for POMDPs with continuous state, action…

Artificial Intelligence · Computer Science 2012-03-19 Tom Erez , William D. Smart

Partially observable Markov decision processes (POMDPs) is a rich mathematical framework that embraces a large class of complex sequential decision-making problems under uncertainty with limited observations. However, the complexity of…

Systems and Control · Electrical Eng. & Systems 2022-11-29 Mingyu Park , Jaeuk Shin , Insoon Yang

We consider a finite-state partially observable Markov decision problem (POMDP) with an infinite horizon and a discounted cost, and we propose a new method for computing a cost function approximation that is based on features and…

Systems and Control · Electrical Eng. & Systems 2025-07-08 Yuchao Li , Kim Hammar , Dimitri Bertsekas

Multi-environment POMDPs (ME-POMDPs) extend standard POMDPs with discrete model uncertainty. ME-POMDPs represent a finite set of POMDPs that share the same state, action, and observation spaces, but may arbitrarily vary in their transition,…

Artificial Intelligence · Computer Science 2025-10-29 Eline M. Bovy , Caleb Probine , Marnix Suilen , Ufuk Topcu , Nils Jansen

Planning under partial obervability is essential for autonomous robots. A principled way to address such planning problems is the Partially Observable Markov Decision Process (POMDP). Although solving POMDPs is computationally intractable,…

Artificial Intelligence · Computer Science 2020-11-05 Marcus Hoerger , Hanna Kurniawati

In recent years several learning approaches to point goal navigation in previously unseen environments have been proposed. They vary in the representations of the environments, problem decomposition, and experimental evaluation. In this…

Robotics · Computer Science 2022-12-20 Yimeng Li , Arnab Debnath , Gregory J. Stein , Jana Kosecka

We propose a new reinforcement learning algorithm for partially observable Markov decision processes (POMDP) based on spectral decomposition methods. While spectral methods have been previously employed for consistent learning of (passive)…

Artificial Intelligence · Computer Science 2017-06-20 Kamyar Azizzadenesheli , Alessandro Lazaric , Animashree Anandkumar

Uncertain partially observable Markov decision processes (uPOMDPs) allow the probabilistic transition and observation functions of standard POMDPs to belong to a so-called uncertainty set. Such uncertainty, referred to as epistemic…

Artificial Intelligence · Computer Science 2021-11-02 Murat Cubuktepe , Nils Jansen , Sebastian Junges , Ahmadreza Marandi , Marnix Suilen , Ufuk Topcu

Autonomous agents that operate in the real world must often deal with partial observability, which is commonly modeled as partially observable Markov decision processes (POMDPs). However, traditional POMDP models rely on the assumption of…

Artificial Intelligence · Computer Science 2023-08-03 Moran Barenboim , Idan Lev-Yehudi , Vadim Indelman

We propose a new reinforcement learning algorithm for partially observable Markov decision processes (POMDP) based on spectral decomposition methods. While spectral methods have been previously employed for consistent learning of (passive)…

Artificial Intelligence · Computer Science 2017-06-20 Kamyar Azizzadenesheli , Alessandro Lazaric , Animashree Anandkumar

Markov Decision Processes (Mdps) form a versatile framework used to model a wide range of optimization problems. The Mdp model consists of sets of states, actions, time steps, rewards, and probability transitions. When in a given state and…

Partially Observable Markov Decision Process (POMDP) is widely used to model probabilistic behavior for complex systems. Compared with MDPs, POMDP models a system more accurate but solving a POMDP generally takes exponential time in the…

Logic in Computer Science · Computer Science 2017-03-13 Xiaobin Zhang , Bo Wu , Hai Lin

In many practical applications, decision-making processes must balance the costs of acquiring information with the benefits it provides. Traditional control systems often assume full observability, an unrealistic assumption when…

Artificial Intelligence · Computer Science 2025-01-24 Taiyi Wang , Jianheng Liu , Bryan Lee , Zhihao Wu , Yu Wu

In this paper, we propose a policy gradient method for confounded partially observable Markov decision processes (POMDPs) with continuous state and observation spaces in the offline setting. We first establish a novel identification result…

Machine Learning · Statistics 2023-12-04 Mao Hong , Zhengling Qi , Yanxun Xu

Machine learning for scientific applications faces the challenge of limited data. We propose a framework that leverages a priori known physics to reduce overfitting when training on relatively small datasets. A deep neural network is…

Machine Learning · Computer Science 2019-11-22 Jonathan B. Freund , Jonathan F. MacArt , Justin Sirignano

We introduce a Transformer-based Reinforcement Learning framework for autonomous orbital collision avoidance that explicitly models the effects of partial observability and imperfect monitoring in space operations. The framework combines a…

Machine Learning · Computer Science 2026-03-26 Thomas Georges , Adam Abdin

Solving partially observable Markov decision processes (POMDPs) with high dimensional and continuous observations, such as camera images, is required for many real life robotics and planning problems. Recent researches suggested machine…

Artificial Intelligence · Computer Science 2025-05-27 Idan Lev-Yehudi , Moran Barenboim , Vadim Indelman

We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past…

Logic in Computer Science · Computer Science 2015-05-14 Krishnendu Chatterjee , Laurent Doyen , Thomas A. Henzinger

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
‹ Prev 1 3 4 5 6 7 10 Next ›