{"type":"ScholarlyArticle","title":"Optimal Symbolic Planning with Action Costs and Preferences","authors":[{"name":"Stefan Edelkamp","slug":"stefan-edelkamp","given":"Stefan","family":"Edelkamp","affiliation":""},{"name":"Peter Kissmann","slug":"peter-kissmann","given":"Peter","family":"Kissmann","affiliation":""}],"abstract":"This paper studies the solving of finite-domain action planning problems with discrete action costs and soft constraints. For sequential optimal planning, a symbolic perimeter database heuristic is addressed in a bucket implementation of A*. For computing net-benefits, we propose symbolic branch-and-bound search together with some search refinements. The net-benefit we optimize is the total benefit of satisfying the goals, minus the total action cost to achieve them. This results in an objective function to be minimized that is a linear expression over the violation of the preferences added to the action cost total.Stefan Edelkamp, Peter Kissmann","doi":null,"url":"https://ijcai.org/proceedings/2009/282","pdf":"https://ijcai.org/proceedings/2009/0282.pdf","markdown":"https://ijcai.org/proceedings/2009/282.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/282","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":282,"pages":{"first":1690,"last":1694},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}