{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:49:50Z","timestamp":1725493790885},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752707"},{"type":"electronic","value":"9783540752714"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75271-4_15","type":"book-chapter","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T09:16:25Z","timestamp":1193649385000},"page":"140-149","source":"Crossref","is-referenced-by-count":1,"title":["Heuristics for Planning with Action Costs"],"prefix":"10.1007","author":[{"given":"Emil","family":"Keyder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hector","family":"Geffner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","volume":"129","author":"B. Bonet","year":"2001","unstructured":"Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence\u00a0129(1-2), 5\u201333 (2001)","journal-title":"Artificial Intelligence"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research\u00a014, 253\u2013302 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"15_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/978-3-540-30498-2_12","volume-title":"Advances in Artificial Intelligence \u2013 IBERAMIA 2004","author":"O. Sapena","year":"2004","unstructured":"Sapena, O., Onaindia, E.: Handling numeric criteria in relaxed planning graphs. In: Lema\u00eetre, C., Reyes, C.A., Gonz\u00e1lez, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol.\u00a03315, pp. 114\u2013123. Springer, Heidelberg (2004)"},{"key":"15_CR4","unstructured":"Fuentetaja, R., Borrajo, D., Linares, C.: Improving relaxed planning graph heuristics for metric optimization. In: Proc. 2006 AAAI Workshop on Heuristic Search, Memory Based Heuristics and its Applications, pp. 79\u201386 (2006)"},{"key":"15_CR5","first-page":"1636","volume-title":"Proceedings of IJCAI 1995","author":"A. Blum","year":"1995","unstructured":"Blum, A., Furst, M.: Fast planning through planning graph analysis. In: Proceedings of IJCAI 1995, pp. 1636\u20131642. Morgan Kaufmann, San Francisco (1995)"},{"key":"15_CR6","unstructured":"Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. In: AIPS-2000. Proc. of the Fifth International Conference on AI Planning Systems, pp. 70\u201382 (2000)"},{"key":"15_CR7","first-page":"714","volume-title":"Proceedings of AAAI 1997","author":"B. Bonet","year":"1997","unstructured":"Bonet, B., Loerincs, G., Geffner, H.: A robust and fast action selection mechanism for planning. In: Proceedings of AAAI 1997, pp. 714\u2013719. MIT Press, Cambridge (1997)"},{"key":"15_CR8","unstructured":"Do, M.B., Kambhampati, S.: Sapa: A domain-independent heuristic metric temporal planner. In: Proc. ECP 2001, pp. 82\u201391 (2001)"},{"key":"15_CR9","unstructured":"Smith, D.E.: Choosing objectives in over-subscription planning. In: Proc. ICAPS 2004, pp. 393\u2013401 (2004)"},{"key":"15_CR10","volume-title":"Linear Network Optimization: Algorithms and Codes","author":"D. Bertsekas","year":"1991","unstructured":"Bertsekas, D.: Linear Network Optimization: Algorithms and Codes. MIT Press, Cambridge (1991)"},{"key":"15_CR11","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1989","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1989)"},{"key":"15_CR12","unstructured":"Liu, Y., Koenig, S., Furcy, D.: Speeding up the calculation of heuristics for heuristic search-based planning. In: Proc AAAI 2002, pp. 484\u2013491 (2002)"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1305\/ndjfl\/1093634995","volume":"30","author":"W.D. Blizard","year":"1988","unstructured":"Blizard, W.D.: Multiset theory. Notre Dame J. Formal Logic\u00a030(1), 36\u201366 (1988)","journal-title":"Notre Dame J. Formal Logic"},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1613\/jair.1144","volume":"20","author":"J. Hoffmann","year":"2003","unstructured":"Hoffmann, J.: The metric-ff planning system: Translating \u201dignoring delete lists\u201d to numeric state variables. J. Artif. Intell. Res (JAIR)\u00a020, 291\u2013341 (2003)","journal-title":"J. Artif. Intell. Res. (JAIR)"}],"container-title":["Lecture Notes in Computer Science","Current Topics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75271-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:57:51Z","timestamp":1619521071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75271-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540752707","9783540752714"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75271-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}