On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning

@article{Imai2015OnAP,
  title={On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning},
  author={Tatsuya Imai and Alex S. Fukunaga},
  journal={J. Artif. Intell. Res.},
  year={2015},
  volume={54},
  pages={631-677}
}
We propose a new integer-linear programming model for the delete relaxation in cost-optimal planning. While a straightforward IP for the delete relaxation is impractical, our enhanced model incorporates variable reduction techniques based on landmarks, relevance-based constraints, dominated action elimination, immediate action application, and inverse action constraints, resulting in an IP that can be used to directly solve delete-free planning problems. We show that our IP model is competitive… CONTINUE READING
2 Extracted Citations
44 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 44 references

Advancing Planning-as-Satisfiability

  • N. Robinson
  • Ph.D. thesis,
  • 2012
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…