• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Local Search Topology in Planning Benchmarks: A Theoretical Analysis (2002)

Cached

  • Download as a PDF

Download Links

  • [www-is.informatik.uni-oldenburg.de]
  • [www.informatik.uni-freiburg.de]
  • [www.informatik.uni-freiburg.de]
  • [www.informatik.uni-freiburg.de]
  • [ftp.informatik.uni-freiburg.de]
  • [ftp.informatik.uni-freiburg.de]
  • [www.informatik.uni-freiburg.de]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jörg Hoffmann
Citations:46 - 6 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Hoffmann02localsearch,
    author = {Jörg Hoffmann},
    title = {Local Search Topology in Planning Benchmarks: A Theoretical Analysis},
    year = {2002}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. The success of such planners on many of the current benchmarks suggests that in those task's state spaces relaxed goal distances yield a heuristic function of high quality. Recent work has revealed empirical evidence confirming this intuition, stating several hypotheses about the local search topology of the current benchmarks, concerning the non-existence of dead ends and of local minima, as well as a limited maximal distance to exits on benches.

Citations

463 The FF planning system: fast plan generation through heuristic search - Hoffmann, Nebel
263 Planning as heuristic search - Bonet, Geffner - 2001
246 The computational complexity of propositional STRIPS planning - Bylander - 1994
127 A robust and fast action selection mechanism for planning - Bonet, Loerincs, et al. - 1997
102 The automatic inference of state invariants in TIM - Fox, Long - 1998
87 The 1998 AI planning systems competition - McDermott
76 Combining the expressiveness of UCPOP with the efficiency of Graphplan - Gazen, Knoblock - 1997
58 When gravity fails: Local search topology - Frank, Cheeseman, et al. - 1997
53 The AIPS ’00 planning competition - Bacchus
49 On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm - Koehler, Hoffmann
34 A heuristic for domain independent planning and its use in an enforced hill-climbing algorithm - Hoffmann - 2000
27 The automatic inference of state invariants - Fox, Long - 1998
19 MIPS the model-checking integrated planning system - Edelkamp, Helmert - 2001
19 Discovering State Constraints in DISCOPLAN: Some New Results - Gerevini, Schubert - 2000
17 On the complexity of planning in transportation domains - Helmert
13 The 2000 AI Planning Systems Competition - Bacchus
6 Heuristic search planning with bdds - Edelkamp - 2000
3 On the complexity of planning in transportation and manipulation domains,. Diplomarbeit, Albert-Ludwigs-Universität - Helmert - 2001
3 The 1998 AI planning systems competition. The AI Magazine 21(2):35–55 - McDermott
2 The AIPS'00 planning competition. The AI Magazine 22(3):47–56 - Bacchus - 2001
2 Planning as heuristic search. AIJ 129(1--2):5--33 - Bonet, Geffner - 2001
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University