English
Related papers

Related papers: Safe Policy Synthesis in Multi-Agent POMDPs via Di…

200 papers

We develop a Markov decision process (MDP) framework to autonomously make guidance decisions for satellite collision avoidance maneuver (CAM) and a reinforcement learning policy gradient (RL-PG) algorithm to enable direct optimization of…

Machine Learning · Computer Science 2025-12-12 Francesca Ferrara , Lander W. Schillinger Arana , Florian Dörfler , Sarah H. Q. Li

Partially Observable Markov Decision Processes (POMDP) is a widely used model to represent the interaction of an environment and an agent, under state uncertainty. Since the agent does not observe the environment state, its uncertainty is…

Artificial Intelligence · Computer Science 2021-04-16 Divya Grover , Christos Dimitrakakis

Given a Markov decision process (MDP), we seek to learn representations for a range of policies to facilitate behavior steering at test time. As policies of an MDP are uniquely determined by their occupancy measures, we propose modeling…

Machine Learning · Computer Science 2026-02-02 Beiming Li , Sergio Rozada , Alejandro Ribeiro

This work examines the hypothesis that partially observable Markov decision process (POMDP) planning with human driver internal states can significantly improve both safety and efficiency in autonomous freeway driving. We evaluate this…

Artificial Intelligence · Computer Science 2022-06-13 Zachary Sunberg , Mykel Kochenderfer

Ensuring safety in multi-agent systems is a significant challenge, particularly in settings where centralized coordination is impractical. In this work, we propose a novel risk-sensitive safety filter for discrete-time multi-agent systems…

Systems and Control · Electrical Eng. & Systems 2025-12-19 Armin Lederer , Erfaun Noorani , Andreas Krause

We introduce Multi-Environment Markov Decision Processes (MEMDPs) which are MDPs with a set of probabilistic transition functions. The goal in a MEMDP is to synthesize a single controller with guaranteed performances against all…

Logic in Computer Science · Computer Science 2014-12-04 Jean-François Raskin , Ocan Sankur

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 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

Interval Markov decision processes (IMDPs) generalise classical MDPs by having interval-valued transition probabilities. They provide a powerful modelling tool for probabilistic systems with an additional variation or uncertainty that…

Systems and Control · Computer Science 2017-07-07 Ernst Moritz Hahn , Vahid Hashemi , Holger Hermanns , Morteza Lahijanian , Andrea Turrini

This paper addresses the online motion planning problem of mobile robots under complex high-level tasks. The robot motion is modeled as an uncertain Markov Decision Process (MDP) due to limited initial knowledge, while the task is specified…

Robotics · Computer Science 2023-02-13 Yuyang Zhang , Meng Guo

Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP is often intractable except for small problems due to their…

Artificial Intelligence · Computer Science 2014-01-16 Stéphane Ross , Joelle Pineau , Sébastien Paquet , Brahim Chaib-draa

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

In many real-world problems, there is the possibility to configure, to a limited extent, some environmental parameters to improve the performance of a learning agent. In this paper, we propose a novel framework, Configurable Markov Decision…

Artificial Intelligence · Computer Science 2018-06-15 Alberto Maria Metelli , Mirco Mutti , Marcello Restelli

This paper addresses a fundamental question of multi-agent knowledge distribution: what information should be sent to whom and when, with the limited resources available to each agent? Communication requirements for multi-agent systems can…

Multiagent Systems · Computer Science 2019-03-08 Michael C. Fowler , T. Charles Clancy , Ryan K. Williams

In this paper, we show how a simulated Markov decision process (MDP) built by the so-called \emph{baseline} policies, can be used to compute a different policy, namely the \emph{simulated optimal} policy, for which the performance of this…

Optimization and Control · Mathematics 2014-10-13 Yinlam Chow , Mohammad Ghavamzadeh

In many real-world decision problems there is partially observed, hidden or latent information that remains fixed throughout an interaction. Such decision problems can be modeled as Latent Markov Decision Processes (LMDPs), where a latent…

Machine Learning · Computer Science 2024-06-27 Jeongyeol Kwon , Shie Mannor , Constantine Caramanis , Yonathan Efroni

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

In safe MDP planning, a cost function based on the current state and action is often used to specify safety aspects. In the real world, often the state representation used may lack sufficient fidelity to specify such safety constraints.…

Machine Learning · Computer Science 2023-04-07 Siow Meng Low , Akshat Kumar , Scott Sanner

This paper marries two state-of-the-art controller synthesis methods for partially observable Markov decision processes (POMDPs), a prominent model in sequential decision making under uncertainty. A central issue is to find a POMDP…

Logic in Computer Science · Computer Science 2023-05-30 Roman Andriushchenko , Alexander Bork , Milan Češka , Sebastian Junges , Joost-Pieter Katoen , Filip Macák

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