In the multi-armed bandit (MAB) problem there are k distributions associated with the
rewards of playing each of k strategies (slot machine arms). The reward distributions are …

The restless bandit problem is one of the most well-studied generalizations of the celebrated
stochastic multi-armed bandit (MAB) problem in decision theory. In its ultimate generality, the …

Motivated by the type of missions currently performed by unmanned aerial vehicles, we
investigate a discrete dynamic vehicle routing problem with a potentially large number of …

In the stochastic knapsack problem, we are given a knapsack of size B, and a set of items
whose sizes and rewards are drawn from a known probability distribution. To know the …

Technological advances in the area of unmanned vehicles are opening new possibilities for
creating teams of vehicles performing complex missions with some degree of autonomy …

Cette thèse traite de méthodes «model-based» pour résoudre des problèmes
d'apprentissage par renforcement. On considère un agent confronté à une suite de …

Cette thèse a été effectuée au sein du Laboratoire Traitement et Communication de
l'Information (LTCI), une Unité Mixte de Recherche du CNRS et de Télécom ParisTech. Elle …