Skip to main content
SpringerLink
Log in

Planning in polynomial time

  • Planning/Design/Scheduling
  • Conference paper
  • First Online:
Expert Systems in Engineering Principles and Applications (ESE 1990)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 462))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sara Baase. Computer Algorithms: Introduction and Analysis. Addison Wesley, Reading, Mass., 2nd edition, 1988.

    Google Scholar 

  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. 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. 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. 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. Frank Brown, editor. Workshop on the Frame Problem. Morgan Kaufman Publishers, 1987.

    Google Scholar 

  7. David Chapman. Planning for conjunctive goals. Artificial Intelligence, 32:333–377, 1987.

    Google Scholar 

  8. Thomas Dean and Mark Boddy. Reasoning about partially ordered events. Artificial Intelligence, 36:375–399, 1988.

    Google Scholar 

  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. 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. 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. 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. 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. 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. 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. Erik Sandewall and Ralph Rönnquist. A representation of action structures. In Proceedings AAAI-86: Fifth National Conference on Artificial Intelligence, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Linköping University, S-581 83, Linköping, Sweden

    Christer Bäckström

  2. Dept. of Electrical Engineering, Linköping University, S-581 83, Linköping, Sweden

    Inger Klein

Authors
  1. Christer Bäckström
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Inger Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Georg Gottlob Wolfgang Nejdl

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation