English
Related papers

Related papers: DESPOT: Online POMDP Planning with Regularization

200 papers

Many medical decision-making tasks can be framed as partially observed Markov decision processes (POMDPs). However, prevailing two-stage approaches that first learn a POMDP and then solve it often fail because the model that best fits the…

Machine Learning · Statistics 2020-04-01 Joseph Futoma , Michael C. Hughes , Finale Doshi-Velez

Partially observable Markov decision processes (POMDPs) have recently become popular among many AI researchers because they serve as a natural model for planning under uncertainty. Value iteration is a well-known algorithm for finding…

Artificial Intelligence · Computer Science 2011-06-02 N. L. Zhang , W. Zhang

We study the offline data-driven sequential decision making problem in the framework of Markov decision process (MDP). In order to enhance the generalizability and adaptivity of the learned policy, we propose to evaluate each policy by a…

Statistics Theory · Mathematics 2021-11-11 Zhengling Qi , Peng Liao

Decentralized Partially Observable Markov Decision Processes (Dec-POMDPs) are known to be NEXP-Complete and intractable to solve. However, for problems such as cooperative navigation, obstacle avoidance, and formation control, basic…

Multiagent Systems · Computer Science 2025-06-05 Alex DeWeese , Guannan Qu

Partially Observable Markov Decision Processes (POMDPs) are a fundamental framework for decision-making under uncertainty and partial observability. Since in general optimal policies may require infinite memory, they are hard to implement…

Artificial Intelligence · Computer Science 2026-04-30 Muqsit Azeem , Debraj Chakraborty , Sudeep Kanav , Jan Kretinsky

Monotonic Partially Observable Markov Decision Processes (POMDPs), where the system state progressively decreases until a restorative action is performed, can be used to model sequential repair problems effectively. This paper considers the…

Machine Learning · Computer Science 2025-09-17 Manav Vora , Jonas Liang , Michael N. Grussing , Melkior Ornik

Decision Trees are prominent prediction models for interpretable Machine Learning. They have been thoroughly researched, mostly in the batch setting with a fixed labelled dataset, leading to popular algorithms such as C4.5, ID3 and CART.…

Machine Learning · Computer Science 2024-06-24 Ayman Chaouki , Jesse Read , Albert Bifet

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

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

We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective we study asks to minimize the expected total cost till the…

Artificial Intelligence · Computer Science 2014-11-17 Krishnendu Chatterjee , Martin Chmelík , Raghav Gupta , Ayush Kanodia

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

We present POMDPPlanners, an open-source Python package for empirical evaluation of Partially Observable Markov Decision Process (POMDP) planning algorithms. The package integrates state-of-the-art planning algorithms, a suite of benchmark…

Artificial Intelligence · Computer Science 2026-02-25 Yaacov Pariente , Vadim Indelman

Real-world planning problems, including autonomous driving and sustainable energy applications like carbon storage and resource exploration, have recently been modeled as partially observable Markov decision processes (POMDPs) and solved…

Artificial Intelligence · Computer Science 2024-08-01 Robert J. Moss , Anthony Corso , Jef Caers , Mykel J. Kochenderfer

We study model-based learning of finite-window policies in tabular partially observable Markov decision processes (POMDPs). A common approach to learning under partial observability is to approximate unbounded history dependencies using…

Machine Learning · Computer Science 2026-04-02 Philip Jordan , Maryam Kamgarpour

In decentralized stochastic control, standard approaches for sequential decision-making, e.g. dynamic programming, quickly become intractable due to the need to maintain a complex information state. Computational challenges are further…

Machine Learning · Computer Science 2019-08-08 Kaiqing Zhang , Erik Miehling , Tamer Başar

Partially observable Markov decision processes (POMDPs) form an attractive and principled framework for agent planning under uncertainty. Point-based approximate techniques for POMDPs compute a policy based on a finite set of points…

Artificial Intelligence · Computer Science 2011-09-13 M. T. J. Spaan , N. Vlassis

In this article we propose a qualitative (ordinal) counterpart for the Partially Observable Markov Decision Processes model (POMDP) in which the uncertainty, as well as the preferences of the agent, are modeled by possibility distributions.…

Artificial Intelligence · Computer Science 2013-01-30 Regis Sabbadin

Uncontrolled intersections account for a significant fraction of roadway crashes due to ambiguous right-of-way rules, occlusions, and unpredictable driver behavior. While autonomous vehicle research has explored uncertainty-aware decision…

Robotics · Computer Science 2025-09-24 Navya Tiwari , Joseph Vazhaeparampil , Victoria Preston

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

Markov Decision Processes (MDPs) have been used to formulate many decision-making problems in science and engineering. The objective is to synthesize the best decision (action selection) policies to maximize expected rewards (or minimize…

Optimization and Control · Mathematics 2015-07-07 Mahmoud El Chamie , Behcet Acikmese
‹ Prev 1 4 5 6 7 8 10 Next ›