{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:25Z","timestamp":1740099505722,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030301781"},{"type":"electronic","value":"9783030301798"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30179-8_10","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T23:03:18Z","timestamp":1567983798000},"page":"123-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Empirical Study of the Usefulness of State-Dependent Action Costs in Planning"],"prefix":"10.1007","author":[{"given":"Sumitra","family":"Corraya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1760-560X","authenticated-orcid":false,"given":"Florian","family":"Gei\u00dfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5493-7363","authenticated-orcid":false,"given":"David","family":"Speck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1705-5476","authenticated-orcid":false,"given":"Robert","family":"Mattm\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,24]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/10720246_28","volume-title":"Recent Advances in AI Planning","author":"B Bonet","year":"2000","unstructured":"Bonet, B., Geffner, H.: Planning as heuristic search: new results. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS (LNAI), vol. 1809, pp. 360\u2013372. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10720246_28"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-36126-X_16","volume-title":"Formal Methods in Computer-Aided Design","author":"Gianfranco Ciardo","year":"2002","unstructured":"Ciardo, G., Siminiceanu, R.: Using edge-valued decision diagrams for symbolic generation of shortest paths. In: Proceedings of the Fourth International Conference on Formal Methods in Computer-Aided Design (FMCAD), pp. 256\u2013273 (2002)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Fan, G., M\u00fcller, M., Holte, R.: Additive merge-and-shrink heuristics for diverse action costs. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI), pp. 4287\u20134293 (2017)","DOI":"10.24963\/ijcai.2017\/599"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Fan, G., M\u00fcller, M., Holte, R.: The two-edged nature of diverse action costs. In: Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS), pp. 98\u2013106 (2017)","DOI":"10.1609\/icaps.v27i1.13804"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Geffner, H., Bonet, B.: A Concise Introduction to Models and Methods for Automated Planning. Morgan & Claypool Publishers, San Rafael (2013)","DOI":"10.2200\/S00513ED1V01Y201306AIM022"},{"key":"10_CR6","unstructured":"Gei\u00dfer, F.: On planning with state-dependent action costs. Ph.D. dissertation, Albert-Ludwigs-Universit\u00e4t Freiburg (2018)"},{"key":"10_CR7","unstructured":"Gei\u00dfer, F., Keller, T., Mattm\u00fcller, R.: Delete relaxations for planning with state-dependent action costs. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1573\u20131579 (2015)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Gei\u00dfer, F., Keller, T., Mattm\u00fcller, R.: Abstractions for planning with state-dependent action costs. In: Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS), pp. 140\u2013148 (2016)","DOI":"10.1609\/icaps.v26i1.13742"},{"key":"10_CR9","unstructured":"Haslum, P., Botea, A., Helmert, M., Bonet, B., Koenig, S.: Domain-independent construction of pattern database heuristics for cost-optimal planning. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence, pp. 1007\u20131012 (2007)"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1613\/jair.1705","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert, M.: The fast downward planning system. J. Artif. Intell. Res. 26, 191\u2013246 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Helmert, M., Domshlak, C.: Landmarks, critical paths and abstractions: what\u2019s the difference anyway? In: Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS) (2009)","DOI":"10.1609\/icaps.v19i1.13370"},{"key":"10_CR12","unstructured":"Helmert, M., Haslum, P., Hoffmann, J.: Flexible abstraction heuristics for optimal sequential planning. In: Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS), pp. 176\u2013183 (2007)"},{"key":"10_CR13","unstructured":"Helmert, M., R\u00f6ger, G.: How good is almost perfect? In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 944\u2013949 (2008)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Ivankovic, F., Haslum, P., Gordon, D.: Planning with global state constraints and state-dependent action costs. In: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS) (2019)","DOI":"10.1609\/icaps.v29i1.3481"},{"key":"10_CR15","unstructured":"Keller, T., Pommerening, F., Seipp, J., Gei\u00dfer, F., Mattm\u00fcller, R.: State-dependent cost partitionings for Cartesian abstractions in classical planning. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI), pp. 3161\u20133169 (2016)"},{"key":"10_CR16","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Longman, Boston (1984)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Speck, D., Gei\u00dfer, F., Mattm\u00fcller, R.: Symbolic planning with edge-valued multi-valued decision diagrams. In: Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS), pp. 250\u2013258 (2018)","DOI":"10.1609\/icaps.v28i1.13890"},{"key":"10_CR18","unstructured":"Speck, D., Gei\u00dfer, F., Mattm\u00fcller, R.: SYMPLE: symbolic planning based on EVMDDs. In: Ninth International Planning Competition (IPC-9): Planner Abstracts, pp. 91\u201394 (2018)"}],"container-title":["Lecture Notes in Computer Science","KI 2019: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30179-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T00:27:48Z","timestamp":1695169668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30179-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030301781","9783030301798"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30179-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kassel","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ki2019.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}