Recent work on planning in incomplete domains focuses on constructing plans that succeed despite incomplete knowledge of action preconditions and effects. As planning models becom...
Temporally expressive planning, an important class of temporal planning, has attracted much attention lately. Temporally expressive planning is difficult; few existing planners ca...
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
This paper discusses the specifics of planning in multiagent environments. It presents the formal framework MAPL (“maple”) for describing multiagent planning domains. MAPL al...
We present a hill-climbing algorithm to solve planning problems with temporal uncertainty. First an optimistic plan that is valid when all actions complete quickly is found. Then ...