JOURNAL BROWSE
Search
Advanced SearchSearch Tips
A Action-based Heuristics for Effective Planning
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A Action-based Heuristics for Effective Planning
Kim, Hyun-Sik;
  PDF(new window)
 Abstract
More informative ones of heuristics can help to conduct search more efficiently to obtain solution plan. However, in general, to derive highly informative heuristics from problem specifications requires lots of computational effort. To address this problem, we propose an State-Action based Planning Graph(SAPG) and Action-based heuristics for solving planning problems more efficiently. The SAPG is an extended one to be applied to can find interactions between subgoal & goal conditions from the relaxed planning graph which is a common means to get heuristics for solving the planning problems, Action-based heuristics utilizing SAPG graphs can find interactions between subgoal & goal conditions in an effective way, and then consider them to estimate the goal distance. Therefore Action-based heuristics have more information than the existing max and additive heuristics, also requires less computational effort than the existing overlap heuristics. In this pager. we present the algorithm to compute Action-based heuristics, and then explain empirical analysis to investigate the accuracy and the efficiency of the Action-based heuristics.
 Keywords
Classical Planning;Delete Relaxation;Planning Graph;Search Heuristic;Supporting Actions;
 Language
Korean
 Cited by
 References
1.
D. Bryce and S. kambhampati, "A Tutorial on Planning Graph-Based Reachability Heuristics", AI Magazine, vol.28, no.1, pp.47-83, 2006. DOI: http://dx.doi.org/10.1609/aimag.v28i1.2028

2.
D. Cai, M. Yin and J. Wang, "Improving Relaxed Plan-Based Heuristics via Simulated Execution of Relaxed-Plans", ICAPS, 2009.

3.
B. Bonet and H. Geffner, "Planing as Heuristic Search", Artificial Intelligence, pp.5-33, 2001. DOI: http://dx.doi.org/10.1016/S0004-3702(01)00108-4 crossref(new window)

4.
J. Hoffmann and B. Nebel, "The FF Planning System: Fast Plan Generation through Heuristic Search", Journal of AI Research, vol.14, pp.253-302, 2001. DOI: http://dx.doi.org/10.1613/jair.855

5.
P. Haslum and H. Geffner, "Admissible Heuristics for Optimal Planning", AIPS2000, pp140-149, 2000.

6.
S. Russell and P. Norving, Artificial Intelligence: A Modern Approach, 3nd Edition, PearsonEducation, 2010.

7.
E. Keyder and H. Geffner, "Set-Additive ad TSP heuristics for planning with action costs and soft goals", ICAPS, 2007.

8.
A. Blum and M.Furst, "Fast Planning through Planning through Planning Graph Analysis", IJCAI, 1995. DOI: http://dx.doi.org/10.1016/S0004-3702(96)00047-1

9.
Rosslin John Robles, Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data, Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology, Vol.3 No.1, June (2013), pp.17-24, DOI: http://dx.doi.org/10.14257/AJMAHS.2013.06.01 crossref(new window)

10.
Yvette E. Gelogo, Haeng-Kon Kim, Enterprise Resource Planning System Deployment on Mobile Cloud Computing, Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology, Vol.3 No.1, June (2013), pp.1-8, DOI: http://dx.doi.org/10.14257/AJMAHS.2013.06.02 crossref(new window)

11.
S.-U. Lee, "Travelling Salesman Problem Based on Area Division and Connection Method," The Journal of The Institute of Internet, Broadcasting and Communication (IIBC), Vol. 15, No. 3, pp. 211-218, 2015. DOI: http://dx.doi.org/10.7236/JIIBC.2015.15.3.211

12.
J.-Y. Chang, "Efficient Retrieval of Short Opinion Documents Using Learning to Rank," The Journal of The Institute of Internet, Broadcasting and Communication, VOL. 13 No. 4, pp. 117-126, 2013. DOI: http://dx.doi.org/10.7236/JIIBC.2013.13.4.117 crossref(new window)

13.
K.-Y. Lee, I.-H. Seo, M.-J. Lim, K.-H. Kim, J.-L. Kim, "Design and Implementation of a Efficient Search Engine Using Collaborative Filtering," The Journal of The Institute of Webcasting, Internet and Telecommunication, VOL. 12 No. 3, pp. 23-28, 2012. DOI: http://dx.doi.org/10.7236/JIWIT.2012.12.3.23

14.
Y.-M. Kwon, I.-R. Lee, M.-G. Kim, "A Study on Clustering of SNS SPAM using Heuristic Method," The Journal of The Institute of Internet, Broadcasting and Communication (IIBC), Vol. 14, No. 6, pp.7-12, Dec. 31, 2014. DOI: http://dx.doi.org/10.7236/JIIBC.2014.14.6.7

15.
S.-U. Lee, M.-B. Choi, "Simple Solution for Multi-commodity Transportation Problem," The Journal of The Institute of Internet, Broadcasting and Communication, VOl. 13, No. 5, Oct. 2013. DOI: http://dx.doi.org/10.7236/JIIBC.2013.13.5.173