Advertisement

Planning in polynomial time

  • Christer Bäckström
  • Inger Klein
Planning/Design/Scheduling
Part of the Lecture Notes in Computer Science book series (LNCS, volume 462)

Abstract

This paper describes a polynomial-time, O(n3), 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.

Keywords

Planning Problem Action Type Limited Class Planning Algorithm Sequential Plan 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Sara Baase. Computer Algorithms: Introduction and Analysis. Addison Wesley, Reading, Mass., 2nd edition, 1988.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    Frank Brown, editor. Workshop on the Frame Problem. Morgan Kaufman Publishers, 1987.Google Scholar
  7. [7]
    David Chapman. Planning for conjunctive goals. Artificial Intelligence, 32:333–377, 1987.Google Scholar
  8. [8]
    Thomas Dean and Mark Boddy. Reasoning about partially ordered events. Artificial Intelligence, 36:375–399, 1988.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    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.Google Scholar
  13. [13]
    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.Google Scholar
  14. [14]
    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.Google Scholar
  15. [15]
    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.Google Scholar
  16. [16]
    Erik Sandewall and Ralph Rönnquist. A representation of action structures. In Proceedings AAAI-86: Fifth National Conference on Artificial Intelligence, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Christer Bäckström
    • 1
  • Inger Klein
    • 2
  1. 1.Dept. of Computer ScienceLinköping UniversityLinköpingSweden
  2. 2.Dept. of Electrical EngineeringLinköping UniversityLinköpingSweden

Personalised recommendations