
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}.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAI-based Problem Solving and Planning · Logic, Reasoning, and Knowledge · Constraint Satisfaction and Optimization
