liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Planning in Polynomial Time: The SAS-PUBS Class
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
1990 (English)Report (Other academic)
Abstract [en]

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 , 1990. , 49 p.
LiTH-ISY-I, ISSN 8765-4321 ; 1139
Keyword [en]
Planning, Knowledge representation, Complexity
National Category
Control Engineering
URN: urn:nbn:se:liu:diva-55324OAI: diva2:316059
Available from: 2010-04-29 Created: 2010-04-29 Last updated: 2013-07-28

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Bäckström, ChristerKlein, Inger
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of TechnologyAutomatic Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 50 hits
ReferencesLink to record
Permanent link

Direct link