Abstract
In this work we concentrate on generating plans that take into account conditional actions. The main idea was to develop an algorithm that extended classical formalisms in a general way. By general way, we mean a flexible formalism that could use any algorithm for classical planning without any change. The result of our efforts was the development of a planner that we called METAPlan. In this paper we describe METAPlan and show some results of its performance. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
De Melo, J. T., & Lopes, C. R. (2006). Achieving conditional plans through the use of classical planning algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4140 LNAI, pp. 512–521). Springer Verlag. https://doi.org/10.1007/11874850_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
