{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:39:15Z","timestamp":1723016355810},"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":[[2018,7]]},"abstract":"<jats:p>This paper studies an effect-abstraction based relaxation\n\n  for reasoning about linear numeric planning problems. The effect-abstraction\n\n  decomposes non-constant linear numeric effects into actions with conditional\n\n  effects over additive constant numeric effects. With little effort, on this\n\n  compiled version, it is possible to use known subgoaling based relaxations\n\n  and relative heuristics. The combination of these two steps leads to a novel\n\n  relaxation based heuristic. Theoretically, the relaxation is proved tighter\n\n  than previous interval based relaxation and leading to safe-pruning\n\n  heuristics. Empirically, a heuristic developed on this relaxation leads to\n\n  substantial improvements for a class of  problems that are currently out of\n\n  the reach of state-of-the-art numeric planners.<\/jats:p>","DOI":"10.24963\/ijcai.2018\/665","type":"proceedings-article","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T01:49:10Z","timestamp":1530755350000},"page":"4787-4793","source":"Crossref","is-referenced-by-count":2,"title":["Effect-Abstraction Based Relaxation for Linear Numeric Planning"],"prefix":"10.24963","author":[{"given":"Dongxu","family":"Li","sequence":"first","affiliation":[{"name":"Australian National University"}]},{"given":"Enrico","family":"Scala","sequence":"additional","affiliation":[{"name":"Fondazione Bruno Kessler"}]},{"given":"Patrik","family":"Haslum","sequence":"additional","affiliation":[{"name":"Australian National University"},{"name":"Data61"}]},{"given":"Sergiy","family":"Bogomolov","sequence":"additional","affiliation":[{"name":"Australian National University"}]}],"member":"10584","event":{"number":"27","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2018","name":"Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}","start":{"date-parts":[[2018,7,13]]},"theme":"Artificial Intelligence","location":"Stockholm, Sweden","end":{"date-parts":[[2018,7,19]]}},"container-title":["Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T01:55:04Z","timestamp":1530755704000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2018\/665"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2018\/665","relation":{},"subject":[],"published":{"date-parts":[[2018,7]]}}}