On the Planning Problem in Sequential Control
1991 (English)Report (Other academic)
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
Planning, Polynomial time
IdentifiersURN: urn:nbn:se:liu:diva-55465OAI: oai:DiVA.org:liu-55465DiVA: diva2:316138