Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Barrett and D. Weld. Scherna parsing: hierarchical planning for Expressive Language. In Proceedings of AAAI-94
J. Blythe. Planning with External Events. In Proceedings of AIPS-94
D. Chapman. Planning for conjunctive goals. Artificial Intelligence 32, 1987
K. Erol,.J. Hendler, D.S. Nau. Semantics for Hierarchical Task-Network Planning. Tech. rep. C'S-TR-3239, Univ. of Maryland, March 1994
K. Erol, J. Hendler, D.S. Nau. UMCP: A Sound and complete procedure for Hierarchical Task-network planning. In Proceedings of AIPS-94
K. Erol, J. Hendler, D.S. Nau. Complexity results for HTN Planning. Tech. rep. C'S-TR-3240, Univ. of Maryland, March 1994
K. Erol,.J. Hendler, D.S. Nau. HTN Planning: Complexity and Expressivity. In Proceedings of AAAI-94
E.D.P. Pednault. Synthesizing plans that contains actions with context-dependent effects. Computational Intelligence, Vol. 4, 1988
S. Kainbhampati. A comparative analysis of Partial Order Planning and Task Reduction Planning, SIGART Bull. 1995
S. Kambhampati, J. Hendler. A validation structure based theory of plan modification and reuse. Artificial Intelligence, May 1992
D. McAllister, D. Rosenblitt, Systematic nonlinear planning, In Proceedings of AAAI-91
E.D. Sacerdoti, The nonlinear nature of plans. In Proceedings of IJCAI 1975
J.S. Penberthy and D. Weld. UCPOP: A Sound, Complete Partial Order Planner for ADL. In Proceedings of KR-92, 1992.
Q. Yang. Formalizing Planning Knowledge for hierarchical planning, Computational Intelligence, Vol 6, pag. 12–24, 1990
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baioletti, M., Marcugini, S., Milani, A. (1997). Compiling task networks into partial order planning domains. In: Lenzerini, M. (eds) AI*IA 97: Advances in Artificial Intelligence. AI*IA 1997. Lecture Notes in Computer Science, vol 1321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63576-9_118
Download citation
DOI: https://doi.org/10.1007/3-540-63576-9_118
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63576-5
Online ISBN: 978-3-540-69601-8
eBook Packages: Springer Book Archive