Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par tially ordered plan is an operator precondition that is not yet achieved; operators,...
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
This paper discusses the specifics of planning in multiagent environments. It presents the formal framework MAPL (“maple”) for describing multiagent planning domains. MAPL al...