Tunable Suboptimal Heuristic Search

Finding optimal solutions to state-space search problems often takes too long, even when using A* with a heuristic function. Instead, practitioners often use a tunable approach, such as weighted A*, that allows them to adjust a trade-off between search time and solution cost until the search is sufficiently fast for the intended application. In this paper, we study algorithms for this problem setting, which we call `tunable suboptimal search

Authors

• Stephen Wissow
• Fanhao Yu
• Wheeler Ruml

Keywords

No keywords are indexed for this paper.