A Novel Algorithm for Action Landmarks Extraction

Jing Jing Zhao; Yong Ming Yang

doi:10.4028/www.scientific.net/AMR.659.97

Paper Titles

Research on Tropical Agricultural Products Quality Recognition and Detection System Based on Electronic Nose Technology
p.75

Research on Cooperative Relay Transmission in Power Line Communication
p.79

Study on LDPC Coded SFH System with Multi-Tone Interference
p.83

The Influence from Drainage System to the Overall Layout of the Residential Building in Village
p.89

A Novel Algorithm for Action Landmarks Extraction
p.97

Classification Algorithm Based on Category Attribute’s Mathematical Expectation
p.103

An Iterative Algorithm on the Spectral Radius of a Kind of Centrosymmetric Matrix
p.108

A Simulation and Prediction Method of the Height of Wheat Based on BP Neural Networks and the Ant Colony Algorithm
p.113

Research on Data Assimilation Methods of Multi-Space-Time Meteroligical and Hydrological Data
p.118

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 659A Novel Algorithm for Action Landmarks Extraction

A Novel Algorithm for Action Landmarks Extraction

Abstract:

In this work, we present a new algorithm for extracting action landmarks from proposition landmarks graph. Compared to published approaches, the action landmarks extraction algorithm we proposed can find more disjunctive action landmarks and single action landmarks. We illustrate our ideas with experiments among benchmark domains. The experiments show that the new algorithm is competitive with traditional algorithm for finding action landmarks from relaxed plan graph.

You might also be interested in these eBooks

Advanced Materials and Computer Science II

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 659)

Pages:

97-102

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.659.97

Citation:

Cite this paper

Online since:

January 2013

Authors:

Jing Jing Zhao, Yong Ming Yang

Keywords:

Action Landmarks, Intelligence Planning, Landmark Graph, Relaxed Planning Graph

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] J. Porteous, L. Sebastia, J. Hoffmann, On the extraction, ordering and usage of landmarks in planning, Proc. of 6th European Conference on Planning. (2001) 37-48.

Google Scholar

[2] D. Cai, J. Hoffmann, M. Helmert, Enhancing the context-enhanced additive heuristic with precedence constraints, Proc. of ICAPS. (2009) 50-57.

DOI: 10.1609/icaps.v19i1.13342

Google Scholar

[3] J. Hoffmann, J. Porteous, S. Cresswell, Ordered landmarks in planning, Journal of Artificial Intelligence Research. 22 (2004) 215-278.

DOI: 10.1613/jair.1492

Google Scholar

[4] M. Helmert, C. Domshlak, Landmarks, critical paths and abstractions: what's the difference anyway, Proc. of ICAPS. (2009) 162-169.

DOI: 10.1609/icaps.v19i1.13370

Google Scholar

[5] S. Richter, M. Westphal, The lama planner: guiding cost-based anytime planning with landmarks, Journal of Artificial Intelligence Research. 39 (2010) 127-177.

DOI: 10.1613/jair.2972

Google Scholar

[6] S. Richter, M. Helmert, M. Westphal, Landmarks revisited, Proc. of 23rd AAAI Conference on Artificial Intelligence. (2008) 975-982.

Google Scholar

[7] E. Keyder, S. Richter, M. Helmert, Sound and complete landmarks for and/or graphs, Proc. 19th European Conference on Artificial Intelligence. (2010) 329-334.

Google Scholar

[8] V. Vidal, H. Geffner, Branching and pruning: an optimal temporal pocl planner based on constraint programming, Artificial Intelligence. 170 (2006) 298-335.

DOI: 10.1016/j.artint.2005.08.004

Google Scholar

[9] E. Karpas, C. Domshlak, Cost-optimal planning with landmarks, Proc. of Twenty-first IJCAI. (2009) 1728-1733.

Google Scholar

[10] M. Helmert, The fast downward planning system, Journal of Artificial Intelligence Research. 26 (2006) 191-246.

DOI: 10.1613/jair.1705

Google Scholar

[11] C. Backstrom, B. Nebel, Complexity results for sas+ planning, Computational Intelligence. 11 (1993) 625-655.

Google Scholar

[12] M. Helmert, Concise finit-domain representations for PDDL planning task, Artificial Intelligence. 173 (2009) 503-535.

DOI: 10.1016/j.artint.2008.10.013

Google Scholar