Parallel Non-Binary Planning in Polynomial Time
1991 (English)In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, 1991, 268-273 p.Conference paper (Refereed)
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
1991. 268-273 p.
Planning, Polynomial time, Non-binary
IdentifiersURN: urn:nbn:se:liu:diva-94070OAI: oai:DiVA.org:liu-94070DiVA: diva2:630000
12th International Joint Conference on Artificial Intelligence, Sydney, Australia, August, 1991