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
5.3 Solution Plans 91
5.3 Solution Plans
In order to define planning algorithms in the plan space, we need to formally specify
what is a solution plan in the plan space. A solution plan for a problem P = (, s
0
, g )
has been formally defined, with respect to the semantics of state-transition systems,
as a sequence of ground actions from s
0
to a state in g (see Section 2.3.3). We now
have to take into account that actions in a partial plan π = (A, , B, L) are only
partially ordered and partially instantiated.
A consistent partial order corresponds to the set of all sequences of totally
ordered actions of A that satisfy the partial order. Technically, these sequences
are the topological orderings of the partial order . There can be an exponential
number ...
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