Home

Christer__Backstrom



Computational aspects of reordering plans

Executing parallel plans faster by adding actions

Expressive equivalence of planning formalisms

Finding least constrained plans and optimal parallel executions is harder than we thought

On the computational complexity of planning and story understanding

Parallel non-binary planning in polynomial time

Planning in polynomial time: the sas-pubs class

Planning with Abstraction Hierarchies can be Exponentially Less Efficient