Question

I am currently looking at partially observable environments and sensor less problems as described in Artificial intelligence : a modern approach/ Stuart Russell, Peter Norvig.
Chapter 4.

The only example for partially observable and also sensorless problems i can find on the internet is the vacuum cleaner problem also shown in the book.

Is there another example, making it also possible to execute the mentioned algorithms as well?

Thanks,

SideSwipe

Answer 1

The kind of problems you refer to are referred in the literature as “conformant” planning (partially observable, no feedback) problems. It’s not a terribly “interesting” class of planning problems, because very little work has been done on them, compared with more expressive models such as contingent – partially observable, partial feedbak – planning.

There’s been some work done on it in recent years and you can take a look at the benchmarks by Joerg Hoffmann over here: http://www.loria.fr/~hoffmanj/ff/cff-tests.tgz

A more interesting kind of “applications” of conformant planning is that of mapping the problem of designing a finite state controller into that of solving a conformant planning problem. You might want to check this paper:

http://www.dtic.upf.edu/~hgeffner/fsc-nectar-aaai-2010.pdf

I think there are some follow-ups to this.

Note that in the above the problems are described in STRIPS extended so to represent uncertainty in the initial state.