Copenhagen Programming Language Seminar
Automated planning considers selecting and sequencing actions in order to change the state of a discrete system from some initial state to some goal state. This problem is fundamental in control and scheduling and also emerges in verification and theorem proving. Planning is PSPACE-complete, but good average performance has been obtained on
deterministic benchmarks. Problems with non-deterministic actions, however, has turned out to be very hard. The currently best known approach is to employ the reduced ordered binary decision diagram (BDD) using techniques developed in symbolic model checking. However,this approach is challenged by a frequent blow-up of the BDDs and a
limited number of solution concepts. In this talk, I will address both of these problems.
Henrik Reif Andersen. Administrative host: Camilla Jensen. All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, IT-C and KVL.
To receive information about COPLAS talks by email, send a message to email@example.com with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see http://www.coplas.org