Learning Heuristic Selection with Dynamic Algorithm Configuration

by   David Speck, et al.

A key challenge in satisfying planning is to use multiple heuristics within one heuristic search. An aggregation of multiple heuristic estimates, for example by taking the maximum, has the disadvantage that bad estimates of a single heuristic can negatively affect the whole search. Since the performance of a heuristic varies from instance to instance, approaches such as algorithm selection can be successfully applied. In addition, alternating between multiple heuristics during the search makes it possible to use all heuristics equally and improve performance. However, all these approaches ignore the internal search dynamics of a planning system, which can help to select the most helpful heuristics for the current expansion step. We show that dynamic algorithm configuration can be used for dynamic heuristic selection which takes into account the internal search dynamics of a planning system. Furthermore, we prove that this approach generalizes over existing approaches and that it can exponentially improve the performance of the heuristic search. To learn dynamic heuristic selection, we propose an approach based on reinforcement learning and show empirically that domain-wise learned policies, which take the internal search dynamics of a planning system into account, can exceed existing approaches in terms of coverage.


page 1

page 2

page 3

page 4


A novel approach to model exploration for value function learning

Planning and Learning are complementary approaches. Planning relies on d...

Enhancing Dynamic Symbolic Execution by Automatically Learning Search Heuristics

We present a technique to automatically generate search heuristics for d...

DASH: Dynamic Approach for Switching Heuristics

Complete tree search is a highly effective method for tackling MIP probl...

Multiple-Goal Heuristic Search

This paper presents a new framework for anytime heuristic search where t...

HeCSON: Heuristic for Configuration Selectionin Optical Network Planning

We present a transceiver configuration selection heuristic combining Enh...

Non-Blocking Batch A* (Technical Report)

Heuristic search has traditionally relied on hand-crafted or programmati...

Tracked Instance Search

In this work we propose tracking as a generic addition to the instance s...