Abstract
We tackle the problem of classical planning with qualitative state-trajectory constraints as those that can be expressed in PDDL3. These kinds of constraints allow a user to formally specify which temporal properties a plan has to conform with through a class of LTL formulae. We study a compilationbased approach that, without resorting to automata for representing and dealing with such properties, takes a PDDL3 problem and generates a classical planning problem with conditional effects that is solvable iff so is the PDDL3 problem. Our compilation exploits a regression operator to revise the actions’ preconditions and conditional effects in a way to (i) prohibit executions that irreversibly violate temporal constraints (ii) be sensitive to executions that traverse those necessary subgoals implied by the temporal specification. An experimental analysis shows that our approach performs better than other state-of-the-art approaches over the majority of the considered benchmark domains.
Original language | English |
---|---|
Title of host publication | Proceedings of the 31st International Conference on Automated Planning and Scheduling |
Subtitle of host publication | ICAPS 2021 |
Publisher | AAAI press |
Number of pages | 5 |
Publication status | Accepted/In press - 16 Feb 2021 |
Event | 31st International Conference on Automated Planning and Scheduling - Sun Yat-Sen University (may be online due to COVID-19), Guangzhou, China Duration: 7 Jun 2021 → 12 Jun 2021 Conference number: 31 https://icaps21.icaps-conference.org/ |
Conference
Conference | 31st International Conference on Automated Planning and Scheduling |
---|---|
Abbreviated title | ICAPS 2021 |
Country | China |
City | Guangzhou |
Period | 7/06/21 → 12/06/21 |
Internet address |