English
Related papers

Related papers: Provable Representation with Efficient Planning fo…

200 papers

Decision-making under uncertainty is a crucial ability for autonomous systems. In its most general form, this problem can be formulated as a Partially Observable Markov Decision Process (POMDP). The solution policy of a POMDP can be…

Robotics · Computer Science 2019-04-09 Sung-Kyun Kim , Rohan Thakker , Ali-akbar Agha-mohammadi

We present a probabilistic logic programming framework to reinforcement learning, by integrating reinforce-ment learning, in POMDP environments, with normal hybrid probabilistic logic programs with probabilistic answer set seman-tics, that…

Artificial Intelligence · Computer Science 2010-11-30 Emad Saad

Partially observable Markov decision processes (POMDP) are a useful model for decision-making under partial observability and stochastic actions. Partially Observable Monte-Carlo Planning is an online algorithm for deciding on the next…

Artificial Intelligence · Computer Science 2023-10-05 Oded Blumenthal , Guy Shani

We study provable multi-agent reinforcement learning (RL) in the general framework of partially observable stochastic games (POSGs). To circumvent the known hardness results and the use of computationally intractable oracles, we advocate…

Machine Learning · Computer Science 2026-03-16 Xiangyu Liu , Kaiqing Zhang

Policies for Partially Observable Markov Decision Processes (POMDPs) are often designed using a nominal system model. In practice, this model can deviate from the true system during deployment due to factors such as calibration drift or…

Artificial Intelligence · Computer Science 2026-04-24 Benjamin Kraske , Qi Heng Ho , Federico Rossi , Morteza Lahijanian , Zachary Sunberg

This paper proposes Partially Observable Reference Policy Programming, a novel anytime online approximate POMDP solver which samples meaningful future histories very deeply while simultaneously forcing a gradual policy update. We provide…

Artificial Intelligence · Computer Science 2025-07-17 Edward Kim , Hanna Kurniawati

We propose to deal with sequential processes where only partial observations are available by learning a latent representation space on which policies may be accurately learned.

Machine Learning · Computer Science 2014-06-18 Gabriella Contardo , Ludovic Denoyer , Thierry Artieres , Patrick Gallinari

Planning plays an important role in the broad class of decision theory. Planning has drawn much attention in recent work in the robotics and sequential decision making areas. Recently, Reinforcement Learning (RL), as an agent-environment…

Artificial Intelligence · Computer Science 2016-08-18 Kamyar Azizzadenesheli , Alessandro Lazaric , Animashree Anandkumar

Robots operating in real-world environments must reason about possible outcomes of stochastic actions and make decisions based on partial observations of the true world state. A major challenge for making accurate and robust action…

Robotics · Computer Science 2023-07-28 Ricardo Cannizzaro , Lars Kunze

We study planning problems where autonomous agents operate inside environments that are subject to uncertainties and not fully observable. Partially observable Markov decision processes (POMDPs) are a natural formal model to capture such…

Artificial Intelligence · Computer Science 2018-02-28 Steven Carr , Nils Jansen , Ralf Wimmer , Jie Fu , Ufuk Topcu

We consider a distributionally robust Partially Observable Markov Decision Process (DR-POMDP), where the distribution of the transition-observation probabilities is unknown at the beginning of each decision period, but their realizations…

Optimization and Control · Mathematics 2020-12-09 Hideaki Nakao , Ruiwei Jiang , Siqian Shen

This paper proposes a reinforcement learning method for controller synthesis of autonomous systems in unknown and partially-observable environments with subjective time-dependent safety constraints. Mathematically, we model the system…

Robotics · Computer Science 2021-04-06 Yu Wang , Alper Kamil Bozkurt , Miroslav Pajic

Partially observable Markov decision processes (POMDPs) rely on the key assumption that probability distributions are precisely known. Robust POMDPs (RPOMDPs) alleviate this concern by defining imprecise probabilities, referred to as…

Artificial Intelligence · Computer Science 2024-07-30 Eline M. Bovy , Marnix Suilen , Sebastian Junges , Nils Jansen

We consider the reinforcement learning problem for partially observed Markov decision processes (POMDPs) with large or even countably infinite state spaces, where the controller has access to only noisy observations of the underlying…

Machine Learning · Computer Science 2023-07-20 Semih Cayci , Niao He , R. Srikant

This work leverages adaptive social learning to estimate partially observable global states in multi-agent reinforcement learning (MARL) problems. Unlike existing methods, the proposed approach enables the concurrent operation of social…

Multiagent Systems · Computer Science 2025-08-11 Ainur Zhaikhan , Malek Khammassi , Ali H. Sayed

The interactive partially observable Markov decision process (I-POMDP) is a recently developed framework which extends the POMDP to the multi-agent setting by including agent models in the state space. This paper argues for formulating the…

Robotics · Computer Science 2012-04-03 Mark P. Woodward , Robert J. Wood

Partially Observable Markov Decision Process (POMDP) is a framework applicable to many real world problems. In this work, we propose an approach to solve POMDPs with multimodal belief by relying on a policy that solves the fully observable…

Machine Learning · Computer Science 2022-07-26 András Attila Sulyok , Kristóf Karacs

The sense of touch, being the earliest sensory system to develop in a human body [1], plays a critical part of our daily interaction with the environment. In order to successfully complete a task, many manipulation interactions require…

Robotics · Computer Science 2017-05-18 Jaeyong Sung , J. Kenneth Salisbury , Ashutosh Saxena

We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize…

Artificial Intelligence · Computer Science 2016-05-12 Tomáš Brázdil , Krishnendu Chatterjee , Martin Chmelík , Anchit Gupta , Petr Novotný

Many processes, such as discrete event systems in engineering or population dynamics in biology, evolve in discrete space and continuous time. We consider the problem of optimal decision making in such discrete state and action space…

Machine Learning · Computer Science 2020-10-27 Bastian Alt , Matthias Schultheis , Heinz Koeppl
‹ Prev 1 4 5 6 7 8 10 Next ›