Achieving Conditional Plans Through the Use of Classical Planning Algorithms

  • Jony Teixeira de Melo
  • Carlos Roberto Lopes
Conference paper

DOI: 10.1007/11874850_55

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4140)
Cite this paper as:
de Melo J.T., Lopes C.R. (2006) Achieving Conditional Plans Through the Use of Classical Planning Algorithms. In: Sichman J.S., Coelho H., Rezende S.O. (eds) Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Lecture Notes in Computer Science, vol 4140. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jony Teixeira de Melo
    • 1
  • Carlos Roberto Lopes
    • 1
  1. 1.Faculdade de ComputaçãoUniversidade Federal de Uberlândia (UFU)Uberlândia/MGBrazil

Personalised recommendations