Handling PDDL3.0 State Trajectory Constraints with Temporal Landmarks

نویسندگان

  • Eliseo Marzal
  • Mohannad Babli
  • Eva Onaindia
  • Laura Sebastia
چکیده

Temporal landmarks have been proved to be a helpful mechanism to deal with temporal planning problems, specifically to improve planners performance and handle problems with deadline constraints. In this paper, we show the strength of using temporal landmarks to handle the state trajectory constraints of PDDL3.0. We analyze the formalism of TempLM, a temporal planner particularly aimed at solving planning problems with deadlines, and we present a detailed study that exploits the underlying temporal landmark-based mechanism of TempLM for representing and reasoning with trajectory constraints.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Features in SGPlan for Handling Preferences and Constraints in PDDL3.0∗

In this paper, we describe our enhancements incorporated in SGPlan (hereafter called SGPLan5) for supporting the new features of the PDDL3.0 language used in the Fifth International Planning Competition (IPC5). Based on the architecture of SGPlan that competed in the Fourth IPC (hereafter called SGPLan4), SGPLan5 partitions a large planning problem into subproblems, each with its own subgoal, a...

متن کامل

Domain Recompilation-based Approach towards Hierarchical Task Network Planning with Constraints

In this paper, we present a domain recompilationbased approach towards specifying and handling state-trajectory constraints in Hierarchical Task Network (HTN) planning paradigm. The proposed constraint specification language is inspired by the PDDL3.0 constructs. The domain-recompilation technique is based on automata templates for the PDDL modal operators. To implement automata embedding we ha...

متن کامل

Handling Soft Constraints and Goals Preferences in SGPlan∗

In this paper, we present the partition-and-resolve strategy in SGPlan (hereafter called SGPLan5) for fully supporting all language features in PDDL3.0. Based on the architecture of SGPlan that supported PDDL2.2 (hereafter called SGPLan4), SGPLan5 partitions a large planning problem into subproblems, each with its own subgoal, and resolves those inconsistent solutions using our extended saddle-...

متن کامل

Controlling Narrative Generation with Planning Trajectories: The Role of Constraints

AI planning has featured in a number of Interactive Storytelling prototypes: since narratives can be naturally modelled as a sequence of actions it has been possible to exploit state of the art planners in the task of narrative generation. However the characteristics of a “good” plan, such as optimality, aren’t necessarily the same as those of a “good” narrative, where errors and convoluted seq...

متن کامل

On the Use of Temporal Landmarks for Planning with Deadlines

In this paper we present a temporal planning approach for handling problems with deadlines. The model relies on the extraction of temporal landmarks from the problem and the construction of a landmarks graph as a skeleton of the solution plan. A temporal landmark is a proposition that must be achieved in a solution plan to satisfy the problem deadline constraints. Each temporal landmark is asso...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1706.08317  شماره 

صفحات  -

تاریخ انتشار 2017