Abstract
This paper describes a polynomial-time, O(n 3), planning algorithm for a limited class of planning problems. Compared to previous work on complexity of algorithms for knowledge-based or logic-based planning, our algorithm achieves computational tractability, but at the expense of only applying to a significantly more limited class of problems. Our algorithm is proven correct and complete, and it always returns a minimal plan if there is a plan at all.
A shorter version of this paper appears in the proceedings of the ISMIS'90 poster session.
Preview
Unable to display preview. Download preview PDF.
References
Sara Baase. Computer Algorithms: Introduction and Analysis. Addison Wesley, Reading, Mass., 2nd edition, 1988.
Christer Bäckström. Action structures with implicit coordination. In T O'Shea and V Sgurev, editors, Proceedings of the Third International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA'88), Varna, Bulgaria, September 1988. North-Holland.
Christer Bäckström. Reasoning about interdependent actions. Licentiate Thesis 139, Department of Computer and Information Science, Linköping University, Linköping, Sweden, June 1988.
Christer Bäckström. A representation of coordinated actions characterized by interval valued conditions. In Zbigniew W Ras and Lorenza Saitta, editors, Proceedings of the Third International Symposium on Methodologies for Intelligent systems (ISMIS'88), Torino, Italy, October 1988. North-Holland.
Christer Bäckström and Inger Klein. Planning in polynomial time: The SAS-PUBS class. Research Report LiTH-IDA-R-90-16, Department of Computer and Information Science, Linköping University, Linköping, Sweden, June 1990.
Frank Brown, editor. Workshop on the Frame Problem. Morgan Kaufman Publishers, 1987.
David Chapman. Planning for conjunctive goals. Artificial Intelligence, 32:333–377, 1987.
Thomas Dean and Mark Boddy. Reasoning about partially ordered events. Artificial Intelligence, 36:375–399, 1988.
Richard E Fikes and Nils J Nilsson. Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189–208, 1971.
Christer Hansson. A prototype system for logical reasoning about time and action. Licentiate Thesis 203, Department of Computer and Information Science, Linköping University, Linköping, Sweden, January 1990.
Patrick J Hayes. The frame problem and related problems in artificial intelligence. In Bonnie Lynn Webber and Nils J. Nilsson, editors, Readings in Artificial Intelligence. Morgan Kaufman Publishers, 1981.
Johan Hultman. COPPS — A software system for defining and controlling actions in a mechanical system. In IEEE Workshop on Languages and Automation, Vienna, Austria, 1987.
Johan Hultman. A software system for defining and controlling actions in a mechanical system. Licentiate thesis 146, Department of Computer and Information Science, Linköping University, Linköping, Sweden, September 1988.
Inger Klein. Planning for a class of sequential control problems. Licentiate Thesis 234, Department of Electrical Engineering, Linköping University, Linköping, Sweden, May 1990.
Erik Sandewall. A decision procedure for a theory of actions and plans. In Proceedings of the Fourth International Symposium on Methodologies for Intelligent systems (ISMIS'89), 1989.
Erik Sandewall and Ralph Rönnquist. A representation of action structures. In Proceedings AAAI-86: Fifth National Conference on Artificial Intelligence, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bäckström, C., Klein, I. (1990). Planning in polynomial time. In: Gottlob, G., Nejdl, W. (eds) Expert Systems in Engineering Principles and Applications. ESE 1990. Lecture Notes in Computer Science, vol 462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53104-1_36
Download citation
DOI: https://doi.org/10.1007/3-540-53104-1_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53104-3
Online ISBN: 978-3-540-46711-3
eBook Packages: Springer Book Archive