Compiling task networks into partial order planning domains

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


This paper presents theoretical results and techniques for representing and managing task network goals in the framework of partial order planning. Task oriented formalisms are more expressive than partial order based formalism for problem goals in dynamical and changing domains, but they are not more powerful. 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. The task network model has been extended to describe external events (EETN), a feature not present in many planning models. The equivalence between this new model and PO formalism is also proved.

These results allow to reuse existing partial order planners as tools in order to solve task network goals. We introduce a linear cost technique of domain transformation which compiles a given task domain in an equivalent operator based domain which is then submitted to a nonlinear planner. This technique has been successfully demonstrated by the implementation of a EETN planner based on domain tranfornnations for UCPOP.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Barrett and D. Weld. Scherna 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.
    D. Chapman. Planning for conjunctive goals. Artificial Intelligence 32, 1987Google Scholar
  4. 4.
    K. Erol,.J. Hendler, D.S. Nau. Semantics for Hierarchical Task-Network Planning. Tech. rep. C'S-TR-3239, Univ. of Maryland, March 1994Google Scholar
  5. 5.
    K. Erol, J. Hendler, D.S. Nau. UMCP: A Sound and complete procedure for Hierarchical Task-network planning. In Proceedings of AIPS-94Google Scholar
  6. 6.
    K. Erol, J. Hendler, D.S. Nau. Complexity results for HTN Planning. Tech. rep. C'S-TR-3240, Univ. of Maryland, March 1994Google Scholar
  7. 7.
    K. Erol,.J. Hendler, D.S. Nau. HTN Planning: Complexity and Expressivity. In Proceedings of AAAI-94Google Scholar
  8. 8.
    E.D.P. Pednault. Synthesizing plans that contains actions with context-dependent effects. Computational Intelligence, Vol. 4, 1988Google Scholar
  9. 9.
    S. Kainbhampati. A comparative analysis of Partial Order Planning and Task Reduction Planning, SIGART Bull. 1995Google Scholar
  10. 10.
    S. Kambhampati, J. Hendler. A validation structure based theory of plan modification and reuse. Artificial Intelligence, May 1992Google Scholar
  11. 11.
    D. McAllister, D. Rosenblitt, Systematic nonlinear planning, In Proceedings of AAAI-91Google Scholar
  12. 12.
    E.D. Sacerdoti, The nonlinear nature of plans. In Proceedings of IJCAI 1975Google Scholar
  13. 13.
    J.S. Penberthy and D. Weld. UCPOP: A Sound, Complete Partial Order Planner for ADL. In Proceedings of KR-92, 1992.Google Scholar
  14. 14.
    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 MatematicaUniversity degli Studi di PerugiaPerugiaItaly

Personalised recommendations