DTU Compute will host two talks on automated planning by members of the world-famous automated planning group at University of Freiburg.
Schedule:
- 13.00-14.00 Bernhard Nebel, University of Freiburg. Compilability: Assessing expressivity and designing efficient planning algorithms.
- 14.15-15.15 Robert Matmüller, University of Freiburg. Cooperative Epistemic Multi-Agent Planning With Implicit Coordination.
Abstracts:
Bernhard Nebel. Compilability: Assessing expressivity and designing efficient planning algorithms
Compilability between planning formalisms has been introduced as a formal tool to assess the relative expressiveness of planning formalisms. I will show in the talk, for instance, that conditional effects added on top of basic STRIPS cannot be compiled away. This means that conditional effects add to the expressiveness of the STRIPS languages. On the other side, however, there are also positive compilability results. For example certain forms of axioms added to STRIPS or parts of Golog can be compiled to simple PDDL domains, implying that on can use existing planning algorithms in this case. And similar results hold for restricted forms for planning under uncertainty and epistemic planning.
Robert Matmüller. Cooperative Epistemic Multi-Agent Planning With Implicit Coordination
Epistemic Planning has been used to achieve ontic and epistemic control in multi-agent situations. We extend the formalism to include perspective shifts, allowing us to define a class of cooperative problems in which both action planning and execution is done in a purely distributed fashion, meaning coordination is only allowed implicitly by means of the available (epistemic) actions.