It is the cache of ${baseHref}. It is a snapshot of the page. The current page could have changed in the meantime.
Tip: To quickly find your search term on this page, press Ctrl+F or ⌘-F (Mac) and use the find bar.

Enhancing Planning Heuristic with Landmarks | Zhao | Journal of Computers
Journal of Computers, Vol 6, No 12 (2011), 2590-2595, Dec 2011
doi:10.4304/jcp.6.12.2590-2595

Enhancing Planning Heuristic with Landmarks

Jingjing Zhao, Dayou Liu, Yongming Yang

Abstract


Recently, landmarks count heuristic can increase the number of problem instances solved and improve the quality of the solutions in satisfying non-optimal planning.  In order to make the heuristic optimal, we give the solution to solve the overestimate of landmarks count heuristic. We extend landmarks count heuristic without action cost assignments, and prove that the extension of heuristic is admissible. Our empirical evaluation shows that the extension of heuristic is admissible and can be competed with the state-of-the-art of heuristic.


Keywords


artificial intelligence;intelligent planning;planning with landmarks;planning heuristic

References


.J. Porteous, L. Sebastia, and J. Hoffmann, “On the extraction, ordering, and usage of landmarks in planning,” in Proc. of European Conference on Planning, Toledo, Spain, 2001, pp.37-48.

.J. Hoffmann, J. Porteous, and S. Cresswell, “Ordered landmarks in planning,” Journal of Artificial Intelligence Research, vol.22, pp.215-278, 2004.

.S. Richter, M. Helmert, and M. Westphal, “Landmarks revisited,” in Proc. of Twenty-Third AAAI Conference on Artificial Intelligence, Chicago, Illinois, July 2008, pp.975-982.

.Dunbo Cai, Jorg Hoffmann, and Malt Helmert, “Enhancing the context-enhanced additive heuristic with precedence constraints,” in Proc. of ICAPS, Thessaloniki, Greece, September 2009, pp.50-57.

.Blai Bonet and Malte Helmert, “Strengthening landmark heuristics via hitting sets,” in Proc. of ECAI, Lisbon, Portugal, August 2010, pp.329-334.

.Malte Helmert and Carmel Domshlak, “Landmarks, critical paths and abstractions: what’s the difference anyway,” in Proc. of ICAPS, Thessaloniki, Greece, September 2009, pp.162-169.

.S. Richter and M. Westphal, “The lama planner: guiding cost-based anytime planning with landmarks,” Journal of Artificial Intelligence Research, 2010, in press.
PMid:20740057    PMCid:2926991

.E. Karpas and C. Domshlak, “Cost-optimal planning with landmarks,” in Proc. of IJCAI, Pasadena, California, USA, July 2009, pp.1728-1733.

.C. Backstrom and B. Nebel, “Complexity results for sas+ planning,” Computational Intelligence, vol.11 (4), pp.625-655, 1993.
http://dx.doi.org/10.1111/j.1467-8640.1995.tb00052.x


Full Text: PDF


Journal of Computers (JCP, ISSN 1796-203X)

Copyright @ 2006-2014 by ACADEMY PUBLISHER – All rights reserved.