We study a generalized form of planning under partial observability, in which we have multiple, possibly infinitely many, planning domains with the same actions and observations, and goals expressed over observations, which are possibly temporally extended. By building on work on two-player (nonprobabilistic) games with imperfect information in the Formal Methods literature, we devise a general technique, generalizing the belief-state construction, to remove partial observability. This reduces the planning problem to a game of perfect information with a tight correspondence between plans and strategies. Then we instantiate the technique and solve some generalized-planning problems.
2016, Proceedings of the twenty-fifth international joint conference on artificial intelligence, Pages 1037-1043
Imperfect-information games and generalized planning (04b Atto di convegno in volume)
DE GIACOMO Giuseppe, Murano Aniello, Rubin Sasha, Di Stasio Antonio