English
Related papers

Related papers: Risk-Sensitive Partially Observable Markov Decisio…

200 papers

We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process is observed by a single sensor which needs to be dynamically…

Information Theory · Computer Science 2016-11-15 Mohammad Rezaeian

Autonomous systems are often required to operate in partially observable environments. They must reliably execute a specified objective even with incomplete information about the state of the environment. We propose a methodology to…

Artificial Intelligence · Computer Science 2020-01-14 Maxime Bouton , Jana Tumova , Mykel J. Kochenderfer

We aim to analyze the behaviour of a finite-time stochastic system, whose model is not available, in the context of more rare and harmful outcomes. Standard estimators are not effective in making predictions about such outcomes due to their…

Methodology · Statistics 2022-07-29 Evan Arsenault , Yuheng Wang , Margaret P. Chapman

We consider Markov decision processes where the state of the chain is only given at chosen observation times and of a cost. Optimal strategies involve the optimisation of observation times as well as the subsequent action values. We…

Optimization and Control · Mathematics 2025-03-27 Christoph Reisinger , Jonathan Tam

The integration of physiological computing into mixed-initiative human-robot interaction systems offers valuable advantages in autonomous task allocation by incorporating real-time features as human state observations into the…

Faced with an ever-increasing complexity of their domains of application, artificial learning agents are now able to scale up in their ability to process an overwhelming amount of information coming from their interaction with an…

Artificial Intelligence · Computer Science 2022-04-05 Mirza Ramicic , Andrea Bonarini

This paper is concerned with risk-sensitive performance analysis for linear quantum stochastic systems interacting with external bosonic fields. We consider a cost functional in the form of the exponential moment of the integral of a…

Optimization and Control · Mathematics 2017-07-31 Igor G. Vladimirov , Ian R. Petersen , Matthew R. James

We present a technique for speeding up the convergence of value iteration for partially observable Markov decisions processes (POMDPs). The underlying idea is similar to that behind modified policy iteration for fully observable Markov…

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

We consider a risk-sensitive optimization of consumption-utility on infinite time horizon where the one-period investment gain depends on an underlying economic state whose evolution over time is assumed to be described by a discrete-time,…

Optimization and Control · Mathematics 2021-11-19 Anindya Goswami , Nimit Rana , Tak Kuen Siu

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 develop a method for computing policies in Markov decision processes with risk-sensitive measures subject to temporal logic constraints. Specifically, we use a particular risk-sensitive measure from cumulative prospect theory, which has…

Artificial Intelligence · Computer Science 2020-04-21 Murat Cubuktepe , Ufuk Topcu

Markov automata combine non-determinism, probabilistic branching, and exponentially distributed delays. This compositional variant of continuous-time Markov decision processes is used in reliability engineering, performance evaluation and…

Logic in Computer Science · Computer Science 2017-05-11 Tim Quatmann , Sebastian Junges , Joost-Pieter Katoen

Revision of the paper previously entitled "Learning a Machine for the Decision in a Partially Observable Markov Universe" In this paper, we are interested in optimal decisions in a partially observable universe. Our approach is to directly…

Optimization and Control · Mathematics 2007-06-13 Frederic Dambreville

Motivated by wide-ranging applications such as video delivery over networks using Multiple Description Codes, congestion control, and inventory management, we study the state-tracking of a Markovian random process with a known transition…

Information Theory · Computer Science 2017-03-06 Parisa Mansourifard , Tara Javidi , Bhaskar Krishnamachari

Euclidean Markov decision processes are a powerful tool for modeling control problems under uncertainty over continuous domains. Finite state imprecise, Markov decision processes can be used to approximate the behavior of these infinite…

Artificial Intelligence · Computer Science 2020-06-29 Manfred Jaeger , Giorgio Bacci , Giovanni Bacci , Kim Guldstrand Larsen , Peter Gjøl Jensen

Most exact algorithms for general partially observable Markov decision processes (POMDPs) use a form of dynamic programming in which a piecewise-linear and convex representation of one value function is transformed into another. We examine…

Artificial Intelligence · Computer Science 2013-02-08 Anthony R. Cassandra , Michael L. Littman , Nevin Lianwen Zhang

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

In many practical settings control decisions must be made under partial/imperfect information about the evolution of a relevant state variable. Partially Observable Markov Decision Processes (POMDPs) is a relatively well-developed framework…

Machine Learning · Computer Science 2021-12-30 Yanling Chang , Alfredo Garcia , Zhide Wang , Lu Sun

We provide a novel method for sensitivity analysis of parametric robust Markov chains. These models incorporate parameters and sets of probability distributions to alleviate the often unrealistic assumption that precise probabilities are…

Machine Learning · Computer Science 2023-05-03 Thom Badings , Sebastian Junges , Ahmadreza Marandi , Ufuk Topcu , Nils Jansen

We show that for several variations of partially observable Markov decision processes, polynomial-time algorithms for finding control policies are unlikely to or simply don't have guarantees of finding policies within a constant factor or a…

Artificial Intelligence · Computer Science 2011-06-02 J. Goldsmith , C. Lusena , M. Mundhenk