Bäckström, C. and Klein, I. (1991). On the Planning Problem in Sequential Control. Technical Report LiTH-IDA-R-91-37, Department of Computer and Information Science, Linköping University, Sweden. This report also appears in the proceedings of the 30th IEEE Conference on Decision and Control, 11-13 December 1991 Brighton, England. (bibtex),
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.
CS Dept TR Overview