Using Large Language Models for Abstraction of Planning Domains - Extended Version
Generating an abstraction of a dynamic domain that aligns with a given purpose remains a significant challenge given that the choice of such an abstraction can impact an agent's ability to plan, reason, and provide explanations effectively. We model the agent's concrete behaviors in PDDL and investigate the use of in-context learning with large language models (LLMs) for the generation of abstract PDDL domains and problem instances, given an abstraction objective specified in natural language. The benchmark examples we use are new and have not been part of the data any LLMs have been trained on. We consider three categories of abstractions: abstraction of choice of alternative concrete actions, abstraction of sequences of concrete actions, and abstraction of action/predicate parameters, as well as combinations of these. The generated abstract PDDL domains and problem instances are then checked by symbolic validation tools as well as human experts. Our experiments show that GPT-4o can generally synthesize useful planning domain abstractions in simple settings, although it is better at abstracting over actions than over the associated fluents.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning Temporally Extended Skills in Continuous Domains as Symbolic Actions for Planning
Problems which require both long-horizon planning and continuous control capabilities pose significant challenges to existing reinforcement learning agents. In this paper we introduce a novel hierarchical reinforcement l…
continuous-controlContinuous ControlHierarchical Reinforcement Learningreinforcement-learning+2Guarantees for Sound Abstractions for Generalized Planning (Extended Paper)
Generalized planning is about finding plans that solve collections of planning instances, often infinite collections, rather than single instances. Recently it has been shown how to reduce the planning problem for genera…
An Automatic Sound and Complete Abstraction Method for Generalized Planning with Baggable Types
Generalized planning is concerned with how to find a single plan to solve multiple similar planning instances. Abstractions are widely used for solving generalized planning, and QNP (qualitative numeric planning) is a po…
Learning Planning Abstractions from Language
This paper presents a framework for learning state and action abstractions in sequential decision-making domains. Our framework, planning abstraction from language (PARL), utilizes language-annotated demonstrations to au…
Decision MakingSequential Decision MakingPlanning with Goal-Conditioned Policies
Planning methods can solve temporally extended sequential decision making problems by composing simple behaviors. However, planning requires suitable abstractions for the states and transitions, which typically need to b…
Decision Makingreinforcement-learningReinforcement LearningReinforcement Learning (RL)+3