Parallel Non-binary Planning in Polynomial Time: The SAS-PUS Class
1991 (English)Report (Other academic)
This paper formally presents a class of planning problems, the SAS-PUS class, which allows non-binary state variables and parallel execution of actions. The class is proven to be tractable, and we provide a sound and complete, polynomial time algorithm for planning within this class. Since the SAS-PUS class is an extension of the previously presented SAS-PUBS class, this result means that we are getting closer to tackling realistic planning problems in sequential control. In such problems, a restricted problem representation is often sufficient but the size of the problems make tractability an important issue.
Place, publisher, year, edition, pages
Linköping: Linköping University , 1991.
LiTH-ISY-I, ISSN 8765-4321 ; 1229
Planning, Polynomial time, State variables, Algorithms
IdentifiersURN: urn:nbn:se:liu:diva-55449OAI: oai:DiVA.org:liu-55449DiVA: diva2:316155