{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:14:33Z","timestamp":1740287673538,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142635"},{"type":"electronic","value":"9783642142642"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14264-2_21","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T05:34:28Z","timestamp":1278308068000},"page":"201-211","source":"Crossref","is-referenced-by-count":3,"title":["A Look-Ahead B&B Search for Cost-Based Planning"],"prefix":"10.1007","author":[{"given":"Raquel","family":"Fuentetaja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Borrajo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos Linares","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Benton, J., van den Briel, M., Kambhampati, S.: A hibrid linear programming and relaxed plan heuristic for partial satisfaction planning problems. In: Proc. of the 17th ICAPS, pp. 34\u201341 (2007)"},{"issue":"1","key":"21_CR2","first-page":"47","volume":"28","author":"D. Bryce","year":"2007","unstructured":"Bryce, D., Kambhampati, S.: How to skin a planning graph for fun and profit: A tutorial on planning graph based reachability heuristics. AI Magazine\u00a028(1), 47\u201383 (2007)","journal-title":"AI Magazine"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.1918","volume":"26","author":"Y. Chen","year":"2006","unstructured":"Chen, Y., Hsu, C., Wah, B.: Temporal planning using subgoal partitioning and resolution in SGPlan. JAIR\u00a026, 323\u2013369 (2006)","journal-title":"JAIR"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1613\/jair.1156","volume":"20","author":"M.B. Do","year":"2003","unstructured":"Do, M.B., Kambhampati, S.: Sapa: A scalable multi-objective heuristic metric temporal planner. JAIR\u00a020, 155\u2013194 (2003)","journal-title":"JAIR"},{"key":"21_CR5","unstructured":"Gerevini, A., Saetti, A., Serina, I.: Planning with numerical expressions in LPG. In: Proc. of the 16th ECAI, pp. 667\u2013671 (2004)"},{"key":"21_CR6","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 \u201cignoring delete lists\u201d to numeric state variables. JAIR\u00a020, 291\u2013341 (2003)","journal-title":"JAIR"},{"key":"21_CR7","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. JAIR\u00a014, 253\u2013302 (2001)","journal-title":"JAIR"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Keyder, E., Geffner, H.: Heuristics for planning with action costs revisited. In: Proc. of the 18th ECAI (2008)","DOI":"10.3233\/978-1-58603-891-5-588"},{"key":"21_CR9","unstructured":"Richter, S., Helmert, M., Westphal, M.: Landmarks revisited. In: Proc. of the 23rd AAAI, pp. 975\u2013982 (2008)"},{"key":"21_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","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., Onaind\u00eda, 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":"21_CR11","unstructured":"Vidal, V.: A lookahead strategy for heuristic search planning. In: Proc. of the 14th ICAPS, pp. 150\u2013159 (2004)"}],"container-title":["Lecture Notes in Computer Science","Current Topics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14264-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:21:08Z","timestamp":1740241268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14264-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142635","9783642142642"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14264-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}