Leveraging Action Relational Structures for Integrated Learning and Planning
Wang, R. X. and Trevizan, F.
To appear in Proc. of 35th Int. Conf. on Automated Planning and Scheduling (ICAPS).
We are working on the camera-ready of this paper and it will be available soon.
Bellow is the abstract of this paper.
Recent advances in planning have explored using learning methods to help planning. However, little attention has been given to adapting search algorithms to work better with learning systems. In this paper, we introduce partial-space search, a new search space for classical planning that leverages the relational structure of actions given by PDDL action schemas -- a structure overlooked by traditional planning approaches. This method allows for a more focused and efficient search and is better suited for machine learning heuristics by providing a more granular view of the search space. To guide partial-space search, we introduce action set heuristics that evaluate sets of actions in a state. We describe how to automatically convert existing heuristics into action set heuristics. We also train action set heuristics from scratch using large training datasets from partial-space search. Our new planner, LazyLifted, exploits our better integrated search and learning heuristics and outperforms the state-of-the-art ML-based heuristic on IPC 2023 learning track (LT) benchmarks. We also show the efficiency of LazyLifted on high branching factor tasks and show that it surpasses LAMA in the combined IPC 2023 LT and high branching factor benchmarks.