Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+

01/16/2014
by   Joerg Hoffmann, et al.
0

The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic h+ has amazing qualities in many classical planning benchmarks, in particular pertaining to the complete absence of local minima. The proofs of this are hand-made, raising the question whether such proofs can be lead automatically by domain analysis techniques. In contrast to earlier disappointing results -- the analysis method has exponential runtime and succeeds only in two extremely simple benchmark domains -- we herein answer this question in the affirmative. We establish connections between causal graph structure and h+ topology. This results in low-order polynomial time analysis methods, implemented in a tool we call TorchLight. Of the 12 domains where the absence of local minima has been proved, TorchLight gives strong success guarantees in 8 domains. Empirically, its analysis exhibits strong performance in a further 2 of these domains, plus in 4 more domains where local minima may exist but are rare. In this way, TorchLight can distinguish easy domains from hard ones. By summarizing structural reasons for analysis failure, TorchLight also provides diagnostic output indicating domain aspects that may cause local minima.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/26/2011

Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks

Between 1998 and 2004, the planning community has seen vast progress in ...
research
06/26/2011

Structure and Complexity in Planning with Unary Operators

Unary operator domains -- i.e., domains in which operators have a single...
research
06/27/2012

Convex Structure Learning for Bayesian Networks: Polynomial Feature Selection and Approximate Ordering

We present a new approach to learning the structure and parameters of a ...
research
11/04/2019

Sub-Optimal Local Minima Exist for Almost All Over-parameterized Neural Networks

Does over-parameterization eliminate sub-optimal local minima for neural...
research
02/02/2022

Flipping the switch on local exploration: Genetic Algorithms with Reversals

One important feature of complex systems are problem domains that have m...
research
03/20/2020

A Graduated Filter Method for Large Scale Robust Estimation

Due to the highly non-convex nature of large-scale robust parameter esti...

Please sign up or login with your details

Forgot password? Click here to reset