AIFeb 16, 2024

Planning Domain Model Acquisition from State Traces without Action Parameters

arXiv:2402.10726v47 citationsh-index: 14KR
Originality Incremental advance
AI Analysis

This work addresses a limitation in automated planning by enabling model acquisition from less informative traces, which is incremental but improves practicality for domain-specific applications.

The paper tackles the problem of learning planning action domain models from state traces that lack action parameters, only providing action names, and shows that the task is at least as hard as graph isomorphism. The proposed method outperforms state-of-the-art tools SAM and Extended SAM in multiple IPC benchmarks by learning more similar action models with less input information.

Existing planning action domain model acquisition approaches consider different types of state traces from which they learn. The differences in state traces refer to the level of observability of state changes (from full to none) and whether the observations have some noise (the state changes might be inaccurately logged). However, to the best of our knowledge, all the existing approaches consider state traces in which each state change corresponds to an action specified by its name and all its parameters (all objects that are relevant to the action). Furthermore, the names and types of all the parameters of the actions to be learned are given. These assumptions are too strong. In this paper, we propose a method that learns action schema from state traces with fully observable state changes but without the parameters of actions responsible for the state changes (only action names are part of the state traces). Although we can easily deduce the number (and names) of the actions that will be in the learned domain model, we still need to deduce the number and types of the parameters of each action alongside its precondition and effects. We show that this task is at least as hard as graph isomorphism. However, our experimental evaluation on a large collection of IPC benchmarks shows that our approach is still practical as the number of required parameters is usually small. Compared to the state-of-the-art learning tools SAM and Extended SAM our new algorithm is able to provide better results in multiple domains in terms of learning action models more similar to reference models, even though it uses less information and has fewer restrictions on the input traces.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes