S. Wolfman and D. Weld. Combining linear programming and satisfiability solving for resource planning. Knowledge Engineering Review, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....techniques to improve performance. McDermott [17] suggests extending regression planners using progression techniques; however, we are not aware of any implementation of this idea. An extension of classic planning is planning with resources. Most existing resource planners (e.g. RIFO [14] LPSAT [25], ILP PLAN [12] limit themselves to linear expressions in preconditions and effects. Zeno [20] can accept more complicated expressions, but delays their processing until variable bindings linearize the expressions. AI planners are thus capable of solving a very broad class of problems, including ....

S. Wolfman and D. Weld. Combining linear programming and satisfiability solving for resource planning. Knowledge Engineering Review, 2000.

....di#erent techniques, and each has a unique framework for approaching problems. It is only recently that there have been attempts to build algorithms integrating techniques from both fields. A unifyng framework for understanding the connections between methods combined with new hybrid approaches [24, 36] will provide better solutions to di#cult problems. Our goal in this paper is to examine the relative strengths and weaknesses of AI and OR approaches to solving propositional satisfiability problems (SAT) As we will see, the two approaches have di#erent strengths and weakness. We discuss these ....

S. A. Wolfman and D. S. Weld. Combining linear programming and satisfiability solving for resource planning. Knowledge Engineering Review, this issue. 22

....action representation has influences on the representation of the plans and on the planning algorithm. In this section, we will discuss the action representation used in Sapa. Our representation is influenced by the PDDL language proposal[4] and the representations used in Zeno[14] and LPSAT[19] planners. Unlike actions in classical planning, in planning problems with temporal and resource constraints, actions are not instantaneous but have durations. Their preconditions may either be instantaneous or durative and their effects may occur at any time point during their execution. Each ....

....Table 3: Number of actions and duration (makespan) of the solutions generated by Sapa in the zeno flying and logistics domains with sum action and sum duration heuristics with without resource adjustment technique. Ady mention that their solutions are still better than the ones returned by LPSAT[19], which makes our solutions that much more impressive compared to LPSAT. The pure sum action heuristic without resource adjustment normally outputs plans with slightly higher number of actions, and longer makespans than the sum duration heuristic. In some cases, the sum action heuristic guides ....

[Article contains additional citation context not shown here]

Wolfman, S. and Weld, D. 1999. Combining Linear Programming and Satisfiability Solving for Resource Planning. Proc IJCAI-99 14

....work so far (CPLEX and WSAT(OIP) require all constraints to take the form of linear inequalities, recent work on mixed logical linear programming (Hooker Osorio 1999) may provide the underpinnings for systems that more efficiently handle ILPs that have a large logical component. In this vein (Wolfman Weld 2000) have recently developed an IP encoding for plans with resource constraints that separates the logical (integer) constraints from the linear resource constraints. This encoding allows them to take advantage of a specialized search engine called LPSAT that combines the Davis Putnam SAT procedure ....

Wolfman, S. A., and Weld, D. S. 2000. Combining linear programming and satisfiability solving for resource planning. Knowledge Engineering Review (this issue).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC