Uncertain partially observable Markov decision processes (uPOMDPs) allow the probabilistic transition and observation functions of standard POMDPs to belong to a so-called uncertainty set. Such uncertainty sets capture uncountable sets of probability distributions. We develop an algorithm to compute finite-memory policies for uPOMDPs that robustly satisfy given specifications against any admissible distribution. In general, computing such policies is both theoretically and practically intractable. We provide an efficient solution to this problem in four steps. (1) We state the underlying problem as a nonconvex optimization problem with infinitely many constraints. (2) A dedicated dualization scheme yields a dual problem that is still nonconvex but has finitely many constraints. (3) We linearize this dual problem and (4) solve the resulting finite linear program to obtain locally optimal solutions to the original problem. The resulting problem formulation is exponentially smaller than those resulting from existing methods. We demonstrate the applicability of our algorithm using large instances of an aircraft collision-avoidance scenario and a novel spacecraft motion planning case study.
|Title of host publication||Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI-21)|
|Publisher||Association for the Advancement of Artificial Intelligence (AAAI)|
|Publication status||Published - 2021|
|Event||35th AAAI Conference on Artificial Intelligence : A Virtual Conference - ONLINE|
Duration: 2 Feb 2021 → 9 Feb 2021
|Conference||35th AAAI Conference on Artificial Intelligence : A Virtual Conference|
|Period||2/02/21 → 9/02/21|