{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:46:59Z","timestamp":1742989619284,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031475450"},{"type":"electronic","value":"9783031475467"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-47546-7_8","type":"book-chapter","created":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T00:03:15Z","timestamp":1698883395000},"page":"105-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Structure-Sensitive Translation from\u00a0Hybrid to\u00a0Numeric Planning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7332-0636","authenticated-orcid":false,"given":"Francesco","family":"Percassi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2274-875X","authenticated-orcid":false,"given":"Enrico","family":"Scala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8429-3570","authenticated-orcid":false,"given":"Mauro","family":"Vallati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,2]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Alaboud, F.K., Coles, A.: Personalized medication and activity planning in PDDL+. In: Proceedings of ICAPS, pp. 492\u2013500 (2019)","DOI":"10.1609\/icaps.v29i1.3514"},{"key":"8_CR2","unstructured":"Anderson, C.R., Smith, D.E., Weld, D.S.: Conditional effects in graphplan. In: Proceedings of AIPS, pp. 44\u201353. AAAI (1998)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bertolucci, R., Capitanelli, A., Maratea, M., Mastrogiovanni, F., Vallati, M.: Automated planning encodings for the manipulation of articulated objects in 3D with gravity. In: Proceedings of AIxIA 2019, pp. 135\u2013150 (2019)","DOI":"10.1007\/978-3-030-35166-3_10"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bonassi, L., De Giacomo, G., Favorito, M., Fuggitti, F., Gerevini, A.E., Scala, E.: Planning for temporally extended goals in pure-past linear temporal logic. In: Proceedings of ICAPS, vol. 33, pp. 61\u201369 (2023)","DOI":"10.1609\/icaps.v33i1.27179"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bonassi, L., Gerevini, A.E., Scala, E.: Planning with qualitative action-trajectory constraints in PDDL. In: Proceedings of IJCAI, pp. 4606\u20134613 (2022)","DOI":"10.24963\/ijcai.2022\/639"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cardellini, M., Maratea, M., Vallati, M., Boleto, G., Oneto, L.: In-station train dispatching: a PDDL+ planning approach. In: Proceedings of ICAPS, pp. 450\u2013458 (2021)","DOI":"10.1609\/icaps.v31i1.15991"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1007\/s10489-011-0306-z","volume":"36","author":"G Della Penna","year":"2012","unstructured":"Della Penna, G., Magazzeni, D., Mercorio, F.: A universal planning system for hybrid domains. Appl. Intell. 36, 932\u2013959 (2012)","journal-title":"Appl. Intell."},{"key":"8_CR8","unstructured":"Fox, M., Howey, R., Long, D.: Validating plans in the context of processes and exogenous events. In: Proceedings of AAAI, pp. 1151\u20131156 (2005)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M Fox","year":"2003","unstructured":"Fox, M., Long, D.: PDDL2.1: an extension to PDDL for expressing temporal planning domains. JAIR 20, 61\u2013124 (2003)","journal-title":"JAIR"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1613\/jair.2044","volume":"27","author":"M Fox","year":"2006","unstructured":"Fox, M., Long, D.: Modelling mixed discrete-continuous domains for planning. JAIR 27, 235\u2013297 (2006)","journal-title":"JAIR"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Franco, S., Lindsay, A., Vallati, M., McCluskey, T.L.: An innovative heuristic for planning-based urban traffic control. In: Proceedings of ICCS, pp. 181\u2013193 (2018)","DOI":"10.1007\/978-3-319-93698-7_14"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-63912-8_88","volume-title":"Recent Advances in AI Planning","author":"BC Gazen","year":"1997","unstructured":"Gazen, B.C., Knoblock, C.A.: Combining the expressivity of UCPOP with the efficiency of Graphplan. In: Steel, S., Alami, R. (eds.) ECP 1997. LNCS, vol. 1348, pp. 221\u2013233. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63912-8_88"},{"issue":"5\u20136","key":"8_CR13","first-page":"619","volume":"173","author":"A Gerevini","year":"2009","unstructured":"Gerevini, A., Haslum, P., Long, D., Saetti, A., Dimopoulos, Y.: Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. AIJ 173(5\u20136), 619\u2013668 (2009)","journal-title":"AIJ"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp. 278\u2013292 (1996). https:\/\/doi.org\/10.1109\/LICS.1996.561342","DOI":"10.1109\/LICS.1996.561342"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 27(1), 3\u201345 (2019)","journal-title":"Evol. Comput."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Percassi, F., Bhatnagar, S., Guo, R., McCabe, K., McCluskey, L., Vallati, M.: An efficient heuristic for AI-based urban traffic control. In: Proceedings of MT-ITS (2023)","DOI":"10.1109\/MT-ITS56129.2023.10241690"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Percassi, F., Scala, E., Vallati, M.: A sound (but incomplete) polynomial translation from discretised PDDL+ to numeric planning. In: Proceedings of AIxIA 2021 (2021)","DOI":"10.1007\/978-3-031-08421-8_2"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Percassi, F., Scala, E., Vallati, M.: The power of reformulation: from validation to planning in PDDL+. In: Proceedings of ICAPS, vol. 32, pp. 288\u2013296 (2022)","DOI":"10.1609\/icaps.v32i1.19812"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1613\/jair.1.13904","volume":"76","author":"F Percassi","year":"2023","unstructured":"Percassi, F., Scala, E., Vallati, M.: A practical approach to discretised PDDL+ problems by translation to numeric planning. JAIR 76, 115\u2013162 (2023)","journal-title":"JAIR"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Percassi, F., Scala, E., Vallati, M.: Fixing plans for PDDL+ problems: theoretical and practical implications. In: Proceedings of ICAPS, vol. 33, pp. 324\u2013333 (2023)","DOI":"10.1609\/icaps.v33i1.27210"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Piotrowski, W., Sher, Y., Grover, S., Stern, R., Mohan, S.: Heuristic search for physics-based problems: angry birds in PDDL+. In: Proceedings of ICAPS, pp. 518\u2013526 (2023)","DOI":"10.1609\/icaps.v33i1.27232"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Say, B.: Robust metric hybrid planning in stochastic nonlinear domains using mathematical optimization. In: Proceedings of ICAPS, vol. 33, pp. 375\u2013383 (2023)","DOI":"10.1609\/icaps.v33i1.27216"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1613\/jair.1.11875","volume":"68","author":"E Scala","year":"2020","unstructured":"Scala, E., Haslum, P., Thi\u00e9baux, S., Ram\u00edrez, M.: Subgoaling techniques for satisficing and optimal numeric planning. JAIR 68, 691\u2013752 (2020)","journal-title":"JAIR"},{"issue":"1\u20132","key":"8_CR24","first-page":"194","volume":"166","author":"J Shin","year":"2005","unstructured":"Shin, J., Davis, E.: Processes and continuous change in a SAT-based planner. AIJ 166(1\u20132), 194\u2013253 (2005)","journal-title":"AIJ"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Vallati, M., Magazzeni, D., Schutter, B.D., Chrpa, L., McCluskey, T.L.: Efficient macroscopic urban traffic models for reducing congestion: a PDDL+ planning approach. In: Proceedings of AAAI 2016, pp. 3188\u20133194 (2016)","DOI":"10.1609\/aaai.v30i1.10399"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2023 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47546-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T00:11:48Z","timestamp":1698883908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47546-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031475450","9783031475467"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47546-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.aixia2023.cnr.it\/","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.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"33","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":"0","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":"62% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20 external reviewers.","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)"}}]}}