{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:53:18Z","timestamp":1743000798991,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030582845"},{"type":"electronic","value":"9783030582852"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58285-2_7","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T09:00:01Z","timestamp":1599728401000},"page":"88-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["HTN Plan Repair via Model Transformation"],"prefix":"10.1007","author":[{"given":"Daniel","family":"H\u00f6ller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Bercher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregor","family":"Behnke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanne","family":"Biundo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,9]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Alford, R., Bercher, P., Aha, D.W.: Tight bounds for HTN planning. In: Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS), pp. 7\u201315. AAAI Press (2015)","DOI":"10.1609\/icaps.v25i1.13721"},{"key":"7_CR2","unstructured":"Alford, R., Bercher, P., Aha, D.W.: Tight bounds for HTN planning with task insertion. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI). pp. 1502\u20131508. AAAI Press (2015)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Alford, R., Shivashankar, V., Kuter, U., Nau, D.S.: HTN problem spaces: structure, algorithms, termination. In: Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS), pp. 2\u20139. AAAI Press (2012)","DOI":"10.1609\/socs.v3i1.18239"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-319-62434-1_30","volume-title":"Advances in Computational Intelligence","author":"R Bart\u00e1k","year":"2017","unstructured":"Bart\u00e1k, R., Vlk, M.: Hierarchical task model for\u00a0resource failure recovery in\u00a0production Scheduling. In: Sidorov, G., Herrera-Alc\u00e1ntara, O. (eds.) MICAI 2016. LNCS (LNAI), vol. 10061, pp. 362\u2013378. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62434-1_30"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Behnke, G., H\u00f6ller, D., Bercher, P., Biundo, S.: Change the plan - how hard can that be? In: Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS), pp. 38\u201346. AAAI Press (2016)","DOI":"10.1609\/icaps.v26i1.13754"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Behnke, G., H\u00f6ller, D., Biundo, S.: On the complexity of HTN plan verification and its implications for plan recognition. In: Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS), pp. 25\u201333. AAAI Press (2015)","DOI":"10.1609\/icaps.v25i1.13728"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Behnke, G., H\u00f6ller, D., Biundo, S.: This is a solution! (...but is it though?) - Verifying solutions of hierarchical planning problems. In: Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS), pp. 20\u201328. AAAI Press (2017)","DOI":"10.1609\/icaps.v27i1.13811"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Bercher, P., Alford, R., H\u00f6ller, D.: A survey on hierarchical planning - one abstract idea, many concrete realizations. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pp. 6267\u20136275. IJCAI Organization (2019)","DOI":"10.24963\/ijcai.2019\/875"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Bercher, P., et al.: Plan, repair, execute, explain - how planning helps to assemble your home theater. In: Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS), pp. 386\u2013394. AAAI Press (2014)","DOI":"10.1609\/icaps.v24i1.13664"},{"key":"7_CR10","series-title":"Cognitive Technologies","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-43665-4_5","volume-title":"Companion Technology","author":"P Bercher","year":"2017","unstructured":"Bercher, P., H\u00f6ller, D., Behnke, G., Biundo, S.: User-centered planning. In: Biundo, S., Wendemuth, A. (eds.) Companion Technology. CT, pp. 79\u2013100. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-43665-4_5"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Bercher, P., Keen, S., Biundo, S.: Hybrid planning heuristics based on task decomposition graphs. In: Proceedings of the 7th Annual Symposium on Combinatorial Search (SoCS), pp. 35\u201343. AAAI Press (2014)","DOI":"10.1609\/socs.v5i1.18323"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-85845-4_21","volume-title":"KI 2008: Advances in Artificial Intelligence","author":"J Bidot","year":"2008","unstructured":"Bidot, J., Schattenberg, B., Biundo, S.: Plan repair in hybrid planning. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS (LNAI), vol. 5243, pp. 169\u2013176. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85845-4_21"},{"issue":"3\u20134","key":"7_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.cogsys.2010.12.005","volume":"12","author":"S Biundo","year":"2011","unstructured":"Biundo, S., Bercher, P., Geier, T., M\u00fcller, F., Schattenberg, B.: Advanced user assistance based on AI planning. Cogn. Syst. Res. 12(3\u20134), 219\u2013236 (2011)","journal-title":"Cogn. Syst. Res."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-46148-5_19","volume-title":"Artificial Intelligence: Methodology, Systems, and Applications","author":"G Boella","year":"2002","unstructured":"Boella, G., Damiano, R.: A replanning algorithm for a reactive agent architecture. In: Scott, D. (ed.) AIMSA 2002. LNCS (LNAI), vol. 2443, pp. 183\u2013192. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46148-5_19"},{"key":"7_CR15","unstructured":"Drabble, B., Dalton, J., Tate, A.: Repairing plans on-the-fly. In: Proceedings of the NASA Workshop on Planning and Scheduling for Space, pp. 13.1\u201313.8 (1997)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Dvor\u0306\u00e1k, F., Bart\u00e1k, R., Bit-Monnot, A., Ingrand, F., Ghallab, M.: Planning and acting with temporal and hierarchical decomposition models. In: Proceedings of the 26th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 115\u2013121. IEEE (2014)","DOI":"10.1109\/ICTAI.2014.27"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF02136175","volume":"18","author":"K Erol","year":"1996","unstructured":"Erol, K., Hendler, J.A., Nau, D.S.: Complexity results for HTN planning. Ann. Math. Artif. Intell. 18(1), 69\u201393 (1996)","journal-title":"Ann. Math. Artif. Intell."},{"key":"7_CR18","unstructured":"Fox, M., Gerevini, A., Long, D., Serina, I.: Plan stability: replanning versus plan repair. In: Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS), pp. 212\u2013221. AAAI Press (2006)"},{"key":"7_CR19","unstructured":"Geier, T., Bercher, P.: On the decidability of HTN planning with task insertion. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), pp. 1955\u20131961. IJCAI\/AAAI (2011)"},{"key":"7_CR20","unstructured":"Gerevini, A., Serina, I.: Fast plan adaptation through planning graphs: local and systematic search techniques. In: Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS), pp. 112\u2013121. AAAI Press (2000)"},{"key":"7_CR21","unstructured":"H\u00f6ller, D., Behnke, G., Bercher, P., Biundo, S.: Language classification of hierarchical planning problems. In: Proceedings of the 21st European Conference on Artificial Intelligence (ECAI), pp. 447\u2013452. IOS Press (2014)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"H\u00f6ller, D., Behnke, G., Bercher, P., Biundo, S.: Assessing the expressivity of planning formalisms through the comparison to formal languages. In: Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS), pp. 158\u2013165. AAAI Press (2016)","DOI":"10.1609\/icaps.v26i1.13758"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"H\u00f6ller, D., Behnke, G., Bercher, P., Biundo, S.: Plan and goal recognition as HTN planning. In: Proceedings of the 30th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp. 466\u2013473. IEEE Computer Society (2018)","DOI":"10.1109\/ICTAI.2018.00078"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"H\u00f6ller, D., Bercher, P., Behnke, G., Biundo, S.: A generic method to guide HTN progression search with classical heuristics. In: Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS). AAAI Press (2018)","DOI":"10.1609\/icaps.v28i1.13900"},{"key":"7_CR25","unstructured":"H\u00f6ller, D., Bercher, P., Behnke, G., Biundo, S.: HTN plan repair using unmodified planning systems. In: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning (HPlan), pp. 26\u201330 (2018)"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1613\/jair.1.11282","volume":"67","author":"D H\u00f6ller","year":"2020","unstructured":"H\u00f6ller, D., Bercher, P., Behnke, G., Biundo, S.: HTN planning as heuristic progression search. J. Artif. Intell. Res. 67, 835\u2013880 (2020)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0004-3702(92)90056-4","volume":"55","author":"S Kambhampati","year":"1992","unstructured":"Kambhampati, S., Hendler, J.A.: A validation-structure-based theory of plan modification and reuse. Artif. Intell. 55, 193\u2013258 (1992)","journal-title":"Artif. Intell."},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1613\/jair.1141","volume":"20","author":"DS Nau","year":"2003","unstructured":"Nau, D.S., et al.: SHOP2: an HTN planning system. J. Artif. Intell. Res. 20, 379\u2013404 (2003)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"7_CR29","first-page":"91","volume":"22","author":"DS Nau","year":"2001","unstructured":"Nau, D.S., Cao, Y., Lotem, A., Mu\u00f1oz-Avila, H.: The SHOP planning system. AI Mag. 22(3), 91\u201394 (2001)","journal-title":"AI Mag."},{"key":"7_CR30","unstructured":"Ram\u00edrez, M., Geffner, H.: Plan recognition as planning. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), pp. 1778\u20131783. AAAI Press (2009)"},{"key":"7_CR31","unstructured":"Warfield, I., Hogg, C., Lee-Urban, S., Mu\u00f1oz-Avila, H.: Adaptation of hierarchical task network plans. In: Proceedings of the 20th International Florida Artificial Intelligence Research Society Conference (FLAIRS), pp. 429\u2013434. AAAI Press (2007)"}],"container-title":["Lecture Notes in Computer Science","KI 2020: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58285-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T17:13:35Z","timestamp":1668705215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58285-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030582845","9783030582852"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58285-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 September 2020","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":"German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bamberg","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ki2020.uni-bamberg.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":"62","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":"12","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":"26% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic KI 2020 was held as a virtual event.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}