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

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

2011-09-26

arxiv.org/abs/1109.5713v1

Journal Of Artificial Intelligence Research, Volume 24, pages 685-758, 2005

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.1747

Between 1998 and 2004, the planning community has seen vast progress in terms of the sizes of benchmark examples that domain-independent planners can tackle successfully. The key technique behind this progress is the use of heuristic functions based on relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. The unprecedented success of such methods, in many commonly used benchmark examples, calls for an understanding of what classes of domains these methods are well suited for. In the investigation at hand, we derive a formal background to such an understanding. We perform a case study covering a range of 30 commonly used STRIPS and ADL benchmark domains, including all examples used in the first four international planning competitions. We *prove* connections between domain structure and local search topology -- heuristic cost surface properties -- under an idealized version of the heuristic functions used in modern planners. The idealized heuristic function is called h^+, and differs from the practically used functions in that it returns the length of an *optimal* relaxed plan, which is NP-hard to compute. We identify several key characteristics of the topology under h^+, concerning the existence/non-existence of unrecognized dead ends, as well as the existence/non-existence of constant upper bounds on the difficulty of escaping local minima and benches. These distinctions divide the (set of all) planning domains into a taxonomy of classes of varying h^+ topology. As it turns out, many of the 30 investigated domains lie in classes with a relatively easy topology. Most particularly, 12 of the domains lie in classes where FFs search algorithm, provided with h^+, is a polynomial solving mechanism. We also present results relating h^+ to its approximation as implemented in FF. The behavior regarding dead ends is provably the same. We summarize the results of an empirical investigation showing that, in many domains, the topological qualities of h^+ are largely inherited by the approximation. The overall investigation gives a rare example of a successful analysis of the connections between typical-case problem structure, and search performance. The theoretical investigation also gives hints on how the topological phenomena might be automatically recognizable by domain analysis techniques. We outline some preliminary steps we made into that direction.

Affiliated with

Also associated with

No associations

Rating

Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-61551