Skip to Main Content
Automated Planning
book

Automated Planning

by Malik Ghallab, Dana Nau, Paolo Traverso
May 2004
Intermediate to advanced content levelIntermediate to advanced
635 pages
19h 46m
English
Morgan Kaufmann
Content preview from Automated Planning
9.3 Heuristics for State-Space Planning 201
as the iterative-deepening scheme, are usually able to guarantee an optimal solution
when guided with an admissible node-selection heuristic. But quite often, one may
have to trade admissibility for informativeness.
9.3 Heuristics for State-Space Planning
This section presents several node-selection heuristics for state-space planning. We
start with a simple heuristic function and present its use in guiding a forward-search
backtracking algorithm, then a backward-search procedure. We then develop sev-
eral more elaborate heuristics and discuss their properties. Finally, the relationship
between these heuristics and the planning-graph techniques is discussed.
9.3.1 State Reachability Relaxation
Let us consider ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Communicate with Teams More Effectively

Communicate with Teams More Effectively

Charles Humble
How to Overcome a Power Deficit

How to Overcome a Power Deficit

Cyril Bouquet, Jean-Louis Barsoux

Publisher Resources

ISBN: 9781558608566