Planning in domains with derived predicates through rule-action graphs and local search

  • Alfonso E. Gerevini
  • Alessandro Saetti
  • Ivan Serina
Article

DOI: 10.1007/s10472-011-9240-3

Cite this article as:
Gerevini, A.E., Saetti, A. & Serina, I. Ann Math Artif Intell (2011) 62: 259. doi:10.1007/s10472-011-9240-3
  • 108 Downloads

Abstract

The ability to express derived predicates in the formalization of a planning domain is both practically and theoretically important. In this paper, we propose an approach to planning with derived predicates where the search space consists of “Rule-Action Graphs”, particular graphs of actions and rules representing derived predicates. We propose some techniques for representing such rules and reasoning with them, which are integrated into a framework for planning through local search and rule-action graphs. We also present some heuristics for guiding the search of a rule-action graph representing a valid plan. Finally, we analyze our approach through an extensive experimental study aimed at evaluating the importance of some specific techniques for the performance of the approach. The results of our experiments also show that our planner performs quite well compared to other state-of-the-art planners handling derived predicates.

Keywords

Automated planning Domain-independent planning Efficient planning Planning with derived predicates  Heuristic search for planning 

Mathematics Subject Classifications (2010)

68T20 68T99 

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Alfonso E. Gerevini
    • 1
  • Alessandro Saetti
    • 1
  • Ivan Serina
    • 2
  1. 1.Dipartimento di Ingegneria dell’InformazioneUniversità degli Studi di BresciaBresciaItaly
  2. 2.Free University of Bozen – BolzanoBressanoneItaly

Personalised recommendations