Forward heuristic search planning based on an ordered hill-climbing algorithm

DOI10.3969/J.ISSN.1001-0548.2013.03.028MaRDI QIDQ5399316zbMATH OpenOpenAlexFDO

Authors Ruishi Liang, Yunfei Jiang, Huizhi Yang

Publication date 28 February 2014

Full work available at URL https://www.scholarmate.com/indexhtml/detail/bhHTn3z9PTxRFpTq1Hgurg%3D%3D,14,en_us.html

zbMATH Keywords

AI planningheuristic searchordered hill-climbing algorithmstate adaptive function

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1696710
• The FF planning system: Fast plan generation through heuristic search
• Directing the Search in the Fast Forward Planning
• Stochastic enforced hill-climbing
• Planning as heuristic search

Cited in

(2)

• scientific article; zbMATH DE number 1696710 (Why is no real title available?)
• Stochastic enforced hill-climbing

This page was built for publication: Forward heuristic search planning based on an ordered hill-climbing algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5399316)