Parallel Non-Binary Planning in Polynomial Time
1992 (English)Report (Other academic)
This paper formally presents a class of planning problems 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. This result means that we are getting closer to tacking realistic planning problems in sequential control, where a restricted problem representation is often sufficient, but where the size of the problems make tractability an important issue.
Place, publisher, year, edition, pages
Linköping: Linköping University , 1992.
LiTH-ISY-I, ISSN 8765-4321 ; 1371
Planning, polynomial time, Non-binary
IdentifiersURN: urn:nbn:se:liu:diva-55556OAI: oai:DiVA.org:liu-55556DiVA: diva2:316361