Lifted Planning: Recent Advances in Planning Using First-Order Representations
Lifted Planning: Recent Advances in Planning Using First-Order Representations
Augusto B. CorrĂȘa, Giuseppe De Giacomo
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence
Survey Track. Pages 8010-8019.
https://doi.org/10.24963/ijcai.2024/886
Lifted planning is usually defined as planning directly over a first-order representation. From the mid-1990s until the late 2010s, lifted planning was sidelined, as most of the state-of-the-art planners first ground the task and then solve it using a propositional representation. Moreover, it was unclear whether lifted planners could scale. But as planning problems become harder, they also become infeasible to ground. Recently, lifted planners came back into play, aiming at problems where grounding is a bottleneck. In this work, we survey recent advances in lifted planning. The main techniques rely either on state-space search or logic satisfiability. For lifted search-based planners, we show the direct connections to other areas of computer science, such as constraint satisfaction problems and databases. For lifted planners based on satisfiability, the advances in modeling are crucial to their scalability. We briefly describe the main planners available in the literature and their techniques.
Keywords:
Planning and Scheduling: General
Knowledge Representation and Reasoning: KRR: Reasoning about actions