are solved by techniques similar to those of classical planning, but where the state space is exponential in the size of the problem, because of the uncertainty about the current state. A solution for a conformant planning problem is a sequence of actions. Haslum and Jonsson have demonstrated that the problem of conformant planning is EXPSPACE-complete, and 2EXPTIME-complete when the initial situation is uncertain, and there is non-determinism in the actions outcomes. Deployment of planning systems The Hubble Space Telescope uses a short-term system called SPSS and a long-term planning system called Spike . See also Action description language Actor model Applications of artificial intelligence Constraint satisfaction problem Reactive planning Scheduling (computing) Strategy (game theory) Lists List of SMT solvers List of constraint programming languages List of emerging technologies Outline of artificial intelligence References Further reading External links International Conference on Automated Planning and Scheduling