Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics

Authors

  • Venkatraman Narayanan Carnegie Mellon University
  • Sandip Aine Indraprastha Institute of Information Technology, Delhi
  • Maxim Likhachev Carnegie Mellon University

DOI:

https://doi.org/10.1609/socs.v6i1.18350

Keywords:

Multi-Heuristic Search, Uncalibrated Inadmissible Heuristics

Abstract

Recently, several researchers have brought forth the benefits of searching with multiple (and possibly inadmissible) heuristics, arguing how different heuristics could be independently useful in different parts of the state space. However, algorithms that use inadmissible heuristics in the traditional best-first sense, such as the recently developed Multi-Heuristic A* (MHA*), are subject to a crippling calibration problem: they prioritize nodes for expansion by additively combining the cost-to-come and the inadmissible heuristics even if those heuristics have no connection with the cost-to-go (e.g., the heuristics are uncalibrated) . For instance, if the inadmissible heuristic were an order of magnitude greater than the perfect heuristic, an algorithm like MHA* would simply reduce to a weighted A* search with one consistent heuristic. In this work, we introduce a general multi-heuristic search framework that solves the calibration problem and as a result a) facilitates the effective use of multiple uncalibrated inadmissible heuristics, and b) provides significantly better performance than MHA* whenever tighter sub-optimality bounds on solution quality are desired. Experimental evaluations on a complex full-body robotics motion planning problem and large sliding tile puzzles demonstrate the benefits of our framework.

Downloads

Published

2021-09-01