Congress of the Italian Association for Artificial Intelligence

AI*IA 2015 Advances in Artificial Intelligence pp 424-437

Integrating Logic and Constraint Reasoning in a Timeline-Based Planner

Conference paper

DOI: 10.1007/978-3-319-24309-2_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9336)
Cite this paper as:
De Benedictis R., Cesta A. (2015) Integrating Logic and Constraint Reasoning in a Timeline-Based Planner. In: Gavanelli M., Lamma E., Riguzzi F. (eds) AI*IA 2015 Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 9336. Springer, Cham

Abstract

This paper introduces the ongoing work for a novel domain-independent planning system which takes inspiration from both Constraint Programming (CP) and Logic Programming (LP), flavouring it all with Object Oriented features. We will see a specific customization of our environment to the particular kind of automated planning referred to as timeline-based. By allowing for the interesting ability of solving both planning and scheduling problems in a uniform schema, the resulting system is particularly suitable for complex domains arising from real dynamic scenarios. The paper proposes a resolution algorithm and enhances it with some (static and dynamic) heuristics to help the solving process. The system is tested on different benchmark problems from classical planning domains like the Blocks World to more challenging temporally expressive problems like the Temporal Machine Shop and the Cooking Carbonara problems demonstrating how the new planner, named iLoC, compares with respect to other state-of-the-art planners.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.CNR, Italian National Research Council, ISTCRomeItaly

Personalised recommendations