{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:45:01Z","timestamp":1725486301689},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441274"},{"type":"electronic","value":"9783540461487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46148-5_7","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:31:45Z","timestamp":1181183505000},"page":"61-70","source":"Crossref","is-referenced-by-count":2,"title":["A Heuristic for Planning Based on Action Evaluation"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Vrakas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Vlahavas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Blum, L., and Furst M., Fast planning through planning graph analysis, In Proceedings of the 14th Int. Joint Conference on Artificial Intelligence, 636\u2013642. Montreal, Canada. (1995)","DOI":"10.21236\/ADA303260"},{"key":"7_CR2","unstructured":"Bonet, B. and Geffner, H. Planning as Heuristic Search: New Results, In Proceedings of the 5th European Conference on Artificial Intelligence. Durham UK. (1999)"},{"key":"7_CR3","unstructured":"Bonet, B., Loerincs, G., and Geffner, H., A robust and fast action selection mechanism for planning, In Proceedings of the 14th Int. Conference of the American Association of Artificial Intelligence (AAAI-97), 714\u2013719. Providence, Rhode Island. (1997)"},{"key":"7_CR4","unstructured":"Fox, M. and Long, D., Hybrid STAN: Identifying and Managing Combinatorial Subproblems in Planning. In Proceedings of 19th UK Planning and Scheduling SIG Workshop, (2000)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Hoffmann, J. A Heuristic for Domain Independent Planning and its Use in an Enforced Hillclimbing Algorithm, In Proceedings of the 12th Int. Symposium on Methodologies for intelligent Systems. (2000)","DOI":"10.1007\/3-540-39963-1_23"},{"key":"7_CR6","unstructured":"Kautz, H. and Selman, B., Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In Proceedings of the Thirteen National Conference on Artificial Intelligence (AAAI-96). Portland, Oregon, USA. (1996)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Koehler, J. and Hoffmann, J. On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm, Journal of Artiicial Intelligence Research 12. (2000)","DOI":"10.1613\/jair.715"},{"key":"7_CR8","first-page":"36","volume-title":"CRC Handbook of Algorithms and Theory of Computation","author":"R. Korf","year":"1998","unstructured":"Korf, R. Artificial intelligence search algorithms, CRC Handbook of Algorithms and Theory of Computation, Atallah, M. J. (Ed.), CRC Press, Boca Raton, FL, pp. 36\u20131 to 36-20. (1998)"},{"key":"7_CR9","first-page":"87","volume":"10","author":"D. Long","year":"1998","unstructured":"Long, D. and Fox, M. Efficient Implementation of the Plan Graph in STAN, JAIR, 10, pp. 87\u2013115. (1998)","journal-title":"Efficient Implementation of the Plan Graph in STAN, JAIR"},{"key":"7_CR10","unstructured":"McDermott, D. A Heuristic Estimator for Means-End Analysis in Planning, In Proceedings, AIPS (1996)"},{"key":"7_CR11","unstructured":"Nguyen, X., Kambhampati, S. and Nigenda, R. AltAlt: Combining the advantages of Graphplan and Heuristics State Search, In Proceedings, International Conference on Knowledge-based Computer Systems, Bombay, India. (2000)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Refanidis, I., and Vlahavas, I., GRT: A Domain Independent Heuristic for STRIPS Worlds based on Greedy Regression Tables, In Proceedings, 5 th European Conference on Planning, Durham, UK, pp. 346\u2013358. (1999)","DOI":"10.1007\/10720246_27"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1613\/jair.893","volume":"15","author":"I. Refanidis","year":"2000","unstructured":"Refanidis, I. and Vlahavas, I., The GRT Planner: Backward Heuristic Construction in Forward State-Space Planning, Journal of Artificial Intelligence Research 15:115\u2013161. (2000)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"7_CR14","unstructured":"Selman, B., Levesque, H. and Mitchell, D., A New Method for solving Hard Stisfiability Problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), 440\u2013446. San Jose, California, USA. (1992)"},{"key":"7_CR15","unstructured":"Vrakas, D. and Vlahavas, I. Combining Progression and Regression in State-Space Heuristic Planning, In Pre-Proceedings of the 6 th European Conference on Planning, 1\u201312. Toledo, Spain. (2001)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence: Methodology, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46148-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T07:21:19Z","timestamp":1683876079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46148-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441274","9783540461487"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46148-5_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}