We consider planning problems where a robot must gather reward by completing tasks at each of a large set of locations while constrained by a time bound. Our focus is problems where the difficulty of each task, and thus its duration, can be predicted, but is not fully known in advance. We model difficulty-aware problems as a Markov decision proc…
We consider planning problems where a robot must visit a large set of locations to complete a task at each one. Our focus is problems where the difficulty of each task, and thus its duration, can be predicted, but not fully known in advance. We propose a general Markov decision process (MDP) model for difficulty-aware problems, and propose varia…
