On-the-fly Macros

TL;DR

This paper introduces a domain-independent algorithm that computes macros dynamically for planning problems, enabling the identification of new tractable classes without prior domain knowledge.

Contribution

The paper presents a novel on-the-fly macro computation algorithm that defines new tractable classes in classical planning, including Blocksworld-arm and Towers of Hanoi.

Findings

Defines new tractable classes of classical planning

Includes Blocksworld-arm and Towers of Hanoi

Operates without prior domain knowledge

Abstract

We present a domain-independent algorithm that computes macros in a novel way. Our algorithm computes macros "on-the-fly" for a given set of states and does not require previously learned or inferred information, nor prior domain knowledge. The algorithm is used to define new domain-independent tractable classes of classical planning that are proved to include \emph{Blocksworld-arm} and \emph{Towers of Hanoi}.