Partially Observable Monte-Carlo Planning (POMCP) is a powerful online algorithm able to generate approximate policies for large Partially Observable Markov Decision Processes. The online nature of this method supports scalability by avoiding complete policy representation. The lack of an explicit representation however hinders policy interpretability and makes policy verification very complex. In this work, we propose two contributions. The first is a method for identifying unexpected actions selected by POMCP with respect to expert prior knowledge of the task. The second is a shielding approach that prevents POMCP from selecting unexpected actions. The first method is based on Maximum Satisfiability Modulo Theory (MAX-SMT). It inspects tr...
We propose a new method for learning policies for large, partially observable Markov decision proces...
AbstractIn this paper, we bring techniques from operations research to bear on the problem of choosi...
In automated planning, action preconditions are boolean-valued formulas, which check whether a given...
Partially Observable Monte-Carlo Planning (POMCP) is a powerful online algorithm able to generate ap...
Partially Observable Monte Carlo Planning (POMCP) is a powerful online algorithm that can generate a...
Partially Observable Monte-Carlo Planning (POMCP) is a powerful online algorithm that can generate o...
Partially Observable Monte-Carlo Planning (POMCP) is a powerful online algorithm able to generate ap...
Partially Observable Monte Carlo Planning is a recently proposed online planning algorithm which mak...
Online planning methods for partially observable Markov decision processes (POMDPs) have re- cently ...
Summarization: Online planning methods for partially observable Markov decision processes (POMDPs) h...
Partially observable Markov decision processes(POMDPs) provide a modeling framework for a variety of...
In this paper, we present a Monte-Carlo policy rollout technique (called MOCART-CGA) for path planni...
AbstractThis study extends the framework of partially observable Markov decision processes (POMDPs) ...
Partially Observable Markov Decision Processes (POMDPs) define a useful formalism to express probabi...
AbstractActing in domains where an agent must plan several steps ahead to achieve a goal can be a ch...
We propose a new method for learning policies for large, partially observable Markov decision proces...
AbstractIn this paper, we bring techniques from operations research to bear on the problem of choosi...
In automated planning, action preconditions are boolean-valued formulas, which check whether a given...
Partially Observable Monte-Carlo Planning (POMCP) is a powerful online algorithm able to generate ap...
Partially Observable Monte Carlo Planning (POMCP) is a powerful online algorithm that can generate a...
Partially Observable Monte-Carlo Planning (POMCP) is a powerful online algorithm that can generate o...
Partially Observable Monte-Carlo Planning (POMCP) is a powerful online algorithm able to generate ap...
Partially Observable Monte Carlo Planning is a recently proposed online planning algorithm which mak...
Online planning methods for partially observable Markov decision processes (POMDPs) have re- cently ...
Summarization: Online planning methods for partially observable Markov decision processes (POMDPs) h...
Partially observable Markov decision processes(POMDPs) provide a modeling framework for a variety of...
In this paper, we present a Monte-Carlo policy rollout technique (called MOCART-CGA) for path planni...
AbstractThis study extends the framework of partially observable Markov decision processes (POMDPs) ...
Partially Observable Markov Decision Processes (POMDPs) define a useful formalism to express probabi...
AbstractActing in domains where an agent must plan several steps ahead to achieve a goal can be a ch...
We propose a new method for learning policies for large, partially observable Markov decision proces...
AbstractIn this paper, we bring techniques from operations research to bear on the problem of choosi...
In automated planning, action preconditions are boolean-valued formulas, which check whether a given...