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
414 Chapter 17 Planning Based on Model Checking
Strong-Cyclic-Plan is guaranteed to terminate, it is sound (i.e., the returned
policies are strong cyclic solutions), and it is complete (i.e., if it returns failure,
then there exists no strong cyclic solution). It corresponds to the computation of
a greatest fixed point where states are removed when not needed (while strong and
weak planning correspond to the computation of a least fixed point).
We conclude this section with two remarks. First, for the sake of simplicity, we
have described weak, strong, and strong cyclic solutions in terms of properties of a
graph representing the executions of a plan. In Section 17.3, we will show how these
solutions can be expressed as formulas in temporal logic and ...
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