Planning in Polynomial Time: the SAS-PUBS Class
1991 (English)In: Computational intelligence, ISSN 0824-7935, E-ISSN 1467-8640, Vol. 7, no 3, 181-197 p.Article in journal (Refereed) Published
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
1991. Vol. 7, no 3, 181-197 p.
Knowledge representation, Complexity, Planning
IdentifiersURN: urn:nbn:se:liu:diva-95631DOI: 10.1111/j.1467-8640.1991.tb00393.xOAI: oai:DiVA.org:liu-95631DiVA: diva2:637009