@techreport{R-91-37, TITLE = {On the Planning Problem in Sequential Control}, AUTHOR = {Christer B{\"a}ckstr{\"o}m and Inger Klein}, YEAR = {1991}, NUMBER = {R-91-37}, INSTITUTION = ida, ADDRESS = idaaddr, ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-91-37+abstr}, ABSTRACT = {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 artificial intelligence (AI). For planning problems in the SAS-PUBS class the algorithm finds 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.}, IDANR = {LiTH-IDA-R-91-37}, NOTE = {This report also appears in the proceedings of the 30th IEEE Conference on Decision and Control, 11-13 December 1991 Brighton, England}