Gradient-based planning with world models

It would be interesting to have a taxonomy of planning problem hardness. A lot of the references are about control problems, which AFAIK are rather deterministic.

Making plans when dealing with incomplete or missing information requires strategy and adaptability, and multiple routes to a moving target. How hard would a hunting game be for these models?