Robust execution of robotic tasks is a difficult problem. In many situations, these tasks involve complex behaviors combining different functionalities (e.g. perception, localizat...
The aim of this paper is to show how abduction can be used in classification tasks when we deal with incomplete data. Some classifiers, even if based on decision tree induction lik...
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...