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
544 Appendix A Search Procedures and Computational Complexity
of nondeterministic choices. Because each nondeterministic choice corresponds to
spawning a set of parallel CPUs, the set of execution traces can be represented as
an execution tree in which each node represents one of the iterations or recursive
invocations of the procedure, the children of each node represent the subprocesses
spawned by the procedure at this point of its iteration or recursion, and each path
in the tree represents an execution trace. This tree is called the procedure’s search
tree or search space.
Here are some of the properties that a problem-solving procedure may have.
Soundness. A deterministic procedure is sound if, whenever it is invoked on
some problem P and returns ...
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