Difficulty-aware time-bounded planning under uncertainty for large-scale robot missions
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 f...
| Váldodahkkit: | , , , , |
|---|---|
| Materiálatiipa: | Conference item |
| Giella: | English |
| Almmustuhtton: |
IEEE
2023
|