Hans Kühn Leiva

Extending Weighted Heuristic Search to Bi-Objective Search Problems

In heuristic search, a well-known technique to speed up search while providing a suboptimality guarantee is to multiply the heuristic function by a weight w > 1. In this paper, we study the theoretical and practical implications of using such a technique in bi-objective heuristic search, a natural a