Answer Set Planning under Action Costs

  • Thomas Eiter
  • Wolfgang Faber
  • Nicola Leone
  • Gerald Pfeifer
  • Axel Polleres
Conference paper

DOI: 10.1007/3-540-45757-7_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2424)
Cite this paper as:
Eiter T., Faber W., Leone N., Pfeifer G., Polleres A. (2002) Answer Set Planning under Action Costs. In: Flesca S., Greco S., Ianni G., Leone N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science, vol 2424. Springer, Berlin, Heidelberg

Abstract

We present \( \mathcal{K}^c \), which extends the declarative planning language \( \mathcal{K} \) by action costs and optimal plans that minimize overall action costs (cheapest plans). As shown, this novel language allows for expressing some nontrivial planning tasks in an elegant way. Furthermore, it flexibly allows for representing planning problems under other optimality criteria as well, such as computing “fastest” plans (with the least number of steps), and refinement combinations of cheap and fast plans. Our experience is encouraging and supports the claim that answer set planning may be a valuable approach to advanced planning systems in which intricate planning tasks can be naturally specified and effectively solved.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Thomas Eiter
    • 1
  • Wolfgang Faber
    • 1
  • Nicola Leone
    • 2
  • Gerald Pfeifer
    • 1
  • Axel Polleres
    • 1
  1. 1.Institut für InformationssystemeTUWienWienAustria
  2. 2.Department of MathematicsUniversity of CalabriaRende (CS)Italy

Personalised recommendations