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

Direct link
On the Planning Problem in Sequential Control
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
1991 (English)Report (Other academic)
Abstract [en]

Sequential control is a common control problem in industry. Despite its importance fairly little theoretical research has been devoted to this problem. We study a subclass of sequential control problems, which we call the SAS-PUBS class, and present a planning algorithm for this class. The algorithm is developed using formalism from articial intelligence (AI). For planning problems in the SAS-PUBS class the algorithm nds a plan from a given initial state to a desired final state if and only if any plan exists solving the stated planning problem. Furthermore the complexity of the given algorithm increases polynomially with the number of state variables.

Place, publisher, year, edition, pages
Linköping: Linköping University , 1991.
LiTH-ISY-I, ISSN 8765-4321 ; 1252
Keyword [en]
Planning, Polynomial time
National Category
Control Engineering
URN: urn:nbn:se:liu:diva-55465OAI: diva2:316138
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
Klein, IngerBäckström, Christer
By organisation
Automatic ControlThe Institute of TechnologyTCSLAB - Theoretical Computer Science Laboratory
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: 39 hits
ReferencesLink to record
Permanent link

Direct link