Planning in Polynomial Time: The SAS-PUBS Class
1992 (English)Report (Other academic)
This article describes a polynomial-time, O(n3), planning algorithm for a limited class of planning problems. Compared to previous work on complexity of algorithms for knowledge-based or logic-based planning, our algorithm achieves computational tractability, but at the expense of only applying to a significantly more limited class of problems. Our algorithm is proven correct, and it always returns a parallel minimal plan if there is a plan at all.
Place, publisher, year, edition, pages
Linköping: Linköping University , 1992.
LiTH-ISY-I, ISSN 8765-4321 ; 1372
Knowledge representation, Complexity, Planning
IdentifiersURN: urn:nbn:se:liu:diva-55557OAI: oai:DiVA.org:liu-55557DiVA: diva2:316362