Skip to main content

Task planning and partial order planning: A domain transformation approach

  • Conference paper
  • First Online:
Recent Advances in AI Planning (ECP 1997)

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

Included in the following conference series:

Abstract

In this paper 1 we introduce techniques of domain transformation for representing and managing task network goals in the framework of partial order planning. A task network planning model, extended to describe external events, is introduced. We prove that it is always possible to express a task network problem in terms of an equivalent problem stated in partial order planning formalism on an appropriate domain. A linear cost technique of domain transformation is described: a given task domain is compiled to generate an equivalent operator based domain which is then submitted to a nonlinear planner. This result shows how to reuse existing partial order planners for solving task network problems. This technique has been successfully demonstrated by the implementation of two TN planners based on domain tranformation for UCPOP and for GRAPHPLAN.

This work has been partially supported under Italian National Research Council C.N.R. “Strategie di controllo innovative per sistemi di Intelligenza Artificiale”

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Barrett and D. Weld. Schema Parsing: Hierarchical Planning for Expressive Language. In Proceedings of AAAI-94

    Google Scholar 

  2. J. Blythe. Planning with External Events. In Proceedings of AIPS-94

    Google Scholar 

  3. A. Blum and M. Furst. Fast planning through planning grpah analysis. In Proceedings of IJCAI-95. To appear in Artificial Intelligence 1997

    Google Scholar 

  4. D. Chapman. Planning for Conjunctive Goals. Artificial Intelligence 32, 1987

    Google Scholar 

  5. Erol, J. Hendler, D.S. Nan. Semantics for Hierarchical Task-Network Planning Tech. Rep. CS-TR-3239, Univ. of Maryland, March 1994

    Google Scholar 

  6. K. Erol, J. Hendler, D.S. Nau. UMCP: A Sound and Complete Procedure for Hierarchical Task-Network Planning. In Proceedings of AIPS-94

    Google Scholar 

  7. K. Erol, J. Hendler, D.S. Nau. Complexity Results for HTN Planning. Tech. Rep. CS-TR-3240, Univ. of Maryland, March 1994

    Google Scholar 

  8. K. Erol, J. Hendler, D.S. Nau. HTN Planning: Complexity and Expressivity. In Proceedings of AAAI-94

    Google Scholar 

  9. E.D.P. Pednault. Synthesizing Plans That Contains Actions With Context-Dependent Effects. Computational Intelligence, Vol. 4, 1988

    Google Scholar 

  10. S. Kambhampati. A Comparative Analysis of Partial Order Planning and Task Reduction Planning SIGART Bull. 1995

    Google Scholar 

  11. S. Kambhampati, J. Hendler. A Validation Structure Based Theory of Plan Modification and Reuse. Artificial Intelligence, May 1992

    Google Scholar 

  12. T.L. McCluskey, J.M. Porteous. Planning Speed-up via Domain Model Compilation. in New Direction in AI Planning. IOS Press 1996

    Google Scholar 

  13. E.D. Sacerdoti, The nonlinear nature of plans. In Proceedings of IJCAI 1975

    Google Scholar 

  14. J.S. Penberthy and D. Weld. UCPOP: A Sound, Complete Partial Order Planner for ADL. In Proceedings of KR-92, 1992.

    Google Scholar 

  15. Q. Yang. Formalizing Planning Knowledge for Hierarchical Planning, Computational Intelligence, Vol 6, pag. 12–24, 1990

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Sam Steel Rachid Alami

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baioletti, M., Marcugini, S., Milani, A. (1997). Task planning and partial order planning: A domain transformation approach. In: Steel, S., Alami, R. (eds) Recent Advances in AI Planning. ECP 1997. Lecture Notes in Computer Science, vol 1348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63912-8_75

Download citation

  • DOI: https://doi.org/10.1007/3-540-63912-8_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63912-1

  • Online ISBN: 978-3-540-69665-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics