{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:34:27Z","timestamp":1723016067006},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>Previous work introduced the concept of progress\n\nstates. After expanding a progress state, a greedy\n\nbest-first search (GBFS) will only expand states\n\nwith lower heuristic values. Current methods can\n\nidentify progress states only for a single task and\n\nonly after a solution for the task has been found.\n\nWe introduce a novel approach that learns a description\n\nlogic formula characterizing all progress\n\nstates in a classical planning domain. Using the\n\nlearned formulas in a GBFS to break ties in favor\n\nof progress states often significantly reduces the\n\nsearch effort.<\/jats:p>","DOI":"10.24963\/ijcai.2022\/657","type":"proceedings-article","created":{"date-parts":[[2022,7,16]],"date-time":"2022-07-16T02:55:56Z","timestamp":1657940156000},"page":"4740-4746","source":"Crossref","is-referenced-by-count":0,"title":["Learning and Exploiting Progress States in Greedy Best-First Search"],"prefix":"10.24963","author":[{"given":"Patrick","family":"Ferber","sequence":"first","affiliation":[{"name":"University of Basel, Basel, Switzerland"},{"name":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"}]},{"given":"Liat","family":"Cohen","sequence":"additional","affiliation":[{"name":"University of Basel, Basel, Switzerland"}]},{"given":"Jendrik","family":"Seipp","sequence":"additional","affiliation":[{"name":"Link\u00f6ping University, Link\u00f6ping, Sweden"}]},{"given":"Thomas","family":"Keller","sequence":"additional","affiliation":[{"name":"University of Basel, Basel, Switzerland"},{"name":"University of Zurich, Zurich, Switzerland"}]}],"member":"10584","event":{"number":"31","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2022","name":"Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}","start":{"date-parts":[[2022,7,23]]},"theme":"Artificial Intelligence","location":"Vienna, Austria","end":{"date-parts":[[2022,7,29]]}},"container-title":["Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T11:10:56Z","timestamp":1658142656000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2022\/657"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2022\/657","relation":{},"subject":[],"published":{"date-parts":[[2022,7]]}}}