Computer Science – Artificial Intelligence
Scientific paper
2011-10-31
Journal Of Artificial Intelligence Research, Volume 31, pages 217-257, 2008
Computer Science
Artificial Intelligence
Scientific paper
10.1613/jair.2443
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes correspond to the state variable values and the network arcs correspond to the value transitions. The planning problem is to find a path (a sequence of actions) in each network such that, when merged, they constitute a feasible plan. In this paper we present a number of integer programming formulations that model these loosely coupled networks with varying degrees of flexibility. Since merging may introduce exponentially many ordering constraints we implement a so-called branch-and-cut algorithm, in which these constraints are dynamically generated and added to the formulation when needed. Our results are very promising, they improve upon previous planning as integer programming approaches and lay the foundation for integer programming approaches for cost optimal planning.
den Briel Menkes Hector Louis van
Kambhampati Subbarao
Vossen Thomas
No associations
LandOfFree
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-466776