Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search

Authors

  • Alfonso Gerevini University of Brescia
  • Alessandro Saetti University of Brescia
  • Ivan Serina Free University of Bozen

DOI:

https://doi.org/10.1609/icaps.v20i1.13433

Keywords:

temporal planning

Abstract

We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approach could only solve problems admitting a sequential solution. The paper introduces a revised plan representation supporting concurrency and some new search techniques using it, which are implemented in a new version of the LPG planner. An experimental analysis indicates that the proposed approach is suitable to temporal planning with requiring concurrency and is competitive with state-of-the-art planners.

Downloads

Published

2010-05-05

How to Cite

Gerevini, A., Saetti, A., & Serina, I. (2010). Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search. Proceedings of the International Conference on Automated Planning and Scheduling, 20(1), 226-229. https://doi.org/10.1609/icaps.v20i1.13433