Planning
Book sections 11.1-11.2
Slides: https://webeep.polimi.it/pluginfile.php/257113/mod_folder/content/0/FAI2021-12-Planning.pdf https://webeep.polimi.it/pluginfile.php/257113/mod_folder/content/0/FAI2021-13-EfficientPlanning.pdf
Pages
Classical Planning and PDDL
Classical planning is defined as the task of finding a sequence of actions to accomplish a goal in a discrete, deterministic, static, fully observable environment. We have seen two approaches to this…
Algorithms for Classical Planning
The description of a planning problem provides an obvious way to search from the initial state through the space of states, looking for a goal. A nice advantage of the declarative representation of…
SATPlan
Starting from a PDDL representation of the agent’s knowledge base KB (specifying the initial state and the actions) and the goal g, the plan is build as follows: SATPlan tries to build a plan of…