English
Related papers

Related papers: Stochastic Shortest Path with Energy Constraints i…

200 papers

Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in which states of the system are observable only indirectly, via a…

Artificial Intelligence · Computer Science 2011-06-02 M. Hauskrecht

There is much interest in using partially observable Markov decision processes (POMDPs) as a formal model for planning in stochastic domains. This paper is concerned with finding optimal policies for POMDPs. We propose several improvements…

Artificial Intelligence · Computer Science 2013-02-01 Nevin Lianwen Zhang , Stephen S. Lee

Solving partially observable Markov decision processes (POMDPs) is highly intractable in general, at least in part because the optimal policy may be infinitely large. In this paper, we explore the problem of finding the optimal policy from…

Artificial Intelligence · Computer Science 2013-01-30 Nicolas Meuleau , Kee-Eung Kim , Leslie Pack Kaelbling , Anthony R. Cassandra

This paper introduces algorithms for problems where a decision maker has to control a system composed of several components and has access to only partial information on the state of each component. Such problems are difficult because of…

Optimization and Control · Mathematics 2020-12-25 Victor Cohen , Axel Parmentier

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

It is well known that for any finite state Markov decision process (MDP) there is a memoryless deterministic policy that maximizes the expected reward. For partially observable Markov decision processes (POMDPs), optimal memoryless policies…

Optimization and Control · Mathematics 2016-02-16 Guido Montufar , Keyan Ghazi-Zahedi , Nihat Ay

Partially Observable Markov Decision Processes (POMDPs) provide an efficient way to model real-world sequential decision making processes. Motivated by the problem of maintenance and inspection of a group of infrastructure components with…

Optimization and Control · Mathematics 2024-08-15 Manav Vora , Pranay Thangeda , Michael N. Grussing , Melkior Ornik

We consider partially observable Markov decision processes (POMDPs) modeling an agent that needs a supply of a certain resource (e.g., electricity stored in batteries) to operate correctly. The resource is consumed by agent's actions and…

Artificial Intelligence · Computer Science 2022-11-29 Michal Ajdarów , Šimon Brlej , Petr Novotný

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

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

Partially Observable Markov Decision Processes (POMDPs) are systems in which one agent interacts with a stochastic environment, and receives only partial information about the current state. In a multi-environment POMDP (MEPOMDP), the…

Artificial Intelligence · Computer Science 2026-05-11 Léonard Brice , Filip Cano , Krishnendu Chatterjee , Thomas A. Henzinger , Stefanie Muroya

Online planning under uncertainty in partially observable domains is an essential capability in robotics and AI. The partially observable Markov decision process (POMDP) is a mathematically principled framework for addressing…

Robotics · Computer Science 2024-10-14 Da Kong , Vadim Indelman

The synthesis problem for partially observable Markov decision processes (POMDPs) is to compute a policy that satisfies a given specification. Such policies have to take the full execution history of a POMDP into account, rendering the…

Artificial Intelligence · Computer Science 2020-07-20 Leonore Winterer , Ralf Wimmer , Nils Jansen , Bernd Becker

This paper addresses the problem of optimal control of robotic sensing systems aimed at autonomous information gathering in scenarios such as environmental monitoring, search and rescue, and surveillance and reconnaissance. The information…

Systems and Control · Computer Science 2016-01-28 Mikko Lauri , Nikolay Atanasov , George J. Pappas , Risto Ritala

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

We present an alternative view for the study of optimal control of partially observed Markov Decision Processes (POMDPs). We first revisit the traditional (and by now standard) separated-design method of reducing the problem to fully…

Optimization and Control · Mathematics 2024-12-20 Serdar Yüksel

Markov Decision Processes (MDPs) are stochastic optimization problems that model situations where a decision maker controls a system based on its state. Partially observed Markov decision processes (POMDPs) are generalizations of MDPs where…

Optimization and Control · Mathematics 2019-03-26 Victor Cohen , Axel Parmentier

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 a natural model for planning problems where effects of actions are nondeterministic and the state of the world is not completely observable. It is difficult to solve POMDPs…

Artificial Intelligence · Computer Science 2009-09-25 N. L. Zhang , W. Liu

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
‹ Prev 1 2 3 10 Next ›