Some results on the complexity of planning with incomplete information

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1809, Issue , 2000, Pages 308-318

  Haslum, Patrik ^a   Jonsson, Peter ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

EXISTENCE PROBLEMS; INCOMPLETE INFORMATION; INITIAL STATE; NONDETERMINISTIC CHOICE; PLANNING WITH INCOMPLETE INFORMATION; PSPACE-COMPLETE; UNOBSERVABLE;

PROBABILITY DISTRIBUTIONS;

EID: 84943278573     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10720246_24     Document Type: Conference Paper

References (15)

1. C.Baral, V.Kreinovich, and R.Trejo.Computational complexity of planning and approximate planning in presence of incompleteness.In Proc.16th International Joint Conference on Artificial Intelligence (IJCAI'99), 1999.
2. T.Bylander.Complexity results for planning.In Proc.12th International Joint Conference on Artificial Intelligence, 1991.
3. G.Collins and L.Pryor.Planning under uncertanity: Some key issues.In Proc.14th International Joint Conference on Artificial Intelligence, 1995.
4. D.Draper, S.Hanks, and D.Weld.Probabilistic planning with information gathering and contingent execution.In Artificial Intelligence Planning Systems: Proc.2nd International Conference, 1994.
5. K.Erol, D.S.Nau, and V.S.Subrahmanian.Complexity, decidability and undecidability results for domain-independent planning: A detailed analysis.Technical Report CS-TR-2797, Computer Science Department, University of Maryland, 1991.
6. J.Goldsmith, C.Lusena, and M.Mundhenk.The complexity of deterministically observable -nite-horizon markov decision processes.Technical Report 268-96, Computer Science Department, University of Kentucky, 1996.
7. J.E.Hopcroft and J.D.Ullman.Introduction to Automata theory, Languages and Computation.Addison-Wesley, Reading, MA, 1979.
8. D.S.Johnson.A catalog of complexity classes.In J.van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A.Elsevier, Amsterdam, 1990.
9. N.Kushmerick, S.Hanks, and D.Weld.An algorithm for probabilistic leastcommitment planning.In Proc.12th National Conference on Artificial Intelligence, 1994.
10. M.L.Littman.Probabilistic propositional planning: Representations and complexity.In Proc.14th National Conference on Artificial Intelligence, 1997.
11. C.H.Papadimitrou.Computational Complexity.Addison-Wesley, Reading, MA, 1994.
12. M.Peot and D.Smith.Conditional nonlinear planning.In Artificial Intelligence Planning Systems: Proc.International Confrence, 1992.
13. D.H.D.Warren.Generating conditional plans and programs.In Proceedings of the Summer Conference on AI and Simulation of Behaviour, 1976.
14. D.Weld, C.Anderson, and D.Smith.Extending Graphplan to handle uncertainty & sensing actions.In Proc.15th National Conference on Artifical Intelligence (AAAI'98), 1998.
15. D.Weld and D.Smith.Conformant Graphplan.In Proc.15th National Conference on Artifical Intelligence (AAAI'98), 1998.