Task planning and partial order planning: A domain transformation approach

  • M. Baioletti
  • S. Marcugini
  • A. Milani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1348)


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.


Partial Order Planning Task Planning Domain Transformation Expressivity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Barrett and D. Weld. Schema Parsing: Hierarchical Planning for Expressive Language. In Proceedings of AAAI-94Google Scholar
  2. 2.
    J. Blythe. Planning with External Events. In Proceedings of AIPS-94Google Scholar
  3. 3.
    A. Blum and M. Furst. Fast planning through planning grpah analysis. In Proceedings of IJCAI-95. To appear in Artificial Intelligence 1997Google Scholar
  4. 4.
    D. Chapman. Planning for Conjunctive Goals. Artificial Intelligence 32, 1987Google Scholar
  5. 5.
    Erol, J. Hendler, D.S. Nan. Semantics for Hierarchical Task-Network Planning Tech. Rep. CS-TR-3239, Univ. of Maryland, March 1994Google Scholar
  6. 6.
    K. Erol, J. Hendler, D.S. Nau. UMCP: A Sound and Complete Procedure for Hierarchical Task-Network Planning. In Proceedings of AIPS-94Google Scholar
  7. 7.
    K. Erol, J. Hendler, D.S. Nau. Complexity Results for HTN Planning. Tech. Rep. CS-TR-3240, Univ. of Maryland, March 1994Google Scholar
  8. 8.
    K. Erol, J. Hendler, D.S. Nau. HTN Planning: Complexity and Expressivity. In Proceedings of AAAI-94Google Scholar
  9. 9.
    E.D.P. Pednault. Synthesizing Plans That Contains Actions With Context-Dependent Effects. Computational Intelligence, Vol. 4, 1988Google Scholar
  10. 10.
    S. Kambhampati. A Comparative Analysis of Partial Order Planning and Task Reduction Planning SIGART Bull. 1995Google Scholar
  11. 11.
    S. Kambhampati, J. Hendler. A Validation Structure Based Theory of Plan Modification and Reuse. Artificial Intelligence, May 1992Google Scholar
  12. 12.
    T.L. McCluskey, J.M. Porteous. Planning Speed-up via Domain Model Compilation. in New Direction in AI Planning. IOS Press 1996Google Scholar
  13. 13.
    E.D. Sacerdoti, The nonlinear nature of plans. In Proceedings of IJCAI 1975Google Scholar
  14. 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. 15.
    Q. Yang. Formalizing Planning Knowledge for Hierarchical Planning, Computational Intelligence, Vol 6, pag. 12–24, 1990Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • M. Baioletti
    • 1
  • S. Marcugini
    • 1
  • A. Milani
    • 1
  1. 1.Dipartimento di MatematicaUniversitá di PerugiaPerugiaItaly

Personalised recommendations