{"type":"ScholarlyArticle","title":"Best-First Utility-Guided Search","authors":[{"name":"Wheeler Ruml","slug":"wheeler-ruml","given":"Wheeler","family":"Ruml","affiliation":""},{"name":"Minh Binh Do","slug":"minh-binh-do","given":"Minh Binh","family":"Do","affiliation":""}],"abstract":"In many shortest-path problems of practical interest, insufficient time is available to find a provably optimal solution. One can only hope to achieve a balance between search time and solution cost that respects the user's preferences, expressed as a utility function over time and cost. Current state-of-the-art approaches to this problem rely on anytime algorithms such as Anytime A* or ARA*. These algorithms require the use of extensive training data to compute a termination policy that respects the user's utility function. We propose a more direct approach, called Bugsy, that incorporates the utility function directly into the search, obviating the need for a separate termination policy. Experiments in several challenging problem domains, including sequence alignment and temporal planning, demonstrate that this direct approach can surpass anytime algorithms without requiring expensive performance profiling.","doi":null,"url":"https://ijcai.org/proceedings/2007/383","pdf":"https://ijcai.org/proceedings/2007/0383.pdf","markdown":"https://ijcai.org/proceedings/2007/383.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/383","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":383,"pages":{"first":2378,"last":2383},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}