Towards Strong Cyclic Planning under Partial Observability
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pistore · 2015
Strong Cyclic Planning aims at generating iterative plans that only allow loops so far as there is a chance to reach the goal. The problem is already significantly complex for fully observable domains; when considering partially observ-able domains, even providing a formal definition is far from straightforward. In this work, we provide a formal defini-tion of Strong Cyclic Planning under Partial Observability, which makes clear how several degrees of solution are possi-ble and equally interesting, depending on the admissible de-lay between achieving the goal and detecting that it has been achieved.