Some results on the complexity of planning with incomplete information
1999 (English)In: Proceedings of the 5th European Conference on Planning (ECP), Springer, 1999, Vol. 1809, 308-318Conference paper (Refereed)
Planning with incomplete information may mean a number of different things, that certain facts of the initial state are not known, that operators can have random or nondeterministic effects, or that the plans created contain sensing operations and are branching. Study of the complexity of incomplete information planning has so far been concentrated on probabilistic domains, where a number of results have been found. We examine the complexity of planning in nondeterministic propositional domains. This differs from domains involving randomness, which has been well studied, in that for a nondeterministic choice, not even a probability distribution over the possible outcomes is known. The main result of this paper is that the non-branching plan existence problem in unobservable domains with an expressive operator formalism is EXPSPACE-complete. We also discuss several restrictions, which bring the complexity of the problem down to PSPACF-complete, and extensions to the fully and partially observable cases.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 1809
National CategoryEngineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-49179DOI: 10.1007/10720246_24OAI: oai:DiVA.org:liu-49179DiVA: diva2:270075