English
Related papers

Related papers: Verification of Uncertain POMDPs Using Barrier Cer…

200 papers

We consider partially observable Markov decision processes (POMDPs) with limit-average payoff, where a reward value in the interval [0,1] is associated to every transition, and the payoff of an infinite path is the long-run average of the…

Artificial Intelligence · Computer Science 2014-08-12 Krishnendu Chatterjee , Martin Chmelik

We introduce a framework for approximate analysis of Markov decision processes (MDP) with bounded-, unbounded-, and infinite-horizon properties. The main idea is to identify a "core" of an MDP, i.e., a subsystem where we provably remain…

Systems and Control · Electrical Eng. & Systems 2023-06-22 Jan Křetínský , Tobias Meggendorfer

Many systems contain latent variables that make their dynamics partially unidentifiable or cause distribution shifts in the observed statistics between offline and online data. However, existing control techniques often assume access to…

Systems and Control · Electrical Eng. & Systems 2025-06-24 Haoming Jing , Yorie Nakahira

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

The world is entering an unprecedented period of critical mineral demand, driven by the global transition to renewable energy technologies and electric vehicles. This transition presents unique challenges in mineral resource development,…

Artificial Intelligence · Computer Science 2025-02-11 Mansur Arief , Yasmine Alonso , CJ Oshiro , William Xu , Anthony Corso , David Zhen Yin , Jef K. Caers , Mykel J. Kochenderfer

Certifying verification algorithms not only return whether a given property holds or not, but also provide an accompanying independently checkable certificate and a corresponding witness. The certificate can be used to easily validate the…

Logic in Computer Science · Computer Science 2025-01-13 Christel Baier , Calvin Chau , Sascha Klüppelholz

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

Partially Observable Markov Decision Processes (POMDPs) are rich environments often used in machine learning. But the issue of information and causal structures in POMDPs has been relatively little studied. This paper presents the concepts…

Artificial Intelligence · Computer Science 2018-01-16 Stuart Armstrong

Safety of stochastic dynamic systems in environments with dynamic obstacles is studied in this paper through the lens of stochastic barrier functions. We introduce both time-invariant and time-varying barrier certificates for discrete-time,…

Robotics · Computer Science 2026-04-23 Rayan Mazouz , Luca Laurenti , Morteza Lahijanian

Partially observable Markov decision processes (POMDPs) offer a principled formalism for planning under state and transition uncertainty. Despite advances made towards solving large POMDPs, obtaining performant policies under limited…

Artificial Intelligence · Computer Science 2026-04-03 Zakariya Laouar , Qi Heng Ho , Zachary Sunberg

Partial observability and uncertainty are common problems in sequential decision-making that particularly impede the use of formal models such as Markov decision processes (MDPs). However, in practice, agents may be able to employ costly…

Machine Learning · Computer Science 2023-12-19 Merlijn Krale , Thiago D. Simão , Jana Tumova , Nils Jansen

Purposeful behavior in robotic assistants requires the integration of multiple components and technological advances. Often, the problem is reduced to recognizing explicit prompts, which limits autonomy, or is oversimplified through…

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

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

Partially observable Markov decision processes (POMDPs) model specific environments in sequential decision-making under uncertainty. Critically, optimal policies for POMDPs may not be robust against perturbations in the environment.…

Artificial Intelligence · Computer Science 2025-08-21 Maris F. L. Galesloot , Roman Andriushchenko , Milan Češka , Sebastian Junges , Nils Jansen

The full deployment of autonomous driving systems on a worldwide scale requires that the self-driving vehicle be operated in a provably safe manner, i.e., the vehicle must be able to avoid collisions in any possible traffic situation. In…

Robotics · Computer Science 2023-05-08 Ivo Batkovic , Ankit Gupta , Mario Zanon , Paolo Falcone

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

Safe reinforcement learning has been a promising approach for optimizing the policy of an agent that operates in safety-critical applications. In this paper, we propose an algorithm, SNO-MDP, that explores and optimizes Markov decision…

Machine Learning · Computer Science 2020-08-18 Akifumi Wachi , Yanan Sui

A barrier certificate often serves as an inductive invariant that isolates an unsafe region from the reachable set of states, and hence is widely used in proving safety of hybrid systems possibly over the infinite time horizon. We present a…

Logic in Computer Science · Computer Science 2021-06-01 Qiuye Wang , Mingshuai Chen , Bai Xue , Naijun Zhan , Joost-Pieter Katoen

We present quantum observable Markov decision processes (QOMDPs), the quantum analogues of partially observable Markov decision processes (POMDPs). In a QOMDP, an agent's state is represented as a quantum state and the agent can choose a…

Artificial Intelligence · Computer Science 2015-06-19 Jennifer Barry , Daniel T. Barry , Scott Aaronson
‹ Prev 1 8 9 10 Next ›