{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T03:42:09Z","timestamp":1758080529419,"version":"3.44.0"},"reference-count":0,"publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ICAPS"],"abstract":"<jats:p>In classical planning, admissible potential heuristics are computed by solving linear programs (LPs) with constraints expressing consistency and goal-awareness of the heuristic. Potential heuristics can return negative estimates. So, given a potential heuristic h^P, the actual heuristic used in search is another heuristic defined as h^P_0+(s) = max(h^P(s),0) for every reachable state s. In this paper, we reformulate the LP constraints for consistency of h^P so that they ensure consistency of h^P_0+ instead. This leads to more informative heuristics with positive impact on the overall performance in exchange for a more time and memory demanding computation using mixed integer linear programs instead of LPs.<\/jats:p>","DOI":"10.1609\/icaps.v35i1.36121","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T22:30:35Z","timestamp":1758061835000},"page":"218-222","source":"Crossref","is-referenced-by-count":0,"title":["Potential Heuristics: Weakening Consistency Constraints"],"prefix":"10.1609","volume":"35","author":[{"given":"Pascal","family":"Lauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Fi\u0161er","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9382","published-online":{"date-parts":[[2025,9,16]]},"container-title":["Proceedings of the International Conference on Automated Planning and Scheduling"],"original-title":[],"link":[{"URL":"https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/download\/36121\/38275","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/download\/36121\/38275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T22:30:36Z","timestamp":1758061836000},"score":1,"resource":{"primary":{"URL":"https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/view\/36121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,9,16]]}},"URL":"https:\/\/doi.org\/10.1609\/icaps.v35i1.36121","relation":{},"ISSN":["2334-0843","2334-0835"],"issn-type":[{"value":"2334-0843","type":"electronic"},{"value":"2334-0835","type":"print"}],"subject":[],"published":{"date-parts":[[2025,9,16]]}}}