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

Direct link
Parallel Non-binary Planning in Polynomial Time: The SAS-PUS 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.
1991 (English)Report (Other academic)
Abstract [en]

This paper formally presents a class of planning problems, the SAS-PUS class, 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. Since the SAS-PUS class is an extension of the previously presented SAS-PUBS class, this result means that we are getting closer to tackling realistic planning problems in sequential control. In such problems, a restricted problem representation is often sufficient but the size of the problems make tractability an important issue.

Place, publisher, year, edition, pages
Linköping: Linköping University , 1991.
LiTH-ISY-I, ISSN 8765-4321 ; 1229
Keyword [en]
Planning, Polynomial time, State variables, Algorithms
National Category
Control Engineering
URN: urn:nbn:se:liu:diva-55449OAI: diva2:316155
Available from: 2010-04-30 Created: 2010-04-30 Last updated: 2013-07-29

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: 67 hits
ReferencesLink to record
Permanent link

Direct link