Landmark heuristics for the pancake problem

Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

Volumn , Issue , 2010, Pages 109-110

  Helmert, Malte ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PANCAKE PROBLEMS; PLANNING PROBLEM;

EID: 79957869350     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Dweighter, H. 1975. Elementary problem E2569. The American Mathematical Monthly 82(10):1010.
2. Gates, W. H., and Papadimitriou, C. H. 1979. Bounds for sorting by prefix reversal. Discrete Math 27:47-57.
3. Helmert, M., and Domshlak, C. 2009. Landmarks, critical paths and abstractions: What's the difference anyway? In Proc. ICAPS 2009, 162-169.
4. Heydari, M. H., and Sudborough, I. H. 1997. On the diameter of the pancake network. Journal of Algorithms 25(1):67-94.
5. Karpas, E., and Domshlak, C. 2009. Cost-optimal planning with landmarks. In Proc. IJCAI 2009, 1728-1733.
6. Richter, S.; Helmert, M.; and Westphal, M. 2008. Landmarks revisited. In Proc. AAAI 2008, 975-982.
7. Yang, F.; Culberson, J.; Holte, R.; Zahavi, U.; and Felner, A. 2008. A general theory of additive state space abstractions. JAIR 32:631-662.
8. Zahavi, U.; Felner, A.; Holte, R. C.; and Schaeffer, J. 2008. Duality in permutation state spaces and the dual search algorithm. AIJ 172(4-5):514-540.