One approach to optimal planning is to first start with a sub- optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an...
Despite the fact that thousands of applications manipulate plans, there has been no work to date on managing large databases of plans. In this paper, we first propose a formal mod...
Fusun Yaman, Sibel Adali, Dana S. Nau, Maria Luisa...
We present an argumentation-based formalism that an agent could use for constructing plans. We will analyze the interaction of arguments and actions when they are combined to cons...
Researchers have developed a huge number of algorithms to solve classical planning problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic soluti...
Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P...
The majority of planning and scheduling research has focused on batch-oriented models of planning. This paper discusses the use of iterative repair techniques to support a continu...
Steve A. Chien, Russell Knight, Andre Stechert, Ro...