no code implementations • 6 Feb 2013 • Anthony R. Cassandra, Michael L. Littman, Nevin Lianwen Zhang
Most exact algorithms for general partially observable Markov decision processes (POMDPs) use a form of dynamic programming in which a piecewise-linear and convex representation of one value function is transformed into another.
