{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T23:38:09Z","timestamp":1761176289585,"version":"build-2065373602"},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"value":"9781643686318","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T00:00:00Z","timestamp":1761004800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,21]]},"abstract":"<jats:p>Heuristic search is a prominent method for plan generation in classical planning. Here we address its use for a new problem that we baptize action optimality checking (AOC): checking whether a given action a is optimal in a given state s. AOC has various potential uses, e.g.\u00a0quality assurance for learned action policies through checking example policy decisions. A vanilla algorithm for AOC is to run two A\u22c6 searches, on each of s and the outcome state s\u2032 of applying a. We show that one can do much better than this. We introduce early termination criteria across multiple searches. Beyond this, we introduce AOCA\u22c6, which performs a single search on s that gives preference to paths going through s\u2032. Our experiments show that AOCA\u22c6 is superior to the vanilla algorithm as well as other multiple-search configurations, consistently across three different state-of-the-art heuristic functions.<\/jats:p>","DOI":"10.3233\/faia251381","type":"book-chapter","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T09:59:59Z","timestamp":1761127199000},"source":"Crossref","is-referenced-by-count":0,"title":["Is This a Good Decision? Action Optimality Checking in Classical Planning"],"prefix":"10.3233","author":[{"given":"Jan","family":"Eisenhut","sequence":"first","affiliation":[{"name":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Fi\u0161er","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wheeler","family":"Ruml","sequence":"additional","affiliation":[{"name":"University of New Hampshire, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Hoffmann","sequence":"additional","affiliation":[{"name":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"},{"name":"German Research Center for Artificial Intelligence (DFKI), Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2025"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA251381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T09:59:59Z","timestamp":1761127199000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA251381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,21]]},"ISBN":["9781643686318"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia251381","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,21]]}}}